Regional vs. global robust spelling correction

Authors:
Manuel Vilares Ferro;Juan Otero Pombo;Víctor Manuel Darriba Bilbao
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 Vigo, Orense, Spain
Venue:
CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing
Year:
2006

Citing 10
Cited 0

Applications of finite automata representing large vocabularies

Software—Practice & Experience
A fast algorithm for string matching with mismatches

Information Processing Letters
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction

Computational Linguistics
Integrated Correction of Ill-Formed Sentences

AI '97 Proceedings of the 10th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
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
Combining Trigram-based and feature-based methods for context-sensitive spelling correction

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
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

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.