Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction (1996)
| Venue: | Computational Linguistics |
| Citations: | 31 - 3 self |
BibTeX
@ARTICLE{Oflazer96error-tolerantfinite-state,
author = {Kemal Oflazer},
title = {Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction},
journal = {Computational Linguistics},
year = {1996},
volume = {22},
pages = {73--89}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents the notion of error-tolerant recognition with finite-state recognizers along with results from some applications. Error-tolerant recognition enables the recognition of strings that deviate mildly from any string in the regular set recognized by the underlying finite-state recognizer. Such recognition has applications to error-tolerant morphological processing, spelling correction, and approximate string matching in information retrieval. After a description of the concepts and algorithms involved, we give examples from two applications: in the context of mor-phological analysis, error-tolerant recognition allows misspelled input word forms to be corrected and morphologically analyzed concurrently. We present an application of this to error-tolerant analysis of the agglutinative morphology of Turkish words. The algorithm can be applied to morphological analysis of any language whose morphology has been fully captured by a single (and possibly very large) finite-state transducer, regardless of the word formation processes and morphographemic phenomena involved. In the context of spelling correction, error-tolerant recog-nition can be used to enumerate candidate correct forms from a given misspelled string within a certain edit distance. Error-tolerant recognition can be applied to spelling correction for any language, if (a) it has a word list comprising all inflected forms, or (b) its morphology has been
Citations
No citations identified.
