Regional vs. Global Robust Spelling Correction (original) (raw)

Abstract

We explore the practical viability of a regional architecture to deal with robust spelling correction, a process including both unknown sequences recognition and spelling correction. Our goal is to reconcile these techniques from both the topological and the operational point of view. In contrast to the global strategy of most spelling correction algorithms, and local ones associated with the completion of unknown sequences, our proposal seems to provide an unified framework allowing us to maintain the advantages in each case, and avoid the drawbacks.

This research has been partially supported by the Spanish Government under projects TIN2004-07246-C03-01, and the Autonomous Government of Galicia under projects PGIDIT05PXIC30501PN, PGIDIT05SIN059E, PGIDIT05SIN044E, PGIDIT04SIN065E and PGIDIT03SIN30501PR.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Agirre, E., Gojenola, K., Sarasola, K., Voutilainen, A.: Towards a single proposal in spelling correction. In: Boitet, C., Whitelock, P. (eds.) Proc. of the 36th Annual Meeting of the ACL, pp. 22–28 (1998)
    Google Scholar
  2. Baeza-Yates, R.A., Navarro, G.: Faster approximate string matching. Algorithmica 23(2), 127–158 (1999)
    Article MATH MathSciNet Google Scholar
  3. Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics 26(1), 3–16 (2000)
    Article MathSciNet Google Scholar
  4. Dermouche, A.: A fast algorithm for string matching with mismatches. Information Processing Letters 55(2), 105–110 (1995)
    Article MATH MathSciNet Google Scholar
  5. Golding, A.R., Schabes, Y.: Combining trigram-based and feature-based methods for context-sensitive spelling correction. In: Proc. of the 34th Annual Meeting of the ACL (1996)
    Google Scholar
  6. Graña, J., Barcala, F.M., Alonso, M.A.: Compilation methods of minimal acyclic automata for large dictionaries. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol. 2494, pp. 135–148. Springer, Heidelberg (2002)
    Chapter Google Scholar
  7. Lucchesi, C.L., Kowaltowski, T.: Applications of finite automata representing large vocabularies. Software-Practice and Experience 23(1), 15–30 (1993)
    Article Google Scholar
  8. Min, K., Wilson, W.H.: Integrated correction of ill-formed sentences. In: Sattar, A. (ed.) Canadian AI 1997. LNCS, vol. 1342, pp. 369–378. Springer, Heidelberg (1997)
    Chapter Google Scholar
  9. Oflazer, K.: Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics 22(1), 73–89 (1996)
    Google Scholar
  10. Savary, A.: Typographical nearest-neighbor search in a finite-state lexicon and its application to spelling correction. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol. 2494, pp. 251–260. Springer, Heidelberg (2001)
    Chapter Google Scholar
  11. Sikkel, K.: Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands (1993)
    Google Scholar
  12. Vilares, M., Otero, J., Graña, J.: Regional finite-state error repair. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 269–280. Springer, Heidelberg (2005)
    Chapter Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Vigo, Campus As Lagoas s/n, 32004, Orense, Spain
    Manuel Vilares Ferro, Juan Otero Pombo & Víctor Manuel Darriba Bilbao

Authors

  1. Manuel Vilares Ferro
  2. Juan Otero Pombo
  3. Víctor Manuel Darriba Bilbao

Editor information

Editors and Affiliations

  1. National Polytechnic Institute, Center for Computing Research, 07738, Mexico City, México
    Alexander Gelbukh

Rights and permissions

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferro, M.V., Pombo, J.O., Bilbao, V.M.D. (2006). Regional vs. Global Robust Spelling Correction. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2006. Lecture Notes in Computer Science, vol 3878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671299\_61

Download citation

Keywords

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.

Publish with us