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 Edit Distance in Point-Pattern Matching - Mäkinen (Correct)
....edit distance is used to measure how close two strings are. Formally, let be a vocabulary containing characters, and define strings A; B 2 . The edit distance between A and B is the minimum amount of character insertions, deletions, and substitutions that are needed to convert A to B [14]. The above definition can be applied to point pattern matching considering discrete point patterns, i.e. 0; 1 and P 2 , P = p 1 p 2 : pn , where p i = 1 denotes a point in location i 2 [1 : n] However, a straightforward adaptation of edit distance for point patterns does not ....
R. Wagner and M. Fisher. The string-to-string correction problem. J. Assoc. Comput. Mach. 21, pp. 168178, 1974.
A Distance Measure for Video Sequences - Adjeroh, Lee, King (1999) (1 citation) (Correct)
....is used as the query string or the database string. On the other hand, the requirement for triangular inequality is often not met in most multimedia retrieval environments. The edit distance between A : a 1 a 2 and B : b 1 b 2 m is usually determined by use of some recurrence relations [26, 31]: initializations: D 0,0 0, D i,0 1,0 # del (a i ) # ins (b j ) main recurrence: min # # # # del (a i ) deletion) # subs (a i , b j ) substitution) # ins (b ) insertion) where 1 # A =n;1#j# B =m;# del ,# ins , and # subs are the respective cost of ....
A. Wagner and M. J. Fischer, The string-to-string correction problem, J. Assoc. Comput. Mach. 21, 1974, 168--173.
Edit-Distance of Weighted Automata - Mohri (2002) (1 citation) (Correct)
....as computational biology to give a measure of the di erence or similarity between two strings. There exists a classical dynamic programming algorithm for computing the edit distance of two strings x 1 and x 2 in time O(jx 1 jjx 2 j) where jx i j, i = 1; 2, denotes the length of the string x i [32]. The algorithm is a special instance of a single source shortest paths algorithm applied to a directed graph expanded dynamically. Ukkonen improved that algorithm by reducing the size of the directed graph that needs to be expanded [31] The complexity of his algorithm is O(dmax fjx 1 j; jx 2 ....
Robert A. Wagner and Michael J. Fisher. The string to string correction problem. Journal of the Association for Computing Machinery (ACM), 21(1):168-173, 1974.
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.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the ACM (JACM), 21:168--173, 1974.
Similarity Search in Structured Data - Kriegel, Schönauer (2003) (Correct)
No context found.
Wagner, R.A., Fisher, M.J.: The string-to-string correction problem. Journal of the ACM 21 (1974) 168--173
An O(ND) Difference Algorithm and Its Variations - Myers (1986) (12 citations) (Correct)
No context found.
Wagner, R.A. and Fischer, M.J. "The String-to-String Correction Problem." Journal of ACM 21, 1 (1974), 168-173. - 15 -
Use of Lexicon Density in Evaluating Word Recognizers - Venu Govindaraju Petr (2000) (Correct)
No context found.
R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168--173, Jan. 1974.
Ink-Link - El-Nasan, Nagy (2000) (Correct)
No context found.
Wagner R., Fischer M., "The String-to-String Correction Problem", J. ACM, 21(1), 1974, pp. 168-173.
An Edit Distance Between Quotiented Trees - Pascal Ferraro Christophe (2003) (1 citation) (Correct)
No context found.
R. A. Wagner and M. J. Fisher, The string-to-string correction problem, Journal of the association for computing machinery, vol. 21, pp. 168173, 1974.
A Student Model of Technical Japanese Reading Proficiency - For An Intelligent (Correct)
No context found.
R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," J. ACM, vol. 21, pp. 168--173, 1974.
A Similarity-Based Approach And Evaluation Methodology For.. - Kondrak, Dorr (2003) (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, 1974.
Detecting Changes in XML Documents - Cobena, Abiteboul, Marian (2001) (33 citations) (Correct)
No context found.
W. R. A. and M. J. Fischer. The string-to-string correction problem. Jour. ACM 21, pages 168--173, 1974.
Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (Correct)
No context found.
R. Wagner and M. Fisher. The string-to-string correction problem. J. of the ACM 21(1):168173, 1974.
A Symbolic Approach to Music Recognition - Nico Jacobs Filip (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.
Secure and Private Sequence Comparisons - Atallah, Kerschbaum, Du (2003) (Correct)
No context found.
R. A. Wagner and M. J. Fischer. The String to String Correction Problem, Journal of the ACM 21,1, pp.168--173 (1974).
Combining Evidence in Cognate Identification - Kondrak (2004) (1 citation) (Correct)
No context found.
Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168-173, 1974.
A Scalable and Efficient Systolic Algorithm for the Longest.. - Lin, Yeh (2002) (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,
Intrusion Detection: A Bioinformatics Approach - Coull, Branch, Szymanski.. (2003) (Correct)
No context found.
Wagner, R. A. and Fisher, M. J. The string-to-string correction problem. Journal of the ACM, 21:168-173, 1974.
Approximate String-Matching over Suffix Trees - Ukkonen (1993) (20 citations) (Correct)
No context found.
Wagner, R. A. & Fischer, M. J. (1974): The string-to-string correction problem. J. ACM 21, 168-173.
Edit-Distance of Weighted Automata - Mohri (2002) (1 citation) (Correct)
No context found.
Robert A. Wagner and Michael J. Fisher. The string to string correction problem. Journal of the Association for Computing Machinery (ACM), 21(1):168-173, 1974.
Algorithms for Transposition Invariant String Matching.. - Mäkinen, Navarro.. (2003) (Correct)
No context found.
R. Wagner and M. Fisher. The string-to-string correction problem. J. of the ACM 21(1):168173, 1974.
Triage of OCR Results Using `Confidence' Scores - Sarkar, Baird, Henderson (Correct)
No context found.
R. A. Wagner and M. J. Fischer, \The string to string correction problem," Journal of the Association of Computing Machinery 21, pp. 168-178, 1974.
Algorithms for Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2002) (Correct)
No context found.
R. Wagner and M. Fisher. The string-to-string correction problem. J. of the ACM 21(1):168173, 1974.
Pattern Matching and Text Compression Algorithms - Crochemore, Lecroq (2003) (3 citations) (Correct)
No context found.
Wagner, R. A. and Fischer, M. 1974. The string-to-string correction problem. J. ACM 21(1):168{ 173.
Coupling Hundreds of Workstations for Parallel Molecular.. - Strumpen (1995) (10 citations) (Correct)
No context found.
R. A. Wagner and M. J. Fischer, `The string to string correction problem', Journal of the ACM, 21, (2), 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