Abstract
The paper introduces a robust spelling correction technique to deal with ill-formed input strings, including unknown parts of unknown length. In contrast to previous works, we derive profit from a finer dynamic programming construction, which takes advantage of the underlying grammatical structure, leading to an improved computational behavior and error repair quality. The formal description applies a deductive approach in order to simplify this task, separating it from the interpretation strategy, and including cut-off facilities.
Research supported by the Spanish Government under projects TIN2004-07246-C03-01, TIN2004-07246-C03-02, and the Autonomous Government of Galicia under projects PGIDIT03SIN30501PR and PGIDIT02SIN01E.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Peterson, J.: Computer Programs For Spelling Correction. Springer-Verlag, Inc., Berlin, Germany / Heidelberg, Germany / London, UK / etc. (1980)
Kukich, K.: Techniques for automatically correcting words in text. ACM Computing Surveys 24, 377–439 (1992)
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. Association for Computational Linguistics, Morgan Kaufmann Publishers, San Francisco, California (1998)
Elmi, M., Evens, M.: Spelling correction using context. In: Boitet, C., Whitelock, P. (eds.) Proc. of the 36th Annual Meeting of the ACL, pp. 360–364. Association for Computational Linguistics, Morgan Kaufmann Publishers, San Francisco, California (1998)
Oflazer, K.: Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computational Linguistics 22, 73–89 (1996)
Du, M., Chang, S.: A model and a fast algorithm for multiple errors spelling correction. Acta Informatica 29, 281–302 (1992)
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)
Lucchesi, C., Kowaltowski, T.: Applications of finite automata representing large vocabularies. Software-Practice and Experience 23, 15–30 (1993)
Graña, J., Barcala, F., Alonso, M.: 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 (2003)
Daciuk, J., Mihov, S., Watson, B., Watson, R.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics 26, 3–16 (2000)
Sikkel, K.: Parsing Schemata. PhD thesis, Univ. of Twente, The Netherlands (1993)
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 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilares, M., Otero, J., Vilares, J. (2006). Robust Spelling Correction. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_27
Download citation
DOI: https://doi.org/10.1007/11605157_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)