Skip to main content

On Correction of Semantic Errors in Natural Language Texts with a Dictionary of Literal Paronyms

  • Conference paper
Book cover Advances in Web Intelligence (AWIC 2004)

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

Included in the following conference series:

Abstract

Due to the open nature of the Web, search engines must include means of meaningful processing of incorrect texts, including automatic error detection and correction. One of wide-spread types of errors in Internet texts are malapropisms, i.e., semantic errors replacing a word by another existing word similar in letter composition and/or sound but semantically incompatible with the context. Methods for detection and correction of malapropisms have been proposed recently. Any such method relies on a generator of correction candidates—paronyms, i.e., real words similar to the suspicious one encountered in the text and having the same grammatical properties. Literal paronyms are words at the distant of few editing operations from a given word. We argue that a dictionary of literal paronyms should be compiled beforehand and that its units should be grammeme names. For Spanish, such grammemes are (1) singulars and plurals of nouns; (2) adjectives plus participles; (3) verbs in infinitive; (4) gerunds plus adverbs; (5) personal verb forms. Basing on existing Spanish electronic dictionaries, we have compiled a dictionary of one-letter-distant literal paronyms. The size of the dictionary is few tens thousand entries, an entry averaging approximately three paronyms. We calculate the gain in number of candidate search operations achievable through the proposed dictionary and give illustrative examples of correcting one-letter malapropisms using our dictionary.

Work done under partial support of Mexican Government (CONACyT, SNI, COFAA-IPN) and Korean Government (KIPA Professorship for Visiting Faculty Positions in Korea). The first author is currently on Sabbatical leave at Chung-Ang University.

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

Access this chapter

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. Bolshakov, I.A., Galicia-Haro, S.N.: Can We Correctly Estimate the Total Number of Pages in Google for a Specific Language? In: Gelbukh, A. (ed.) CICLing 2003. LNCS, vol. 2588, pp. 415–419. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Bolshakov, I.A., Gelbukh, A.: A Very Large Database of Collocations and Semantic Links. In: Bouzeghoub, M., Kedad, Z., Métais, E. (eds.) NLDB 2000. LNCS, vol. 1959, pp. 103–114. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Bolshakov, I.A., Gelbukh, A.: On Detection of Malapropisms by Multistage Collocation Testing. In: Dusterhoft, A., Talheim, B. (eds.) 8th Intern. Conference on Applications of Natural Language to Information Systems NLDB 2003, GI-Edition, Bonn. Lecture Notes in In-formatics, vol. P-29, pp. 28–41 (2003)

    Google Scholar 

  4. Hirst, G., St-Onge, D.: Lexical Chains as Representation of Context for Detection and Corrections of Malapropisms. In: Fellbaum, C. (ed.) WordNet: An Electronic Lexical Database, pp. 305–332. The MIT Press, Cambridge (1998)

    Google Scholar 

  5. Kashyap, R.L., Oomen, B.I.: An effective algorithm for string correction using generalized edit distances. I. Description of the algorithm and its optimality. Information Science 23(2), 123–142 (1981)

    Google Scholar 

  6. Mays, E., Damerau, F.J., Mercer, R.L.: Context-based spelling correction. Information Processing and Management 27(5), 517–522 (1992)

    Article  Google Scholar 

  7. Manning, C.D., SchĂĽtze, H.: Foundations of Statistical Natural Language Processing. The MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  8. Oxford Collocations Dictionary for Students of English. Oxford University Press, Oxford (2003)

    Google Scholar 

  9. Wagner, R.A., Fisher, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974)

    Article  MATH  Google Scholar 

  10. Biemann, C., Bordag, S., Heyer, G., Quasthoff, U., Wolff, C.: Language-independent Meth-ods for Compiling Monolingual Lexical Data. In: Gelbukh, A. (ed.) CICLing 2004. LNCS, vol. 2945, pp. 214–225. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gelbukh, A., Bolshakov, I.A. (2004). On Correction of Semantic Errors in Natural Language Texts with a Dictionary of Literal Paronyms. In: Favela, J., Menasalvas, E., Chávez, E. (eds) Advances in Web Intelligence. AWIC 2004. Lecture Notes in Computer Science(), vol 3034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24681-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24681-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22009-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics