论文信息 - Homograph Disambiguation Using Formal Concept Analysis

Homograph Disambiguation Using Formal Concept Analysis

Homographs are words with identical spellings but different origins and meanings. Natural language processing must deal with the disambiguation of homographs and the attribution of senses to them. Advances have been made using context to discriminate homographs, but the problem is still open. Disambiguating homographs is possible using formal concept analysis. This paper discusses the issues, illustrated by examples, using data from Roget's Thesaurus.

L. John Old | L. Old

[1] Thomas Y.crowell. Rogets International Thesaurus , 1946 .

[2] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .

[3] Joseph Gil,et al. Revealing class structure with concept lattices , 2003, 10th Working Conference on Reverse Engineering, 2003. WCRE 2003. Proceedings..

[4] David Yarowsky,et al. Homograph Disambiguation in Text-to-Speech Synthesis , 1997 .

[5] John R. Talburt,et al. An evaluation of type-10 homograph discrimination at the semi-colon level in Roget's International Thesaurus , 1990, SIGSMALL '90.

[6] Frank Vogt. Formale Begriffsanalyse mit C++ - Datenstrukturen und Algorithmen , 1996 .

[7] Frank Vogt. Formale Begriffsanalyse mit C , 1996 .

[8] Noah Webster,et al. Webster's new collegiate dictionary , 1936 .

[9] Peter Mark Roget,et al. Roget's International Thesaurus , 1977 .

[10] Uta Priss,et al. Relational concept analysis: semantic structures in dictionaries and lexical databases , 1998 .

[11] David Yarowsky,et al. Word-Sense Disambiguation Using Statistical Models of Roget’s Categories Trained on Large Corpora , 2010, COLING.

[12] L. John Old,et al. Modelling Lexical Databases with Formal Concept Analysis , 2004, J. Univers. Comput. Sci..