Abstract
Spelling correction is commonly a critical task for a variety of NLP tools. Some systems assist users by offering a set of possible corrections for a given misspelt word. An automatic spelling correction system would be able to choose only one or, at least, to rank them according to a certain criterion. We present a dynamic framework which allows us to combine spelling correction and Part-of-Speech tagging tasks in an efficient way. The result is a system capable of ranking the set of possible corrections taking the context of the erroneous words into account.
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, PGIDIT02SIN01E and “Rede Galega de Procesamento da Linguaxe e Recuperación de Información”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR 163(4), 845–848 (1965)
Graña, J., Alonso, M., Vilares, M.: A common solution for tokenization and part-of-speech tagging. In: Sojka, P., Kopeček, I., Pala, K. (eds.) TSD 2002. LNCS (LNAI), vol. 2448, pp. 3–10. Springer, Heidelberg (2002)
Kukich, K.: Technique for automatically correcting words in text. ACM Computing Surveys 24(4), 377–439 (1992)
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques and tools. Addison-Wesley, MA (1985)
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computations. Addison-Wesley, Reading, MA (1979)
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)
Oflazer, K.: Error-tolerant Finite State Recognition with Applications to Morphological Analysis and Spelling Correction. Computational Linguistics 22 (2006)
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)
Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Trans. Information Theory IT-13 (1967)
Bigert, J., Ericson, L., Solis, A.: Missplel and Autoeval: two generic tools for automatic evaluation. In: Proceedings of Nodalida-2003, Reykjavik, Iceland (2003)
Sebastián, N., Martí, M.A., Carreiras, M.F., Cuetos, F.: LEXESP: léxico informatizado del español. Edicions de la Universitat de Barcelona (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otero, J., Graña, J., Vilares, M. (2007). Contextual Spelling Correction. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-75867-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75866-2
Online ISBN: 978-3-540-75867-9
eBook Packages: Computer ScienceComputer Science (R0)