Very fast and simple approximate string matching

DOI10.1016/S0020-0190(99)00121-0zbMath1338.68305WikidataQ126772463 ScholiaQ126772463MaRDI QIDQ294703

Gonzalo Navarro, Ricardo A. Baeza-Yates

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099001210?np=y

zbMATH Keywords

information retrievalapproximate matchingtext searching

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (7)

New and faster filters for multiple approximate string matching ⋮ Approximate string matching with compressed indexes ⋮ A new filtration method and a hybrid strategy for approximate string matching ⋮ Fast Approximate Search in Large Dictionaries ⋮ An artificial neural network based approach for online string matching/filtering of large databases ⋮ NR‐grep: a fast and flexible pattern‐matching tool ⋮ Creating improvisations on chord progressions using suffix trees

Uses Software

• Agrep

Cites Work

• Faster approximate string matching
• Fast and practical approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition
• Improving an algorithm for approximate pattern matching

This page was built for publication: Very fast and simple approximate string matching