Naohiko Uramoto
1998
A Method for Relating Multiple Newspaper Articles by Using Graphs, and Its Application to Webcasting
Naohiko Uramoto | Koichi Takeda
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 2
Naohiko Uramoto | Koichi Takeda
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 2
A Method for Relating Multiple Newspaper Articles by Using Graphs, and Its Application to Webcasting
Naohiko Uramoto | Koichi Takeda
COLING 1998 Volume 2: The 17th International Conference on Computational Linguistics
Naohiko Uramoto | Koichi Takeda
COLING 1998 Volume 2: The 17th International Conference on Computational Linguistics
1996
Positioning Unknown Words in a Thesaurus by Using Information Extracted from a Corpus
Naohiko Uramoto
COLING 1996 Volume 2: The 16th International Conference on Computational Linguistics
Naohiko Uramoto
COLING 1996 Volume 2: The 16th International Conference on Computational Linguistics
1995
Automatic Learning of Knowledge for Example-Based Disambiguation of Attachment
Naohiko Uramoto
Proceedings of the Sixth Conference on Theoretical and Methodological Issues in Machine Translation of Natural Languages
Naohiko Uramoto
Proceedings of the Sixth Conference on Theoretical and Methodological Issues in Machine Translation of Natural Languages
1994
Extracting a Disambiguated Thesaurus from Parallel Dictionary Definitions
Naohiko Uramoto
Second Workshop on Very Large Corpora
Naohiko Uramoto
Second Workshop on Very Large Corpora
This paper describes a method for extracting disambiguated (bilingual) is-a relationships from parallel (English and Japanese) dictionary definitions by using word-level alignment. Definitions have a specific pattern, namely, a "genus term and differentia" structure; therefore, bilingual genus terms can be extracted by using bilingual pattern matching. For the alignment of words in the genus terms, a dynamic programming framework for sentence-level alignment proposed by Gale et al. [6] is used.
A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation
Naohiko Uramoto
COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics
Naohiko Uramoto
COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics