Approximate String Matching
- 1 December 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 12 (4) , 381-402
- https://doi.org/10.1145/356827.356830
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Ubiquitous B-TreeACM Computing Surveys, 1979
- A fast string searching algorithmCommunications of the ACM, 1977
- Frequency and impact of spelling errors in bibliographic data basesInformation Processing & Management, 1977
- Programmer selection and programming errorsThe Computer Journal, 1976
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975
- A Minimum Distance Error-Correcting Parser for Context-Free LanguagesSIAM Journal on Computing, 1972
- String similarity and misspellingsCommunications of the ACM, 1967
- A Study of Methods for Systematically Abbreviating English Words and NamesJournal of the ACM, 1961
- A program for correcting spelling errorsInformation and Control, 1960