Indexing methods for approximate dictionary searching

DOI10.1145/1963190.1963191zbMath1284.68235OpenAlexW2054899689WikidataQ63347047 ScholiaQ63347047MaRDI QIDQ5406235

Leonid Boytsov

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1963190.1963191

zbMATH Keywords

triemetric treesLevenshtein distanceapproximate searchingAgrepDamerau-Levenshtein distancefrequency distancefrequency vector trieneighborhood generationNR-grep

Mathematics Subject Classification ID

Searching and sorting (68P10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pattern recognition, speech recognition (68T10) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (5)

Upper and Lower Bounds for Dynamic Data Structures on Strings ⋮ Simple, compact and robust approximate string dictionary ⋮ Fuzzy K-Minpen Clustering and K-nearest-minpen Classification Procedures Incorporating Generic Distance-Based Penalty Minimizers ⋮ Finding all stable matchings with couples ⋮ Index structures for fast similarity search for symbol strings

This page was built for publication: Indexing methods for approximate dictionary searching