Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,605,519 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Backtracking
Computer science
Damerau–Levenshtein distance
Dynamic programming
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Plagiarism Detection in SQL Student Assignments
N. Scerbakov
,
A. Schukin
,
Oleg Sabinin
International Conference on Interactive…
2017
Corpus ID: 64851017
An original method for plagiarism detection in SQL student assignments has been proposed. The method is based on identifying so…
Expand
2016
2016
Algorithm:Levenshtein Rcpp
M. E. Macherki
2016
Corpus ID: 63527689
2016
2016
Subset Encoding: Increasing Pattern Density for Finite Automata
Kevin Skadron
,
Ke Wang
,
Nathan Brunelle
,
Chunkun Bo
,
Deyuan Guo
2016
Corpus ID: 2736498
Micron’s Automata Processor is an innovative reconfigurable hardware accelerator for parallel finite-automatabased regular…
Expand
2015
2015
Detecting English-French Cognates Using Orthographic Edit Distance
Qiongkai Xu
,
Albert Chen
,
Chang Li
Australasian Language Technology Association…
2015
Corpus ID: 12681840
Identification of cognates is an important component of computer assisted second language learning systems. We present a simple…
Expand
2013
2013
From Recurrent Neural Network to Long Short Term Memory Architecture
Xia Wei
2013
Corpus ID: 209102123
Despite more than 30 years of handwriting recognition research, Recognizing the unconstrained sequence is still a challenge task…
Expand
2013
2013
개선된 Levenshtein Distance 알고리즘을 사용한 어휘 탐색 시스템
종섭 이
,
상엽 오
2013
Corpus ID: 63442610
기존의 Levenshtein distance 알고리즘은 어휘들 간의 순서가 정해져 있지 않은 경우에 사용되므로 어휘 탐색 작업의 중요도를 구분할 수 없는 단점을 가진다. 본 연구에서 제안하는 개선된 Levenshtein…
Expand
2011
2011
A new matching algorithm for Chinese place names
Gang Cheng
,
Fei Wang
,
Haiyan Lv
,
Yin-ling Zhang
GEOINFORMATICS
2011
Corpus ID: 20489729
Matching algorithm for Place Names is one of the most important research topics in the construction of digital gazetteers. Taking…
Expand
2007
2007
PENGOREKSIAN EJAAN KATA MENGGUNAKAN TEKNIK LEVENSHTEIN-AUTOMATA
Firdah Tia Yuliana
2007
Corpus ID: 196071901
2005
2005
De moderne norske dialekters stilling indenfor den nordiske sprogfamilie
Charlotte Gooskens
,
W. Heeringa
2005
Corpus ID: 184936306
1. Introduktion Formålet med vores undersøgelse var at få større indsigt i de norske dialekters indbyrdes lingvistiske forhold…
Expand
1996
1996
Phonetic Distance between Dutch DialectsJohn Nerbonne
John Nerbonne
,
W. Heeringa
,
Erik Van Den Hout
,
Peter Van Der Kooi
,
S. Otten
,
Willem Van De Vis
1996
Corpus ID: 17703272
Traditional dialectology relies on identifying language features which are common to one dialect area while distinguishing it…
Expand