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â€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Antonia Wachter-Zeh
- ArXiv
- 2017

List decoding of insertions and deletions in the Levenshtein metric is considered. The Levenshtein distance between two sequencesâ€¦Â (More)

Is this relevant?

2015

2015

- Tommy Tracy, Mircea R. Stan, +4 authors Gabriel Robins
- 2015

The Levenshtein Nondeterministic Finite state Automaton (NFA) recognizes input strings within a set edit distance of a configuredâ€¦Â (More)

Is this relevant?

2014

2014

- Rohit Gupta
- 2014

Current Translation Memory (TM) systems work at the surface level and lack semantic knowledge while matching. This paper presentsâ€¦Â (More)

Is this relevant?

2013

2013

- S. Dutta Chowdhury, Ujjwal Bhattacharya, Swapan K. Parui
- 2013 12th International Conference on Documentâ€¦
- 2013

In this article, we propose a novel scheme for online handwritten character recognition based on Levenshtein distance metricâ€¦Â (More)

Is this relevant?

2011

2011

- Simon J. Greenhill
- Computational Linguistics
- 2011

The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one stringâ€¦Â (More)

Is this relevant?

2009

2009

The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) â‰¤ s whenever x, y âˆˆ W, x 6= y, is denoted by Aâ€¦Â (More)

Is this relevant?

2008

2008

- Haifeng Li, Hong Wei Chen
- 2008 3rd International Conference on Innovativeâ€¦
- 2008

Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximateâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Klaus U. Schulz, Stoyan Mihov
- International Journal on Document Analysis andâ€¦
- 2002

The Levenshtein distance between two words is the minimal number of insertions, deletions or substitutions that are needed toâ€¦Â (More)

Is this relevant?

1997

1992

1992

- Patrice Frisony, Eric Picheralz, Patrice Frison
- 1992

This paper describes the integration of a spelling corrector into the structured editor Grif. This corrector is based on theâ€¦Â (More)

Is this relevant?