A Practical Index for Approximate Dictionary Matching with Few Mismatches

@article{Cislak2017API,
  title={A Practical Index for Approximate Dictionary Matching with Few Mismatches},
  author={Aleksander Cislak and Szymon Grabowski},
  journal={Comput. Informatics},
  year={2017},
  volume={36},
  pages={1088-1106}
}
  • Aleksander Cislak, Szymon Grabowski
  • Published in Comput. Informatics 2017
  • Computer Science, Mathematics
  • Approximate dictionary matching is a classic string matching problem, with applications in, e.g., online catalogs, geolocation (mapping possibly misspelled location description to geocoordinates), web searchers, etc. We present a surprisingly simple solution, based on the Dirichlet principle, for matching a keyword with few mismatches and experimentally show that it offers competitive space-time tradeoffs. Our implementation in the C++ language is focused mostly on data compaction, which is… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    2
    Twitter Mentions

    Citations

    Publications citing this paper.