Detection and Correction of Malapropisms in Spanish by Means of Internet Search

  • Igor A. Bolshakov
  • Sofia N. Galicia-Haro
  • Alexander Gelbukh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3658)


Malapropisms are real-word errors that lead to syntactically correct but semantically implausible text. We report an experiment on detection and correction of Spanish malapropisms. Malapropos words semantically destroy collocations (syntactically connected word pairs) they are in. Thus we detect possible malapropisms as words that do not form semantically plausible collocations with neighboring words. As correction candidates, we select words similar to the suspected one but forming plausible collocations with neighboring words. To judge semantic plausibility of a collocation, we use Google statistics of occurrences of the word combination and of the two words taken apart. Since collocation components can be separated by other words in a sentence, Google statistics is gathered for the most probable distance between them. The statistics is recalculated to a specially defined Semantic Compatibility Index (SCI). Heuristic rules are proposed to signal malapropisms when SCI values are lower than a predetermined threshold and to retain a few highly SCI-ranked correction candidates. Our experiments gave promising results.


Content Word Editing Operation Word Combination Probable Distance True Correction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bolshakov, I.A., Gelbukh, A.: On Detection of Malapropisms by Multistage Collocation Testing. In: NLDB 2003, GI-Edition, Bonn. LNI, vol. P-29, pp. 28–41 (2003)Google Scholar
  2. 2.
    Bolshakov, I.A., Gelbukh, A.: Paronyms for Accelerated Correction of Semantic Errors. International Journal on Information Theories and Applications 10, 11–19 (2003)Google Scholar
  3. 3.
    Keller, F., Lapata, M.: Using the Web to Obtain Frequencies for Unseen Bigram. Computational linguistics 29(3), 459–484 (2003)CrossRefGoogle Scholar
  4. 4.
    Kilgarriff, A., Grefenstette, G.: Introduction to the Special Issue on the Web as Corpus. Computational linguistics 29(3), 333–347 (2003)CrossRefMathSciNetGoogle Scholar
  5. 5.
    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. MIT Press, Cambridge (1998)Google Scholar
  6. 6.
    Manning, C., Schütze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)zbMATHGoogle Scholar
  7. 7.
    Mel’čuk, I.: Dependency Syntax: Theory and Practice. SONY Press, NY (1988)Google Scholar
  8. 8.
    Wermter, J., Hahn, U.: Collocation Extraction Based on Modifiability Statistics. In: Proc. COLING 2004, Geneva, Switzerland, August 2004, pp. 980–986 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Igor A. Bolshakov
    • 1
  • Sofia N. Galicia-Haro
    • 2
  • Alexander Gelbukh
    • 1
  1. 1.Center for Computing Research (CIC)National Polytechnic Institute (IPN)Mexico
  2. 2.Faculty of SciencesNational Autonomous University of Mexico (UNAM)Mexico

Personalised recommendations