Homograph disambiguation using formal concept analysis

Authors:
L. John Old
Affiliations:
School of Computing, Napier University, Edinburgh, UK
Venue:
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Year:
2006

Citing 4
Cited 2

An evaluation of type-10 homograph discrimination at the semi-colon level in Roget's International Thesaurus

SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Revealing Class Structure with Concept Lattices

WCRE '03 Proceedings of the 10th Working Conference on Reverse Engineering
Word-sense disambiguation using statistical models of Roget's categories trained on large corpora

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2

Data weeding techniques applied to Roget's thesaurus

KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Review: Formal concept analysis in knowledge processing: A survey on applications

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.