Naohiko Uramoto


Fixing paper assignments

  1. Please select all papers that belong to the same person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here


1998

pdf bib
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

pdf bib
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

1996

pdf bib
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

1995

pdf bib
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

1994

pdf bib
Extracting a Disambiguated Thesaurus from Parallel Dictionary Definitions
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.

pdf bib
A Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation
Naohiko Uramoto
COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics

1992

pdf bib
Shalt2- a Symmetric Machine Translation System with Conceptual Transfer
Koichi Takeda | Naohiko Uramoto | Tetsuya Nasukawa | Taijiro Tsutsumi
COLING 1992 Volume 3: The 14th International Conference on Computational Linguistics