Yuji Matsumoto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuji Matsumoto has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Akihiko Konagaya
RIKEN
1 shared publication - Eisaku Maeda
NTT Communication Science Laboratories, NTT Corporation
1 shared publication - Hideki Isozaki
NTT Communication Science Laboratories, NTT Corp., Seika-cho, Soraku-gun, Kyoto, Japan
1 shared publication - Kaoru Yamamoto1 shared publication
- Kaoru Yamamoto1 shared publication
- Tadashi Nomoto
National Institute of Japanese Literature 1-16-10 142-8585 Yutaka Shinagawa Tokyo Japan
1 shared publication
Latest Publications
- Open Access
- 1 January 2003
- Published by Association for Computational Linguistics (ACL)
- Vol. 13, 65-72
Protein name tagging for biomedical annotation in text
We explore the use of morphological analysis as preprocessing for protein name tagging. Our method finds protein names by chunking based on a morpheme, the smallest unit determined by the morphological analysis. This helps to recognize the exact boundaries of protein names. Moreover, our morphological analyzer can deal with compounds. This offers a simple way to adapt name descriptions from biomedical resources for language processing. Using GENIA corpus 3.01, our method attains f-score of 70 points for protein molecule names, and 75 points for protein names including molecules, families and domains.
- 1 January 2003
- Published by Association for Computational Linguistics (ACL)
- Vol. 13, 65-72
Open AccessProtein name tagging for biomedical annotation in text
We explore the use of morphological analysis as preprocessing for protein name tagging. Our method finds protein names by chunking based on a morpheme, the smallest unit determined by the morphological analysis. This helps to recognize the exact boundaries of protein names. Moreover, our morphological analyzer can deal with compounds. This offers a simple way to adapt name descriptions from biomedical resources for language processing. Using GENIA corpus 3.01, our method attains f-score of 70 points for protein molecule names, and 75 points for protein names including molecules, families and domains.
- 1 January 2003
- Published by Springer Nature
- p. 365-395
Extracting Translation Knowledge from Parallel Corpora
- 1 January 2003
- Published by Springer Nature
- p. 365-395
Extracting Translation Knowledge from Parallel Corpora
- Open Access
- 1 January 2002
- Published by Association for Computational Linguistics (ACL)
- Vol. 1, 1-7
Extracting important sentences with support vector machines
Extracting sentences that contain important information from a document is a form of text summarization. The technique is the key to the automatic generation of summaries similar to those written by humans. To achieve such extraction, it is important to be able to integrate heterogeneous pieces of information. One approach, parameter tuning by machine learning, has been attracting a lot of attention. This paper proposes a method of sentence extraction based on Support Vector Machines (SVMs). To confirm the method's performance, we conduct experiments that compare our method to three existing methods. Results on the Text Summarization Challenge (TSC) corpus show that our method offers the highest accuracy. Moreover, we clarify the different features effective for extracting different document genres.
- 1 January 2002
- Published by Association for Computational Linguistics (ACL)
- Vol. 1, 1-7
Open AccessExtracting important sentences with support vector machines
Extracting sentences that contain important information from a document is a form of text summarization. The technique is the key to the automatic generation of summaries similar to those written by humans. To achieve such extraction, it is important to be able to integrate heterogeneous pieces of information. One approach, parameter tuning by machine learning, has been attracting a lot of attention. This paper proposes a method of sentence extraction based on Support Vector Machines (SVMs). To confirm the method's performance, we conduct experiments that compare our method to three existing methods. Results on the Text Summarization Challenge (TSC) corpus show that our method offers the highest accuracy. Moreover, we clarify the different features effective for extracting different document genres.
- 1 January 2001
- Published by Association for Computational Linguistics (ACL)
Supervised ranking in open-domain text summarization
The paper proposes and empirically motivates an integration of supervised learning with unsupervised learning to deal with human biases in summarization. In particular, we explore the use of probabilistic decision tree within the clustering framework to account for the variation as well as regularity in human created summaries. The corpus of human created extracts is created from a newspaper corpus and used as a test set. We build probabilistic decision trees of different flavors and integrate each of them with the clustering framework. Experiments with the corpus demonstrate that the mixture of the two paradigms generally gives a significant boost in performance compared to cases where either of the two is considered alone.
- 1 January 2001
- Published by Association for Computational Linguistics (ACL)
Supervised ranking in open-domain text summarization
The paper proposes and empirically motivates an integration of supervised learning with unsupervised learning to deal with human biases in summarization. In particular, we explore the use of probabilistic decision tree within the clustering framework to account for the variation as well as regularity in human created summaries. The corpus of human created extracts is created from a newspaper corpus and used as a test set. We build probabilistic decision trees of different flavors and integrate each of them with the clustering framework. Experiments with the corpus demonstrate that the mixture of the two paradigms generally gives a significant boost in performance compared to cases where either of the two is considered alone.