Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
160 | Klaus U. Schulz, Stoyan Mihov |
Fast string correction with Levenshtein automata. |
Int. J. Document Anal. Recognit. |
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. |
ICDAR |
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. |
AAECC |
1999 |
DBLP DOI BibTeX RDF |
|
59 | Peter G. Boyvalenkov, Ivan N. Landgev |
On Maximal Spherical Codes I. |
AAECC |
1995 |
DBLP DOI BibTeX RDF |
|
58 | Yujian Li, Bi Liu |
A Normalized Levenshtein Distance Metric. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
ECCV (4) |
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. |
ETRA |
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. |
ICCV |
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. |
ICDAR |
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. |
ACM Southeast Regional Conference (1) |
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. |
BNCOD |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
Des. Codes Cryptogr. |
2008 |
DBLP DOI BibTeX RDF |
AMS Classifications 20B30, 20B35, 94A24, 94B50, 68P30, 94B60, 94A05 |
35 | Martin Simunek, Borivoj Melichar |
Approximate Periods with Levenshtein Distance. |
CIAA |
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. |
ICTAI (2) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Sascha Schimke, Claus Vielhauer, Jana Dittmann |
Using Adapted Levenshtein Distance for On-Line Signature Authentication. |
ICPR (2) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Richard C. Wilson 0001, Edwin R. Hancock |
Levenshtein Distance for Graph Spectral Features. |
ICPR (2) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Stefan Burkhardt, Juha Kärkkäinen |
One-Gapped q-Gram Filtersfor Levenshtein Distance. |
CPM |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Johannes Siemons |
Error Graphs and the Reconstruction of Elements in Groups |
CoRR |
2011 |
DBLP BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Johannes Siemons |
Error graphs and the reconstruction of elements in groups. |
J. Comb. Theory, Ser. A |
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. |
Discret. Appl. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
A conjecture on the reconstruction of graphs from metric balls of their vertices. |
Discret. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Conflict-avoiding codes and cyclic triple systems. |
Probl. Inf. Transm. |
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. |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
2006 |
DBLP BibTeX RDF |
|
34 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein |
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
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 |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
2006 |
DBLP BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices. |
ISIT |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
A bound for codes with given minimum and maximum distances. |
ISIT |
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, . |
Electron. Notes Discret. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
Error-correction capability of binary linear codes. |
IEEE Trans. Inf. Theory |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, Vladimir D. Tonchev |
Optimal conflict-avoiding codes for three active users. |
ISIT |
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. |
IEEE Trans. Inf. Theory |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
A system of polynomials for the complex hamming spaces. |
ISIT |
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. |
Des. Codes Cryptogr. |
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. |
Discret. Appl. Math. |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
A universal bound for a covering in regular posets and its application to pool testing. |
Discret. Math. |
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. |
ITW |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Toby Berger, Vladimir I. Levenshtein |
Asymptotic efficiency of two-stage disjunctive testing. |
IEEE Trans. Inf. Theory |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Toby Berger, Vladimir I. Levenshtein |
Application of cover-free codes and combinatorial designs to two-stage testing. |
Electron. Notes Discret. Math. |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Efficient reconstruction of sequences. |
IEEE Trans. Inf. Theory |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. |
J. Comb. Theory, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. |
IEEE Trans. Inf. Theory |
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. |
Discret. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Philippe Delsarte, Vladimir I. Levenshtein |
Association Schemes and Coding Theory. |
IEEE Trans. Inf. Theory |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
On designs in compact metric spaces and a universal bound on their size. |
Discret. Math. |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. |
Des. Codes Cryptogr. |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein |
On the information function of an error-correcting code. |
IEEE Trans. Inf. Theory |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. |
IEEE Trans. Inf. Theory |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus |
Bounds on the minimum support weights. |
IEEE Trans. Inf. Theory |
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. |
J. Comb. Theory, Ser. A |
1995 |
DBLP BibTeX RDF |
|
34 | Thomas H. E. Ericson, Vladimir I. Levenshtein |
Superimposed codes in the Hamming space. |
IEEE Trans. Inf. Theory |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Packing and Decomposition Problems for Polynomial Association Schemes. |
Eur. J. Comb. |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein, A. J. Han Vinck |
Perfect (d, k)-codes capable of correcting single peak-shifts. |
IEEE Trans. Inf. Theory |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. |
AAECC |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Vladimir I. Levenshtein |
On the Minimal Redundancy of Binary Error-Correcting Codes |
Inf. Control. |
1975 |
DBLP DOI BibTeX RDF |
|
29 | Mathew Magimai-Doss, Hervé Bourlard |
On the Adequacy of Baseform Pronunciations and Pronunciation Variants. |
MLMI |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Veli Mäkinen, Gonzalo Navarro 0001, Esko Ukkonen |
Approximate Matching of Run-Length Compressed Strings. |
CPM |
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. |
SIBGRAPI |
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. |
Int. J. Comput. Vis. |
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. |
ICCPOL |
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. |
SCAM |
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. |
CIKM-iNEWS |
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. |
J. ACM |
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. |
CCS |
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. |
Pattern Anal. Appl. |
2003 |
DBLP DOI BibTeX RDF |
Median string, Median shape, Online algorithm, Levenshtein distance |
22 | Gonzalo Navarro 0001 |
A guided tour to approximate string matching. |
ACM Comput. Surv. |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
IEEE Trans. Inf. Theory |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Ruiyang Zhou |
Analysis of Levenshtein Transformer's Decoder and Its Variants. |
CoRR |
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. |
AAAI |
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. |
Adv. Math. Commun. |
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. |
Ann. GIS |
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. |
Speech Commun. |
2023 |
DBLP DOI BibTeX RDF |
|
20 | David Castells-Rufas |
GPU acceleration of Levenshtein distance computation between long strings. |
Parallel Comput. |
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. |
IEEE Trans. Inf. Theory |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Maxime Bouthors, Josep Maria Crego, François Yvon |
Towards Example-Based NMT with Multi-Levenshtein Transformers. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Firas Ben Ramdhane, Pierre Guillon 0001 |
Dill maps in the Weyl-like space associated to the Levenshtein distance. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Perrin E. Ruth, Manuel E. Lladser |
Levenshtein graphs: Resolvability, automorphisms & determining sets. |
Discret. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ilya V. Vorobyev |
Covering Codes for the Fixed Length Levenshtein Metric. |
Probl. Inf. Transm. |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Rajesha N., Rejitha K. S., Narayan Kumar Choudhary |
Evaluation of Assamese Speech Data Transcriptions by Levenshtein Distance. |
O-COCOSDA |
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. |
HCI (45) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha |
An Algorithmic Bridge Between Hamming and Levenshtein Distances. |
ITCS |
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. |
IIAI-AAI |
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. |
ICASSP |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Ville Junnila, Tero Laihonen, Tuomo Lehtilä |
Levenshtein's Reconstruction Problem with Different Error Patterns. |
ISIT |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Lang He, Min Ye 0005 |
The size of Levenshtein ball with radius 2: Expectation and concentration bound. |
ISIT |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Maxime Bouthors, Josep Maria Crego, François Yvon |
Towards Example-Based NMT with Multi-Levenshtein Transformers. |
EMNLP |
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. |
IJCNN |
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. |
BMC Bioinform. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Zhangti Yan, Zhi Gu, Wei Guo, Jianpeng Wang |
A Construction of Codebooks Asymptotically Meeting the Levenshtein Bound. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Youness Chaabi, Fadoua Ataa-Allah |
Amazigh spell checker using Damerau-Levenshtein algorithm and N-gram. |
J. King Saud Univ. Comput. Inf. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha |
An Algorithmic Bridge Between Hamming and Levenshtein Distances. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ville Junnila, Tero Laihonen, Tuomo Lehtilä |
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Geyang Wang, Qi Wang 0012 |
On the size distribution of Levenshtein balls with radius one. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Ilya Gusev |
Russian Texts Detoxification with Levenshtein Editing. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | P. Prakash Maria Liju |
Algorithm to derive shortest edit script using Levenshtein distance algorithm. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|