540-547 Tries for Approximate String Matching H. Shang, T.h. Merrettal Abstract 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 k substitutions, transpositions, insertions or deletions, have hitherto been carried out only at costs linear in the size of the document. We present a trie-based method whose cost is independent of document size.
Trie indexes combine suffixes and so are compact in storage.
All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .