Kuo-Chung Tai
- 1 AHO, A V, HIRSCHBERG, D S, ASD ULLbIAN, J D Bounds on the complexity of the longest common subsequence problem J A CM 23, 1 (Jan 1976), 1-12 Google Scholar
- 2 Fu, K S, AND BHARGAVA, B K Tree systems for syntactic pattern recogmtlon IEEE Trans Comptrs C-22, 12 (Dec 1973), 1087-1099Google Scholar
- 3 HmSCHBERG, D S A hnear space algorithm for computing maxzmal common subsequences Comm A CM 18, 6 (June 1975), 341-343 Google Scholar
- 4 HIRSCHBERG, D S Algorithms for the longest common subsequence problem J A CM 24, 4 (Oct 1977), 664-675 Google Scholar
- 5 HUNT, J W, AriD SZVMANSKI, T G A fast algorithm for computing longest common subsequences Comm ACM 20, 5 (May 1977), 350-353 Google Scholar
- 6 KNUTH, D E The Art of Computer Programming, Vol I Fundamental Algor~thms Addison-Wesley, Reading, Mass, sec ed, 1973 Google Scholar
- 7 LOWRANCE, R, AND WAGNER, R A An extension of the strmg-to-strlng correction problem J A CM 22, 2 (Aprd 1975), 177-183 Google Scholar
- 8 SANKO~F, D Matching sequences under deletlonAnsertlon constraints Proc Nat Aead Scl USA 69, 1 (Jan 1974), 4-6Google Scholar
- 9 SELKOW, S M The tree-to-tree editing problem inform Processing Letters 6, 6 (Dec 1977), 184-186Google Scholar
- 10 SELLERS, P H An algorithm for the d~stance between two fimte sequences J Combm Theory, Set A, 16 (1974), 253-258Google Scholar
- 11 TAI, K C Syntacuc error correction m programming languages Ph D Th, Dept Comptr. Sci, Cornell U, Ithaca, N Y, 1977 Google Scholar
- 12 WAGNER, R A On the complexity of the extended strmg-to-stnng correction problem Proc Seventh Annual ACM Symp on Theory of Comptng, Albuquerque, New Mex, 1975, pp 218-223 Google Scholar
- 13 WAGNER, R A, AND FISCHER, M J The stnng-to-strmg correction problem. J ,4CM 21, I (Jan 1974), 168- 173 Google Scholar
- 14 WONG, C K, AND CHANDRA, A K Bounds for the string editing problem Z ACM 23, 1 (Jan 1976), 13-16 Google Scholar
Index Terms
- The Tree-to-Tree Correction Problem
Recommendations
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Phrase dependency machine translation with quasi-synchronous tree-to-tree features
Recent research has shown clear improvement in translation quality by exploiting linguistic syntax for either the source or target language. However, when using syntax for both languages "tree-to-tree" translation, there is evidence that syntactic ...
Comments