
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
H. Shang, T.h. Merrettal, "Tries for Approximate String Matching," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 4, pp. 540547, August, 1996.  
BibTex  x  
@article{ 10.1109/69.536247, author = {H. Shang and T.h. Merrettal}, title = {Tries for Approximate String Matching}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {8}, number = {4}, issn = {10414347}, year = {1996}, pages = {540547}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.536247}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Tries for Approximate String Matching IS  4 SN  10414347 SP540 EP547 EPD  540547 A1  H. Shang, A1  T.h. Merrettal, PY  1996 KW  Approximate matching KW  text search KW  trie. VL  8 JA  IEEE Transactions on Knowledge and Data Engineering ER   
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
[1] A. Apostolico, "The Myriad Virtues of Suffix Trees," Combinatorial Algorithms on Words, pp. 8596, SpringerVerlag, 1985.
[2] R.A. BaezaYates, "String Searching Algorithms," Information Retrieval: Data Structures and Algorithms, W.B. Frakes and R.A. BaezaYates, eds., pp. 21940, PrenticeHall, 1992.
[3] R.A. BaezaYates and G.H. Gonnet, "Efficient Text Searching of Regular Expressions," Proc. 16th Int'l Colloquium on Automata, Languages and Programming, G. Ausiello, M. DezaniCiancaglini, and S.R.D. Rocca, eds., LNCS 372, pp. 4662.Stresa, Italy: SpringerVerlag, July 1989.
[4] R.A. BaezaYates and G.H. Gonnet, "A New Approach to Text Searching, Comm. ACM, vol. 35, no. 10, pp. 7482, 1992.
[5] R.A. BaezaYates and C.H. Perleberg, "Fast and Practical Approximate String Matching," Proc. Third Ann. Symp. Combinatorial Pattern Matching, G. Goos and J. Hartmanis, eds., LNCS 644, pp. 185192.Tucson, Ariz. SpringerVerlag, Apr. 1992.
[6] R.S. Boyer and J.S. Moore, “A Fast String Searching Algorithm,” Comm. ACM, vol. 20 pp. 762772, Oct. 1977.
[7] W.I. Chang and E.L. Lawler, "Approximate String Matching in SublinearExpected Time," Proc. 31st Ann. Symp. Foundations of Computer Science, pp. 11624.St. Louis, Mo. IEEE C. S. Press, Oct. 1990.
[8] F.J. Damerau, "A Technique for Computer Detection and Correction of Spelling Errors," Comm. ACM, vol. 7, no. 3, pp. 171176, 1964.
[9] G.H. Gonnet, "Efficient Searching of Text and Pictures," Technical Report OED8802, Centre for the New OED., Univ. of Waterloo, 1988.
[10] G.H. Gonnet, R.A. BaezaYates, and T. Snider, "New Indices for Text: PAT Trees and PAT Arrays," W.B. Frakes and R.A. BaezaYates, eds., Information Retrieval: Data Structures and Algorithms, pp. 6682. PrenticeHall, 1992.
[11] P.A.V. Hall and G.R. Dowling, "Approximate String Matching," Computing Surveys, vol. 12, no. 4, pp. 381402, 1980.
[12] J.Y. Kim and J. ShaweTaylor, "An Approximate StringMatching Algorithm," Theoretical Computer Science, vol. 92, pp. 107117, 1992.
[13] D.E. Knuth, J.H. Morris, and V.R. Pratt, "Fast Pattern Matching in Strings," Computer J., vol. 6, no. 2, pp. 32350, 1977.
[14] K. Kukich, “Techniques for Automatically Correcting Words in Text,” ACM Computing Surveys, vol. 24, no. 4, pp. 377439, 1992.
[15] V. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions and Reversals," Soviet Physics Dokl., vol. 6, pp. 12636, 1966.
[16] E.M. McCreight, "A Space Economical Suffix Tree Construction Algorithm," J. ACM, vol. 23, no. 2, pp. 26272, 1976.
[17] T.H. Merrett, Relational Information Systems.Reston, Va: Reston Publishing Co., 1983.
[18] T.H. Merrett and H. Shang, "Trie Methods for Representing Text," Proc. Fourth Int'l Conf., FODO'93, LNCS 730, pp. 13045,Chicago: SpringerVerlag, Oct. 1993.
[19] D.R. Morrison, "PATRICIAPractical Algorithm To Retrieve Information Coded In Alphanumeric," J. ACM, vol. 15, no. 4, pp. 51434, 1968.
[20] M.K. Odell and R.C. Russell, U.S. Patent Numbers, 1,261,167 (1918) and 1,435,663, 1922. U.S. Patent Office, Washington, D.C.
[21] J.A. Orenstein, "Multidimensional Tries Used for Associative Searching," Information Processing Letters, vol. 14, no. 4, pp. 150156, 1982.
[22] H. Shang, "Trie Methods for Text and Spatial Data on Secondary Storage," PhD Dissertation, School of Computer Science, McGill Univ., Nov. 1994.
[23] G.A. Stephen, String Searching Algorithms, Lecture Notes on Computing, World Scientific Pub., 1994.
[24] E. Ukkonen, "Finding Approximate Patterns in Strings," J. Algorithms, vol. 6, pp. pp. 1327, 1985.
[25] J. Veronis, "Computerized Correction of Phonographic Errors," Comput. Hum., vol. 22, pp. 4356, 1988.
[26] R.A. Wagner and M.J. Fischer, "The StringtoString Correction Problem," J. ACM, vol. 21, no. 1, pp. 16878, 1974.
[27] P. Weiner, "Linear Pattern Matching Algorithms," Proc. IEEE Symp. Switching and Automata Theory, pp. 111, 1973.
[28] S. Wu and U. Manber, "Fast Text Searching," Comm. ACM, vol. 35, pp. 8391, 1992.