Robust spelling correction

Authors:
Manuel Vilares;Juan Otero;Jesús Vilares
Affiliations:
Department of Computer Science, University of Vigo, Ourense, Spain;Department of Computer Science, University of Vigo, Ourense, Spain;Department of Computer Science, University of A Coruña, A Coruña, Spain
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 11
Cited 0

A model and a fast algorithm for multiple errors spelling correction

Acta Informatica
Techniques for automatically correcting words in text

ACM Computing Surveys (CSUR)
Applications of finite automata representing large vocabularies

Software—Practice & Experience
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction

Computational Linguistics
Computer Programs for Spelling Correction

Computer Programs for Spelling Correction
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
Towards a single proposal in spelling correction

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Spelling correction using context

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Regional finite-state error repair

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.