A model and a fast algorithm for multiple errors spelling correction
Acta Informatica
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Extended finite state models of language
Extended finite state models of language
The String-to-String Correction Problem
Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A technique for computer detection and correction of spelling errors
Communications of the ACM
Finite-State Language Processing
Finite-State Language Processing
Minimization of Sequential Transducers
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
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
Morphosyntactic correction in natural language interfaces
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
The typology of unknown words: an experimental study of two corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Text Retrieval through Corrupted Queries
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Corrupted queries in Spanish text retrieval: error correction vs. N-Grams
Proceedings of the 2nd ACM workshop on Improving non english web searching
Ordering the suggestions of a spellchecker without using context*
Natural Language Engineering
Contextual spelling correction
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Managing misspelled queries in IR applications
Information Processing and Management: an International Journal
Regional vs. global robust spelling correction
CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing
Regional versus global finite-state error repair
CICLing'05 Proceedings of the 6th 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
Regional finite-state error repair
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
A method of error-tolerant lookup in a finite-state lexicon is described, as well as its application to automatic spelling correction. We compare our method to the algorithm by K. Oflazer [14]. While Oflazer's algorithm searches for all possible corrections of a misspelled word that are within a given similarity threshold, our approach is to retain only the most similar corrections (nearest neighbours), reducing dynamically the search space in the lexicon, and to reach the first correction as soon as possible.