scientific article; zbMATH DE number 975393

MaRDI QIDQ5284068zbMATH OpenFDO

Authors Lawrence V. Saxton, Nalin Wijesinghe

Publication date 9 March 1997

zbMATH Keywords

approximate binary searchapproximate string matching problemerror correctionsimilar stringsspelling correction

Mathematics Subject Classification ID

Searching and sorting (68P10) Dynamic programming (90C39) Applications of mathematical programming (90C90)

Recommendations

• Fast approximate matching of words against a dictionary
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Faster approximate string matching
• Fast and practical approximate string matching

Cited in

(16)

• An approximate string-matching algorithm
• Optimal spaced seeds for faster approximate string matching
• Fast string matching in stationary ergodic sources
• Efficient techniques for approximate record matching modulo permutations
• Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
• Fast approximate search in large dictionaries
• Generalized String Matching
• A fast VLSI solution for approximate string matching
• scientific article; zbMATH DE number 1949661 (Why is no real title available?)
• scientific article; zbMATH DE number 2149348 (Why is no real title available?)
• Approximate string matching by fuzzy automata
• A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching
• scientific article; zbMATH DE number 5684815 (Why is no real title available?)
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
• A model and a fast algorithm for multiple errors spelling correction
• A novel look-ahead optimization strategy for trie-based approximate string matching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284068)