Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Old, L. J. (2006). Homograph disambiguation using formal concept analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3874 LNAI, pp. 221–232). https://doi.org/10.1007/11671404_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
