Tries for approximate string matching
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 8 (4) , 540-547
- https://doi.org/10.1109/69.536247
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Trie methods for representing textPublished by Springer Nature ,1993
- Techniques for automatically correcting words in textACM Computing Surveys, 1992
- A new approach to text searchingCommunications of the ACM, 1992
- An approximate string-matching algorithmTheoretical Computer Science, 1992
- Efficient text searching of regular expressionsPublished by Springer Nature ,1989
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- Approximate String MatchingACM Computing Surveys, 1980
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- PATRICIA—Practical Algorithm To Retrieve Information Coded in AlphanumericJournal of the ACM, 1968