R. Wagner and M. Fischer, "The string to string correction problem," Journal of the Association for Computing Machinery, vol. 21, no. 1, 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Using Morphology and Phoneme History - To Improve Grapheme-To-Phoneme (Correct)
No context found.
R. Wagner and M. Fischer, "The string to string correction problem," Journal of the Association for Computing Machinery, vol. 21, no. 1, 1974.
Spelling-Error Tolerant, Order-Independent.. - Damerau-Levenshtein.. (Correct)
No context found.
Wagner, R. & Fisher, M. (1974), `The string-to-string correction problem', Journal of the Association for Computing Machinery .
Style-Independent Document Labeling: - Design And Performance (Correct)
No context found.
R.A. Wagner and M.J. Fisher, The String-to-String Correction Problem, Journal of ACM, 21, 1974, 168-178.
Optimizing Reduced-Space Sequence Analysis - Wheeler, Hughey (2000) (Correct)
No context found.
Wagner, R. A. & Fischer, M. J. (1974). The string-to-string correction problem. Journal of the ACM, 21 (1), 168{ 173.
Differencing and Merging of Architectural Views - Abi-Antoun, Aldrich, Nahas.. (2006) (Correct)
No context found.
Wagner, R.A. and Fischer, M.J. The string to string correction problem. Journal of the ACM, 21:168--173, 1974.
Using Clustering Strategies for Creating Authority Files - James French Allison (2000) (Correct)
No context found.
Wagner, R. A. and Fischer, M. J. (Jan. 1974). The String-to-String Correction Problem. Journal of the ACM, 21(1):168--173.
Robust Identification of Time-Scaled Audio - Bardeli, Kurth (2004) (Correct)
No context found.
Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168--173, January 1974.
A New Practical Linear Space Algorithm for the Longest Common .. - Goeman, Clausen (Correct)
No context found.
Wagner, R.A., Fischer, M.J.: The string--to--string correction problem. J. ACM 21(1), 1974, 168--173.
Recognizing Textual Parallelisms with edit distance and.. - Marie Gu Egan (2006) (Correct)
No context found.
R.A. Wagner and M.J. Fischer. 1974. The String-toString Correction Problem. Journal of the ACM, 21(1):168--173.
Hardness results for the center and median string problems.. - Nicolas, Rivals (2005) (Correct)
No context found.
R.A. Wagner, M.J. Fischer, The string-to-string correction problem, J. ACM 21 (1) (1974) 168--173.
Faster Algorithms for Computing Longest Common.. - Brodal, Kaligosi.. (2005) (Correct)
No context found.
Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168--173, 1974.
Decomposition Algorithms for the Tree Edit - Distance Problem Serge (Correct)
No context found.
R.A. Wagner and M.J. Fischer. The String-to-String Correction Problem. Journal of the Association for Computing Machinery Vol 21-1 (1974), p. 168 - 173
Approximate Subtree Identification in Heterogeneous.. - Sanz, Mesiti.. (Correct)
No context found.
Wagner, R.A., Fischer, M.J.: The String-to-string Correction Problem. Journal of the ACM 21 (1974) 168--173
Proceedings of the 9th Conference on Computational Natural.. - Pages Ann Arbor (Correct)
No context found.
Robert A. Wagner and Michael J. Fischer. 1974. The string-to-string correction problem. Journal of the ACM, 21(1):168--173.
Practical Methods for Approximate String Matching - Hyyrö (Correct)
No context found.
R. Wagner and M. Fisher. The string to string correction problem. J. of the ACM, 21:168--178, 1974.
Extraction and Recognition of Artificial Text in Multimedia.. - Wolf, Jolion (2002) (Correct)
No context found.
R.A. Wagner and M.J.Fisher. The string to string correction problem. Journal of Assoc. Comp. Mach., 21(1):168-- 173, 1974.
Cellular Associative Neural Networks for Pattern Recognition - Orovas (1999) (Correct)
No context found.
R.A Wagner and M.J. Fischer. The string to string correction problem. Journal of the ACM, 21:168--173, 1974.
Style-Independent Document Labeling: - Design And Performance (2004) (Correct)
No context found.
R.A. Wagner and M.J. Fisher, The String-to-String Correction Problem, Journal of ACM, 21, 1974, 168-178.
Unknown - Greedy Algorithm For (1997) (Correct)
No context found.
R. Wagner and M. Fisher: "The string-to-string Correction Problem" Journal of the ACM. Vol.21, pp. 168-178 (1974).
Bit-Parallel LCS-length Computation Revisited - Hyyrö (Correct)
No context found.
R. Wagner and M. Fisher. The string to string correction problem. J. of the ACM, 21:168--178, 1974.
Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2004) (Correct)
No context found.
R. Wagner and M. Fisher. The string-to-string correction problem. J. of the ACM 21(1):168173, 1974.
A comparative study for XML change detection - Cobéna, Abdessalem.. (2002) (Correct)
No context found.
WAGNER R., FISCHER M., "The string-to-string correction problem", Jour. ACM 21, , 1974, p. 168-173.
Efficient Similarity Search for Hierarchical Data in .. - Kailing, Kriegel.. (2004) (Correct)
No context found.
Wagner, R.A., Fisher, M.J.: The string-to-string correction problem. Journal of the ACM 21 (1974) 168--173
Using Natural Language Input and Audio Analysis for a.. - Baumann, Klüter, Norlien (2002) (1 citation) (Correct)
No context found.
Wagner, R. A., Fischer M. J., The string-to-string correction problem, J ACM 21, p.168-173, 1974
Hashing Schemes for Comparing and - Synchronizing Distributed And (2003) (Correct)
No context found.
R. A. Wanger and M. J. Fischer. The string-to-string correction problem, Journal of ACM, 21, 1, 168-173, 1974.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC