Skip to search formSkip to main contentSkip to account menu

Levenshtein automaton

Known as: Levenshtein automata, Levenshtein transducer 
In computer science, a Levenshtein automaton for a string w and a number n is a finite state automaton that can recognize the set of all strings… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
BacktrackingComputer scienceDamerau–Levenshtein distanceDynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
GenAx: A Genome Sequencing Accelerator
Genomics can transform health-care through precision medicine. Plummeting sequencing costs would soon make genome testing… 
2015
2015
Multi-Source Entity Resolution for Genealogical Data
In this chapter, we study the application of existing entity resolution (ER) techniques on a real-world multi-source genealogical… 
2014
2014
Incorporating paraphrasing in translation memory matching and retrieval
Current Translation Memory (TM) systems work at the surface level and lack semantic knowledge while matching. This paper presents… 
2013
2013
Normalisation of Historical Text Using Context-Sensitive Weighted Levenshtein Distance and Compound Splitting
Natural language processing for historical text imposes a variety of challenges, such as to deal with a high degree of spelling… 
2009
2009
Polynomial techniques for investigation of spherical designs
We investigate the structure of spherical τ-designs by applying polynomial techniques for investigation of some inner products of… 
2009
2009
Which Reputations Does a Brand Owner Need? Evidence from Trade Mark Opposition
At least two: the reputation of their brand and a reputation for being tough on imitators of this brand. Sustaining a brand… 
2008
2008
Language Independent Text Correction using Finite State Automata
Many natural language applications, like machine translation and information extraction, are required to operate on text with… 
Highly Cited
2002
Highly Cited
2002
Fast string correction with Levenshtein automata
Abstract. The Levenshtein distance between two words is the minimal number of insertions, deletions or substitutions that are… 
Highly Cited
1997
Highly Cited
1997
Measuring Dialect Distance Phonetically
We describe ongoing work in the experi(cid:1) mental evaluation of a range of methods for measuring the phonetic distance be(cid… 
1983
1983
The Noisy Substring Matching Problem
Let T(U) be the set of words in the dictionary H which contains U as a substring. The problem considered here is the estimation… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)