Tries for Approximate String Matching.

@article{DBLP:journals/tkde/ShangM96,
  author    = {Heping Shang and
               T. H. Merrett},
  title     = {Tries for Approximate String Matching},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {8},
  number    = {4},
  year      = {1996},
  pages     = {540-547},
  ee        = {db/journals/tkde/ShangM96.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

CDROM Edition

References

[1]

...

[2]

Ricardo A. Baeza-Yates: String Searching Algorithms. Information Retrieval: Data Structures & Algorithms 1992: 219-24 BibTeX

[3]

Ricardo A. Baeza-Yates, Gaston H. Gonnet: Efficient Text Searching of Regular Expressions (Extended Abstract). ICALP 1989: 46-62 BibTeX

[4]

Ricardo A. Baeza-Yates, Gaston H. Gonnet: A New Approach to Text Searching. Commun. ACM 35(10): 74-82(1992) BibTeX

[5]

Ricardo A. Baeza-Yates, Chris H. Perleberg: Fast and Practical Approximate String Matching. CPM 1992: 185-192 BibTeX

[6]

Robert S. Boyer, J. Strother Moore: A Fast String Searching Algorithm. Commun. ACM 20(10): 762-772(1977) BibTeX

[7]

William I. Chang, Eugene L. Lawler: Approximate String Matching in Sublinear Expected Time. FOCS 1990: 116-124 BibTeX

[8]

...

[9]

...

[10]

Gaston H. Gonnet, Ricardo A. Baeza-Yates, Tim Snider: New Indices for Text: Pat Trees and Pat Arrays. Information Retrieval: Data Structures & Algorithms 1992: 66-82 BibTeX

[11]

Patrick A. V. Hall, Geoff R. Dowling: Approximate String Matching. ACM Comput. Surv. 12(4): 381-402(1980) BibTeX

[12]

Jong Yong Kim, John Shawe-Taylor: An Approximate String-Matching Algorithm. Theor. Comput. Sci. 92(1): 107-117(1992) BibTeX

[13]

Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt: Fast Pattern Matching in Strings. SIAM J. Comput. 6(2): 323-350(1977) BibTeX

[14]

Karen Kukich: Techniques for Automatically Correcting Words in Text. ACM Comput. Surv. 24(4): 377-439(1992) BibTeX

[15]

...

[16]

Edward M. McCreight: A Space-Economical Suffix Tree Construction Algorithm. J. ACM 23(2): 262-272(1976) BibTeX

[17]

...

[18]

T. H. Merrett, Heping Shang: Trie Methods for Representing Text. FODO 1993: 130-145 BibTeX

[19]

Donald R. Morrison: PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric. J. ACM 15(4): 514-534(1968) BibTeX

[20]

...

[21]

Jack A. Orenstein: Multidimensional Tries Used for Associative Searching. Inf. Process. Lett. 14(4): 150-157(1982) BibTeX

[22]

Heping Shang: Trie Methods for Text and Spatial Data on Secondary Storage. Ph.D. thesis, McGill University 1994
BibTeX

[23]

...

[24]

Esko Ukkonen: Finding Approximate Patterns in Strings. J. Algorithms 6(1): 132-137(1985) BibTeX

[25]

...

[26]

Robert A. Wagner, Michael J. Fischer: The String-to-String Correction Problem. J. ACM 21(1): 168-173(1974) BibTeX

[27]

Peter Weiner: Linear Pattern Matching Algorithms. FOCS 1973: 1-11 BibTeX

[28]

Sun Wu, Udi Manber: Fast Text Searching Allowing Errors. Commun. ACM 35(10): 83-91(1992) BibTeX