Tries for Approximate String Matching

@article{Shang1996TriesFA,
  title={Tries for Approximate String Matching},
  author={Heping Shang and T. H. Merrett},
  journal={IEEE Trans. Knowl. Data Eng.},
  year={1996},
  volume={8},
  pages={540-547}
}
Tries offer text searches with costs which are independent of the size of the document being searched, and so are important for large documents requiring spelling checkers, case insensitivity, and limited approximate regular secondary storage. Approximate searches, in which the search pattern differs from the document by ksubstitutions, transpositions, insertions or deletions, have hitherto been carried out only at costs linear in the size of the document We present a trie-based mbthod whose… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS
33 Citations
16 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

55 Citations

0510'96'01'07'13
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…