SIGN IN
SIGN UP
A guided tour to approximate string matching
Full Text:
PDF
Buy this Article
Author:
Gonzalo Navarro
Univ. of Chile, Santiago, Chile
Published in:
· Journal
ACM Computing Surveys (CSUR)
Surveys Homepage
archive
Volume 33 Issue 1, March 2001
Pages 31-88
ACM
New York, NY
, USA
table of contents
doi>
10.1145/375360.375365
2001 Article
Bibliometrics
· Downloads (6 Weeks): 59
· Downloads (12 Months): 819
· Downloads (cumulative): 12,125
· Citation Count: 330
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
edit distance
levenshtein distance
online string matching
search process
text searching allowing errors
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder