Computational Mathematics and Modeling

, Volume 13, Issue 3, pp 314–326

Using Signature Hashing for Approximate String Matching

  • L. M. Boitsov
Article

DOI: 10.1023/A:1016014301288

Cite this article as:
Boitsov, L.M. Computational Mathematics and Modeling (2002) 13: 314. doi:10.1023/A:1016014301288
  • 84 Downloads

Abstract

The objective is to demonstrate the expediency of using compressed inverted files with a signature-hashing dictionary for approximate string matching. A comparison of different types of dictionaries is performed and a method based on keyword signature hashing is described. In conclusion, we report the comparative characteristics (search speed, index size, indexing speed) for our search system using compressed inverted files with keyword signature hashing and the Glimpse search freeware.

Copyright information

© Plenum Publishing Corporation 2002

Authors and Affiliations

  • L. M. Boitsov

There are no affiliations available

Personalised recommendations