An Approach to Designing Very Fast Approximate String Matching Algorithms.

@article{DBLP:journals/tkde/DuC94,
  author    = {M. W. Du and
               S. C. Chang},
  title     = {An Approach to Designing Very Fast Approximate String Matching
               Algorithms},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {4},
  year      = {1994},
  pages     = {620-633},
  ee        = {db/journals/tkde/DuC94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX

[2]

Charles R. Blair: A Program for Correcting Spelling Errors. Information and Control 3(1): 60-67(1960) BibTeX

[3]

Charles P. Bourne: Frequency and impact of spelling errors in bibliographic data bases. Inf. Process. Manage. 13(1): 1-12(1977) BibTeX

[4]

...

[5]

...

[6]

...

[7]

...

[8]

M. W. Du, S. C. Chang: A Model and a Fast Algorithm for Multiple Errors Spelling Correction. Acta Inf. 29(3): 281-302(1992) BibTeX

[9]

...

[10]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[11]

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

[12]

Daniel S. Hirschberg: Algorithms for the Longest Common Subsequence Problem. J. ACM 24(4): 664-675(1977) BibTeX

[13]

John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, ISBN 0-201-02988-X
BibTeX

[14]

Ellis Horowitz, Sartaj Sahni: Fundamentals of Computer Algorithms. Computer Science Press 1978
BibTeX

[15]

James W. Hunt, Thomas G. Szymanski: A Fast Algorithm for Computing Longest Subsequences. Commun. ACM 20(5): 350-353(1977) BibTeX

[16]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[17]

Charles R. Litecky, Gordon B. Davis: A Study of Errors, Error-Proneness, and Error Diagnosis in Cobol. Commun. ACM 19(1): 33-37(1976) BibTeX

[18]

Roy Lowrance, Robert A. Wagner: An Extension of the String-to-String Correction Problem. J. ACM 22(2): 177-183(1975) BibTeX

[19]

William J. Masek, Mike Paterson: A Faster Algorithm Computing String Edit Distances. J. Comput. Syst. Sci. 20(1): 18-31(1980) BibTeX

[20]

...

[21]

...

[22]

...

[23]

...

[24]

James L. Peterson: Computer Programs for Detecting and Correcting Spelling Errors. Commun. ACM 23(12): 676-687(1980) BibTeX

[25]

Joseph J. Pollock, Antonio Zamora: Automatic Spelling Correction in Scientific and Scholary Text. Commun. ACM 27(4): 358-368(1984) BibTeX

[26]

...

[27]

Gerard Salton: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley 1989, ISBN 0-201-12227-8
BibTeX

[28]

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