Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
160 | Klaus U. Schulz, Stoyan Mihov |
Fast string correction with Levenshtein automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Document Anal. Recognit. ![In: Int. J. Document Anal. Recognit. 5(1), pp. 67-85, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Optical character recognition, Levenshtein distance, Spelling correction, Electronic dictionaries |
72 | Philippe Gentric |
Experimental results on improved handwritten word recognition using the Levenshtein metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 364-367, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Levenshtein metric, discrete words, lexical processor, radial basis function classifier, substitution costs, lexical search scheme, classifier confusion matrix, substitution cost estimation, optical character recognition, handwriting recognition, image classification, feedforward neural nets, handwritten word recognition |
59 | Serdar Boztas |
New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings, pp. 410-419, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
59 | Peter G. Boyvalenkov, Ivan N. Landgev |
On Maximal Spherical Codes I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings, pp. 158-168, 1995, Springer, 3-540-60114-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
58 | Yujian Li, Bi Liu |
A Normalized Levenshtein Distance Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(6), pp. 1091-1095, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
AESA, metric, Sequence comparison, Levenshtein distance, normalized edit distance |
58 | Jeffrey Ng, Shaogang Gong |
Learning Intrinsic Video Content Using Levenshtein Distance in Graph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (4) ![In: Computer Vision - ECCV 2002, 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002, Proceedings, Part IV, pp. 670-684, 2002, Springer, 3-540-43748-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Automatic Model Order Selection, Modelling Video Content, Normalised Cut, Trajectory Modelling, Graph-Partitioning, Dynamic Time Warping, Unsupervised Clustering, Levenshtein Distance |
52 | Halszka Jarodzka, Kenneth Holmqvist, Marcus Nyström |
A vector-based, multidimensional scanpath similarity measure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETRA ![In: Proceedings of the 2010 Symposium on Eye-Tracking Research & Applications, ETRA 2010, Austin, Texas, USA, March 22-24, 2010, pp. 211-218, 2010, ACM, 978-1-60558-994-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
vector, sequence analysis, Levenshtein distance, string edit, scanpath |
50 | Damien Michel, Antonis A. Argyros, Manolis I. A. Lourakis |
Localizing Unordered Panoramic Images Using the Levenshtein Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-7, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Klaus U. Schulz, Stoyan Mihov, Petar Mitankin |
Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 9th International Conference on Document Analysis and Recognition (ICDAR 2007), 23-26 September, Curitiba, Paraná, Brazil, pp. 471-475, 2007, IEEE Computer Society, 978-0-7695-2822-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Cen Li, Jungsoon P. Yoo |
A study of the effects of bias in criterion functions for temporal data clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference (1) ![In: Proceedings of the 43nd Annual Southeast Regional Conference, 2005, Kennesaw, Georgia, USA, March 18-20, 2005, Volume 1, pp. 85-89, 2005, ACM, 1-59593-059-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Markov chain clustering, clustering applications, temporal data clustering, similarity measures, clustering analysis, Levenshtein distance |
37 | Patricio Mois, Marcos Sepúlveda, Humberto Proschle |
Street Address Correction Based on Spelling Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BNCOD ![In: Database: Enterprise, Skills and Innovation, 22nd British National Conference on Databases, BNCOD 22, Sunderland, UK, July 5-7, 2005, Proceedings, pp. 166-172, 2005, Springer, 3-540-26973-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Levenshtein, Geographical Information Systems, Text Retrieval, Text Processing, Spelling |
37 | Eric Sven Ristad, Peter N. Yianilos |
Learning String-Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(5), pp. 522-532, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
stochastic transduction, string correction, string classification, pronunciation modeling, Switchboard corpus, syntactic pattern recognition, Levenshtein distance, spelling correction, String-edit distance, string similarity |
35 | Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira, Ling Cheng 0001 |
Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 48(2), pp. 141-154, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
AMS Classifications 20B30, 20B35, 94A24, 94B50, 68P30, 94B60, 94A05 |
35 | Martin Simunek, Borivoj Melichar |
Approximate Periods with Levenshtein Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings, pp. 286-287, 2008, Springer, 978-3-540-70843-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Dimitrios P. Lyras, Kyriakos N. Sgarbas, Nikolaos D. Fakotakis |
Using the Levenshtein Edit Distance for Automatic Lemmatization: A Case Study for Modern Greek and English. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI (2) ![In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), October 29-31, 2007, Patras, Greece, Volume 2, pp. 428-435, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Sascha Schimke, Claus Vielhauer, Jana Dittmann |
Using Adapted Levenshtein Distance for On-Line Signature Authentication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (2) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 931-934, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Richard C. Wilson 0001, Edwin R. Hancock |
Levenshtein Distance for Graph Spectral Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (2) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 489-492, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Stefan Burkhardt, Juha Kärkkäinen |
One-Gapped q-Gram Filtersfor Levenshtein Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, pp. 225-234, 2002, Springer, 3-540-43862-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Johannes Siemons |
Error Graphs and the Reconstruction of Elements in Groups ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1110.5045, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Johannes Siemons |
Error graphs and the reconstruction of elements in groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 116(4), pp. 795-815, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey G. Molodtsov |
Reconstruction of a graph from 2-vicinities of its vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(9), pp. 1399-1406, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
A conjecture on the reconstruction of graphs from metric balls of their vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(5-6), pp. 993-998, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Conflict-avoiding codes and cyclic triple systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Probl. Inf. Transm. ![In: Probl. Inf. Transm. 43(3), pp. 199-212, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein |
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery ![In: Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006, 2006, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
34 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein |
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery ![In: Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006, 2006, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
34 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein (eds.) |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery ![Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006, pp. 2488-2490, 2006, IEEE, 1-4244-0504-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
A bound for codes with given minimum and maximum distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006, pp. 292-296, 2006, IEEE, 1-4244-0504-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey G. Molodtsov |
Reconstruction of a graph from 2-vicinities of its vertices, . ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 21, pp. 347-351, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
Error-correction capability of binary linear codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(4), pp. 1408-1423, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Vladimir D. Tonchev |
Optimal conflict-avoiding codes for three active users. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005, pp. 535-537, 2005, IEEE, 0-7803-9151-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 50(11), pp. 2818-2823, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
A system of polynomials for the complex hamming spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004, pp. 361, 2004, IEEE, 0-7803-8280-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 28(3), pp. 265-282, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
designs, orthogonal arrays, BCH codes |
34 | Toby Berger, Vladimir I. Levenshtein |
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 128(1), pp. 11-26, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
A universal bound for a covering in regular posets and its application to pool testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 266(1-3), pp. 293-309, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
A coset weight count that proves that the simplex codes are not optimal for error correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: Proceedings 2003 IEEE Information Theory Workshop, ITW 2003, La Sorbonne, Paris, France, 31 March - 4 April, 2003, pp. 234-237, 2003, IEEE, 0-7803-7799-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Toby Berger, Vladimir I. Levenshtein |
Asymptotic efficiency of two-stage disjunctive testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 48(7), pp. 1741-1749, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Toby Berger, Vladimir I. Levenshtein |
Application of cover-free codes and combinatorial designs to two-stage testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 6, pp. 518-527, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Efficient reconstruction of sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 47(1), pp. 2-22, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 93(2), pp. 310-332, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 45(1), pp. 284-288, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 197-198, pp. 515-536, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Philippe Delsarte, Vladimir I. Levenshtein |
Association Schemes and Coding Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 44(6), pp. 2477-2504, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
On designs in compact metric spaces and a universal bound on their size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 192(1-3), pp. 251-271, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 12(2), pp. 131-160, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
On the information function of an error-correcting code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 43(2), pp. 549-557, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 41(5), pp. 1303-1321, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus |
Bounds on the minimum support weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 41(2), pp. 432-440, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
34 | G. Fazekas, Vladimir I. Levenshtein |
On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 70(2), pp. 267-288, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
34 | Thomas H. E. Ericson, Vladimir I. Levenshtein |
Superimposed codes in the Hamming space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 40(6), pp. 1882-1893, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Packing and Decomposition Problems for Polynomial Association Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 14(5), pp. 461-477, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, A. J. Han Vinck |
Perfect (d, k)-codes capable of correcting single peak-shifts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 39(2), pp. 656-662, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings, pp. 25-42, 1993, Springer, 3-540-56686-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
On the Minimal Redundancy of Binary Error-Correcting Codes ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Control. ![In: Inf. Control. 28(4), pp. 268-291, August 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
29 | Mathew Magimai-Doss, Hervé Bourlard |
On the Adequacy of Baseform Pronunciations and Pronunciation Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLMI ![In: Machine Learning for Multimodal Interaction, First International Workshop,MLMI 2004, Martigny, Switzerland, June 21-23, 2004, Revised Selected Papers, pp. 209-222, 2004, Springer, 3-540-24509-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Veli Mäkinen, Gonzalo Navarro 0001, Esko Ukkonen |
Approximate Matching of Run-Length Compressed Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings, pp. 31-49, 2001, Springer, 3-540-42271-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Joan Climent, Juan Diego Blanco, Roberto A. Hexsel |
Approximate String Matching for Iris Recognition by Means of Boosted Gabor Wavelets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: SIBGRAPI 2010, Proceedings of the 23rd SIBGRAPI Conference on Graphics, Patterns and Images, Gramado, Brazil, August 30 2010-September 3, 2010, pp. 40-47, 2010, IEEE Computer Society, 978-1-4244-8420-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
biometrics, string matching, AdaBoost, iris recognition, Levenshtein distance |
22 | Alexander M. Bronstein, Michael M. Bronstein, Alfred M. Bruckstein, Ron Kimmel |
Partial Similarity of Objects, or How to Compare a Centaur to a Horse. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 84(2), pp. 163-183, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Partial similarity, Non-rigid shapes, Gromov-Hausdorff distance, Metric geometry, Deformation-invariant similarity, Multicriterion optimization, Edit distance, Pareto optimality, Correspondence, Shape similarity, Levenshtein distance |
22 | V. B. Sowmya, Vasudeva Varma |
Transliteration Based Text Input Methods for Telugu. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCPOL ![In: Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy, 22nd International Conference, ICCPOL 2009, Hong Kong, March 26-27, 2009. Proceedings, pp. 122-132, 2009, Springer, 978-3-642-00830-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Telugu, Text input methods, Levenshtein, edit-distance, Transliteration |
22 | Jaime Spacco, Chadd C. Williams |
Lightweight Techniques for Tracking Unique Program Statements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCAM ![In: Ninth IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2009, Edmonton, Alberta, Canada, September 20-21, 2009, pp. 99-108, 2009, IEEE Computer Society, 978-0-7695-3793-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
levenshtein, differencing tools, mining software archives, line-tracking, diff |
22 | Srinivasan C. Janarthanam, Sethuramalingam Subramaniam, Udhyakumar Nallasamy |
Named entity transliteration for cross-language information retrieval using compressed word format mapping algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM-iNEWS ![In: Proceeding of the 2nd ACM workshop on Improving Non English Web Searching, iNEWS 2008, Napa Valley, California, USA, October 30, 2008, pp. 33-38, 2008, ACM, 978-1-60558-416-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
compressed word format, modified Levenshtein distance, cross-language information retrieval, transliteration |
22 | Rafail Ostrovsky, Yuval Rabani |
Low distortion embeddings for edit distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(5), pp. 23, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Pattern matching, sketching, communication complexity, edit distance, dimension reduction, nearest neighbor search, metric embeddings, Levenshtein distance, computations on discrete structures |
22 | Juan Ramón Troncoso-Pastoriza, Stefan Katzenbeisser 0001, Mehmet Utku Celik |
Privacy preserving error resilient dna searching through oblivious automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007, pp. 519-528, 2007, ACM, 978-1-59593-703-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
dna sarch, bioinformatics, finite automata, secure multiparty computation, homomorphic encryption, levenshtein distance, approximate matching |
22 | Xiaoyi Jiang 0001, Karin Abegglen, Horst Bunke, János Csirik |
Dynamic computation of generalised median strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 6(3), pp. 185-193, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Median string, Median shape, Online algorithm, Levenshtein distance |
22 | Gonzalo Navarro 0001 |
A guided tour to approximate string matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 33(1), pp. 31-88, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
online string matching, text searching allowing errors, edit distance, Levenshtein distance |
22 | B. John Oommen, K. Zhang |
The Normalized String Editing Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 18(6), pp. 669-672, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
normalized string distances, Levenshtein Distance, string editing, Sequence processing |
22 | Enrique Vidal 0001, Andrés Marzal, Pablo Aibar |
Fast Computation of Normalized Edit Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 17(9), pp. 899-902, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
string correction, pattern recognition, speech recognition, optical character recognition, fast algorithms, editing, Levenshtein distance, fractional programming, spelling correction, Normalized edit distance |
20 | Ville Junnila, Tero Laihonen, Tuomo Lehtilä |
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 70(2), pp. 1050-1066, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Ruiyang Zhou |
Analysis of Levenshtein Transformer's Decoder and Its Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.12249, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Xiang Wei, Alan J. X. Guo, Sihan Sun, Mengyi Wei, Wei Yu |
Levenshtein Distance Embedding with Poisson Regression for DNA Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 15796-15804, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Gang Wang, Deng-Ming Xu, Fang-Wei Fu 0001 |
Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Math. Commun. ![In: Adv. Math. Commun. 17(6), pp. 1526-1541, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Jinqu Zhang, Lang Qian, Shu Wang, Yunqiang Zhu, Zhenji Gao, Hailong Yu, Weirong Li |
A Levenshtein distance-based method for word segmentation in corpus augmentation of geoscience texts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. GIS ![In: Ann. GIS 29(2), pp. 293-306, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Holly C. Lind-Combs, Tessa Bent, Rachael F. Holt, Cynthia G. Clopper, Emma Brown |
Comparing Levenshtein distance and dynamic time warping in predicting listeners' judgments of accent distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Speech Commun. ![In: Speech Commun. 155, pp. 102987, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | David Castells-Rufas |
GPU acceleration of Levenshtein distance computation between long strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Comput. ![In: Parallel Comput. 116, pp. 103019, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi |
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 69(4), pp. 2324-2340, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Alan J. X. Guo, Sihan Sun, Xiang Wei, Mengyi Wei, Xin Chen |
DoDo-Code: a Deep Levenshtein Distance Embedding-based Code for IDS Channel and DNA Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.12717, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Maxime Bouthors, Josep Maria Crego, François Yvon |
Towards Example-Based NMT with Multi-Levenshtein Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.08967, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Peter Coates, Frank Breitinger |
Identifying document similarity using a fast estimation of the Levenshtein Distance based on compression and signatures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11496, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Firas Ben Ramdhane, Pierre Guillon 0001 |
Dill maps in the Weyl-like space associated to the Levenshtein distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.09428, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Xiang Wei, Alan J. X. Guo, Sihan Sun, Mengyi Wei, Wei Yu |
Levenshtein Distance Embedding with Poisson Regression for DNA Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.07931, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Perrin E. Ruth, Manuel E. Lladser |
Levenshtein graphs: Resolvability, automorphisms & determining sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(5), pp. 113310, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ilya V. Vorobyev |
Covering Codes for the Fixed Length Levenshtein Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Probl. Inf. Transm. ![In: Probl. Inf. Transm. 59(2), pp. 86-98, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Rajesha N., Rejitha K. S., Narayan Kumar Choudhary |
Evaluation of Assamese Speech Data Transcriptions by Levenshtein Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
O-COCOSDA ![In: 26th Conference of the Oriental COCOSDA International Committee for the Co-ordination and Standardisation of Speech Databases and Assessment Techniques, O-COCOSDA 2023, Delhi, India, December 4-6, 2023, pp. 1-4, 2023, IEEE, 979-8-3503-4402-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Saki Namura, Sunichi Tada, Yingting Chen, Taro Kanno, Haruka Yoshida, Daisuke Karikawa, Kohei Nonose, Satoru Inoue |
Clarifying Patterns in Team Communication Through Extended Recurrence Plot with Levenshtein Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (45) ![In: HCI International 2023 Posters - 25th International Conference on Human-Computer Interaction, HCII 2023, Copenhagen, Denmark, July 23-28, 2023, Proceedings, Part III, pp. 118-123, 2023, Springer, 978-3-031-35997-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha |
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 58:1-58:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Toshihiro Kita, Kahori Ogashiwa, Noriko Asamoto |
Visualizing Differences in Spreadsheet Formulas Written by Information Literacy Learners Using Levenshtein Distance and Kernel PCA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIAI-AAI ![In: 14th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2023, Koriyama, Japan, July 8-13, 2023, pp. 764-765, 2023, IEEE, 979-8-3503-2422-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Kangjie Zheng, Longyue Wang, Zhihao Wang, Binqi Chen, Ming Zhang 0004, Zhaopeng Tu |
Towards a Unified Training for Levenshtein Transformer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: IEEE International Conference on Acoustics, Speech and Signal Processing ICASSP 2023, Rhodes Island, Greece, June 4-10, 2023, pp. 1-5, 2023, IEEE, 978-1-7281-6327-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ville Junnila, Tero Laihonen, Tuomo Lehtilä |
Levenshtein's Reconstruction Problem with Different Error Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, pp. 1300-1305, 2023, IEEE, 978-1-6654-7554-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Lang He, Min Ye 0005 |
The size of Levenshtein ball with radius 2: Expectation and concentration bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, pp. 850-855, 2023, IEEE, 978-1-6654-7554-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Maxime Bouthors, Josep Maria Crego, François Yvon |
Towards Example-Based NMT with Multi-Levenshtein Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMNLP ![In: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, EMNLP 2023, Singapore, December 6-10, 2023, pp. 1830-1846, 2023, Association for Computational Linguistics, 979-8-89176-060-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Md. Mahadi Hasan, David Dew Mallick, Towhid Khan, Md. Mustakin Alam, Md. Humaion Kabir Mehedi, Annajiat Alim Rasel |
SweetCoat-2D: Two-Dimensional Bangla Spelling Correction and Suggestion Using Levenshtein Edit Distance and String Matching Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: International Joint Conference on Neural Networks, IJCNN 2023, Gold Coast, Australia, June 18-23, 2023, pp. 1-8, 2023, IEEE, 978-1-6654-8867-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Robert Logan, Zoe Fleischmann, Sofia Annis, Amy Wangsness Wehe, Jonathan L. Tilly, Dori C. Woods, Konstantin Khrapko |
3GOLD: optimized Levenshtein distance for clustering third-generation sequencing data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMC Bioinform. ![In: BMC Bioinform. 23(1), pp. 95, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Zhangti Yan, Zhi Gu, Wei Guo, Jianpeng Wang |
A Construction of Codebooks Asymptotically Meeting the Levenshtein Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(11), pp. 1513-1516, November 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Youness Chaabi, Fadoua Ataa-Allah |
Amazigh spell checker using Damerau-Levenshtein algorithm and N-gram. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. King Saud Univ. Comput. Inf. Sci. ![In: J. King Saud Univ. Comput. Inf. Sci. 34(8 Part B), pp. 6116-6124, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha |
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.12496, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ville Junnila, Tero Laihonen, Tuomo Lehtilä |
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.08812, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Geyang Wang, Qi Wang 0012 |
On the size distribution of Levenshtein balls with radius one. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.02201, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ilya Gusev |
Russian Texts Detoxification with Levenshtein Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.13638, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | P. Prakash Maria Liju |
Algorithm to derive shortest edit script using Levenshtein distance algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.08823, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|