Approximate string processing

DOI10.1561/1900000010MaRDI QIDQ3007988zbMATH OpenOpenAlexFDO

Authors Marios Hadjieleftheriou, Divesh Srivastava

Publication date 17 June 2011

Published in Foundations and Trends in Databases (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c3fb56311ad4a58288156cf0b19930d363a7fdb6

zbMATH Keywords

algorithms for edit based similarityfiltering techniquesindex structuresinverted indexesqueriesstring similaritystring tokenizationsurvey article

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Algorithms on strings (68W32)

Recommendations

• Data structures and algorithms for approximate string matching
• Index structures for fast similarity search for symbol strings
• Improved approximate string matching using compressed suffix data structures
• Algorithms and Computation
• Efficient processing of substring match queries with inverted variable-length gram indexes

Cited in

(2)

• Extending string similarity join to tolerant fuzzy token matching
• Efficient processing of substring match queries with inverted variable-length gram indexes

This page was built for publication: Approximate string processing

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