Fast string correction with Levenshtein automata

DOI10.1007/s10032-002-0082-8zbMath1039.68137DBLPjournals/ijdar/SchulzM02OpenAlexW2040102554WikidataQ30053406 ScholiaQ30053406MaRDI QIDQ1403072

Stoyan Mihov, Klaus U. Schulz

Publication date: 31 August 2003

Published in: International Journal on Document Analysis and Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10032-002-0082-8

zbMATH Keywords

Levenshtein distanceOptical character recognitionElectronic dictionariesSpelling correction

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Natural language processing (68T50)

Related Items (16)

Evaluation of string comparators for record linkage in Chinese environment ⋮ Property-directed verification and robustness certification of recurrent neural networks ⋮ Breadth-first search strategies for trie-based syntactic pattern recognition ⋮ Quantitative monitoring of STL with edit distance ⋮ Fast Approximate Search in Large Dictionaries ⋮ Volume formula and growth rates of the balls of strings under the edit distances ⋮ Differential privacy for symbolic systems with application to Markov chains ⋮ Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Descriptional Complexity of Error Detection ⋮ Planning to Chronicle ⋮ Computation of Similarity—Similarity Search as Computation ⋮ Computing the Expected Edit Distance from a String to a PFA ⋮ STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA ⋮ Unnamed Item ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

This page was built for publication: Fast string correction with Levenshtein automata