Find link

language:

Find link is a tool written by Edward Betts.

searching for String-to-string correction problem 5 found (12 total)

alternate case: string-to-string correction problem

Michael J. Fischer (1,043 words) [view diff] exact match in snippet view article find links to article

S2CID 9034016.. Wagner, Robert A.; Fischer, Michael J. (1974). "The string-to-string correction problem". Journal of the ACM. 21 (1): 168–173. doi:10.1145/321796

Approximate string matching (1,910 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-387-94860-7. Wagner, R.; Fischer, M. (1974). "The string-to-string correction problem". Journal of the ACM. 21: 168–73. doi:10.1145/321796.321811

Damerau–Levenshtein distance (2,192 words) [view diff] case mismatch in snippet view article find links to article

Roy; Wagner, Robert A. (April 1975), "An Extension of the String-to-String Correction Problem", J ACM, 22 (2): 177–183, doi:10.1145/321879.321880, S2CID 18892193

Needleman–Wunsch algorithm (3,217 words) [view diff] exact match in snippet view article find links to article

1007/BF01074755. S2CID 123081024. Wagner RA, Fischer MJ (1974). "The string-to-string correction problem". Journal of the ACM. 21 (1): 168–173. doi:10.1145/321796

Longest common subsequence (4,355 words) [view diff] exact match in snippet view article find links to article

S2CID 16120634. Wagner, Robert; Fischer, Michael (January 1974). "The string-to-string correction problem". Journal of the ACM. 21 (1): 168–173. CiteSeerX 10.1.1.367