Regional finite-state error repair

Authors:
Manuel Vilares;Juan Otero;Jorge Graña
Affiliations:
Department of Computer Science, University of Vigo, Orense, Spain;Department of Computer Science, University of Vigo, Orense, Spain;Department of Computer Science, University of A Coruña, A Coruña, Spain
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 6
Cited 4

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
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

Contextual spelling correction

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Regional vs. global robust spelling correction

CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing
Spelling correction on technical documents

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Robust spelling correction

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algorithm to deal with error repair over finite-state architectures. Such a technique is of interest in spelling correction as well as approximate string matching in a variety of applications related to natural language processing, such as information extraction/recovery or answer searching, where error-tolerant recognition allows misspelled input words to be integrated in the computational process. Our proposal relies on a regional least-cost repair strategy, dynamically gathering all relevant information in the context of the error location. The system guarantees asymptotic equivalence with global repair strategies.