scispace - formally typeset
Book ChapterDOI

Regional finite-state error repair

TLDR
An algorithm to deal with error repair over finite-state architectures that guarantees asymptotic equivalence with global repair strategies and relies on a regional least-cost repair strategy, dynamically gathering all relevant information in the context of the error location.
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.

read more

Citations
More filters
Book ChapterDOI

Contextual spelling correction

TL;DR: A dynamic framework is presented which allows us to combine spelling correction and Part-of-Speech tagging tasks in an efficient way and is capable of ranking the set of possible corrections taking the context of the erroneous words into account.
Book ChapterDOI

On Asymptotic Finite-State Error Repair

TL;DR: This work claims that regional techniques provide a performance and quality comparable to that attained by global criteria, with a significant saving in time and space.
Journal Article

Spelling correction on technical documents

TL;DR: In this article, the authors describe a novel approach to spelling correction applied on technical documents, a task that requires a number of especific properties such as efficiency, safety and maintenance.
Book ChapterDOI

Spelling correction on technical documents

TL;DR: A novel approach to spelling correction applied on technical documents, which seems to reach the same quality provided by the most performance classic techniques, but with a significant reduction on both time and space costs.
Book ChapterDOI

Regional vs. global robust spelling correction

TL;DR: This work explores the practical viability of a regional architecture to deal with robust spelling correction, a process including both unknown sequences recognition and spelling correction.
References
More filters
Journal ArticleDOI

Techniques for automatically correcting words in text

Karen Kukich
TL;DR: Research aimed at correcting words in text has focused on three progressively more difficult problems: nonword error detection; (2) isolated-word error correction; and (3) context-dependent work correction, which surveys documented findings on spelling error patterns.
Book

Morphology and computation

TL;DR: The nature of morphology, the structure of words, and word-formation rules, and the order of morphemes phonology psycholinguistic evidence are discussed.
Posted Content

Error-tolerant Finite State Recognition with Applications to Morphological Analysis and Spelling Correction

TL;DR: Error-tolerant recognition as mentioned in this paper enables the recognition of strings that deviate mildly from any string in the regular set recognized by the underlying finite state recognizer, which can be applied to morphological analysis of any language whose morphology is fully captured by a single (and possibly very large) finite state transducer.
Posted Content

Incremental construction of minimal acyclic finite-state automata

TL;DR: In this article, a method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings is presented, which is based on the lexicographical ordering of the input strings.