String correction using the Damerau-Levenshtein distance
暂无分享,去创建一个
[1] Robert A. Wagner,et al. An Extension of the String-to-String Correction Problem , 1975, JACM.
[2] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.
[3] Yang Zhang,et al. Exploring Distributional Similarity Based Models for Query Spelling Correction , 2006, ACL.
[4] B. J. Oommen,et al. Pattern recognition of strings containing traditional and generalized transposition errors , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.
[5] Janusz M. Bujnicki,et al. The RNase H-like superfamily: new members, comparative structural analysis and evolutionary classification , 2014, Nucleic acids research.
[6] Heikki Hyyrö,et al. A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances , 2003, Nord. J. Comput..
[7] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[8] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[9] Christos Faloutsos,et al. On data mining, compression, and Kolmogorov complexity , 2007, Data Mining and Knowledge Discovery.
[10] M. Goresky,et al. An Introduction to Abstract Algebra , 2005 .
[11] Fred J. Damerau,et al. A technique for computer detection and correction of spelling errors , 1964, CACM.
[12] Eugene W. Myers,et al. Optimal alignments in linear space , 1988, Comput. Appl. Biosci..
[13] Brijesh Joshi,et al. Touching from a distance: website fingerprinting attacks and defenses , 2012, CCS.
[14] Matthew A. Jaro,et al. Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida , 1989 .
[15] C.,et al. A Fast Linear Space Algorithm for Computing Longest Common Subsequences , 2013 .
[16] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[17] Sartaj Sahni,et al. Cache and energy efficient alignment of very long sequences , 2015, 2015 IEEE 5th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS).
[18] Gregory V. Bard,et al. Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric , 2007, ACSW.
[19] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[20] Derek John Scott Robinson,et al. An Introduction to Abstract Algebra , 2003 .
[21] Eric Brill,et al. An Improved Error Model for Noisy Channel Spelling Correction , 2000, ACL.
[22] Christus,et al. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .