Skip to main content
SpringerLink
Log in

Homograph Disambiguation Using Formal Concept Analysis

  • Conference paper
Formal Concept Analysis

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3874))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berrey, L. (ed.): Roget’s international thesaurus, 3rd edn. Crowell, New York (1962)

    Google Scholar 

  2. Bryan, R.M.: Abstract thesauri and graph theory applications to thesaurus research. In: Sedelow, S.Y. (ed.) Automated language analysis, report on research 1972-1973, pp. 45–89. University of Kansas, Lawrence (1973)

    Google Scholar 

  3. Dekel, U., Yossi, G.: Revealing class structure with concept lattices. In: The Tenth Working Conference on Reverse Engineering, pp. 353–365. IEEE Computer Society Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  4. Ganter, B., Wille, R.: Formal concept analysis: Mathematical foundations. Springer, Heidelberg (1999) ISBN 3-3540-62771-5

    MATH  Google Scholar 

  5. Jacuzzi, V.: Modeling semantic association using the hierarchical structure of Roget’s international thesaurus. Paper presented at the Dictionary Society of North America Conference, Columbus, Missouri (May 1991)

    Google Scholar 

  6. Miller, G., Beckwith, R., Fellbaum, C., Gross, D., Miller, K., Tengi, R.: Five papers on WordNet, Technical Report. Princeton University, Princeton, N.J. (1993)

    Google Scholar 

  7. Priss, U.: Relational concept analysis: Semantic structures in dictionaries and lexical databases, Doctoral Dissertation, Technical University of Darmstadt 1998. Shaker Verlag, Aachen, Germany (1996)

    Google Scholar 

  8. Priss, U., Old, L.J.: Modelling lexical databases with formal concept analysis. Journal of Universal Computer Science 10(8), 967–984 (2004)

    Google Scholar 

  9. Sedelow, S.Y.: Exploring the terra incognita of whole-language thesauri. In: Gamble, R., Ball, W. (eds.) Proceedings of the Third Midwest AI and Cognitive Science Conference, pp. 108–111. Southern Illinois University, Carbondale (1991)

    Google Scholar 

  10. Talburt, J.R., Mooney, D.M.: An evaluation of Type-10 homograph discrimination at the semi-colon level in Roget’s international thesaurus. In: Proceedings of the 1990 ACM SIGSMALL/PC Symposium, pp. 156–159 (1990)

    Google Scholar 

  11. Vogt, F.: Formale Begriffsanalyse mit C++: Datenstrukturen und Algorithmen. Springer, Heidelberg (1996) ISBN: 3-540-61071-5

    Google Scholar 

  12. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445–470. Reidel, Dordrecht (1982)

    Google Scholar 

  13. Woolf, B.H. (ed.): Webster’s new collegiate dictionary. G. & C. Merriam Company, Springfield (1976)

    Google Scholar 

  14. Yarowsky, D.: Word-sense disambiguation using statistical models of Roget’s categories trained on large corpora. In: Proceedings of 14th International Conference on Computational Linguistics, COLING 1992, Nantes, pp. 454–460 (1992)

    Google Scholar 

  15. Yarowsky, D.: Homograph disambiguation in text-to-speech synthesis. In: van Santen, J., Sproat, R., Olive, J., Hirschberg, J. (eds.) Progress in Speech Synthesis. Springer, New York (1996)

    Google Scholar 

  16. Yarowsky, D.: Word sense disambiguation. In: Dale, R., Moisl, H., Somers, H. (eds.) The Handbook of Natural Language Processing, pp. 629–654. Marcel Dekker, New York (2000)

    Google Scholar 

  17. Yevtushenko, S.: Conexp (Concept Explorer) 4-Beta. SourceForge.net (2005), Available via http://sourceforge.net/projects/conexp

Download references

Author information

Authors and Affiliations

  1. School of Computing, Napier University, Edinburgh, UK

    L. John Old

Authors
  1. L. John Old
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Département d’informatique et d’ingénierie, Université du Québec en Outaouais, succursale B, C.P. 1250, J8X 3X7, Gatineau, Québec, Canada

    Rokia Missaoui

  2. Mathematisches Institut, Universität Bern, Sidlerstr. 5, 3012, Bern, Switzerland

    Jürg Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Old, L.J. (2006). Homograph Disambiguation Using Formal Concept Analysis. In: Missaoui, R., Schmidt, J. (eds) Formal Concept Analysis. Lecture Notes in Computer Science(), vol 3874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671404_15

Download citation

  • DOI: https://doi.org/10.1007/11671404_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32203-0

  • Online ISBN: 978-3-540-32204-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation