This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Error-Tolerant Retrieval of Trees
December 1997 (vol. 19 no. 12)
pp. 1376-1380

Abstract—We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. For large randomly generated synthetic tree databases (some having tens of thousands of trees), and on databases constructed from Wall Street Journal treebank, it can retrieve for trees with a small error, in a matter of tenths of a second to about a second.

[1] M.W. Du and S.C. Chang, "A Model and a Fast Algorithm for Multiple Errors Spelling Correction," Acta Informatica, vol. 29, pp. 281-302, 1992.
[2] H. Maruyama and H. Watanabe, "Tree Cover Search Algorithm for Example-Based Translation," Proc. Fourth Int'l Conf. Theoretical and Methodologies Issues in Machine Translation, pp. 173-184, 1992.
[3] E.W. Myers and W. Miller, "Approximate Matching of Regular Expressions," Bulletin of Mathematical Biology, vol. 51, no. 1, pp. 5-37, 1989.
[4] S. Nirenburg, S. Beale, and C. Domashnev, "A Full-Text Experiment in Example-Based Translation," Proc. Int'l Conf. New Methods in Language Processing,Manchester, UK, pp. 78-87, 1994.
[5] K. Oflazer, "Error-Tolerant Finite-State Recognition With Applications to Morphological Analysis and Spelling Correction," Computational Linguistics, vol. 22, no. 1, pp. 73-89, 1996.
[6] S. Sato and M. Nagao, "Towards Memory-Based Translation," Proc. 13th Int'l Conf. Computational Linguistics, vol. 3, pp. 247-252, 1990.
[7] S.M. Selkow, "The Tree-to-Tree Editing Problem," Information Processing Letters, vol. 6, no. 6, pp. 184-186, 1977.
[8] K.C. Tai, "The Tree-to-Tree Correction Problem," J. ACM, vol. 26, no. 3, pp. 422-433, 1979.
[9] T. Utsuro, K. Uchimoto, M. Matsumoto, and M. Nagao, "Thesaurus-Based Efficient Example Retrieval by Generating Retrieval Queries From Similarities," Proc. 15th Int'l Conf. Computational Linguistics, vol. 2, pp. 1,044-1,048, 1994.
[10] J.T.L. Wang, K. Zhang, K. Jeong, and D. Shasha, “A System for Approximate Tree Matching,” IEEE Trans. Knowledge and Data Eng., vol. 6, no. 4, pp. 559-571, Aug. 1994.
[11] S. Wu and U. Manber, "Fast Text Searching With Errors," Technical Report TR91-11, Dept. of Computer Science, Univ. of Arizona, 1991.

Index Terms:
Example-based machine translation, approximate tree comparison, retrieval from lexical databases, tree databases.
Citation:
Kemal Oflazer, "Error-Tolerant Retrieval of Trees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 12, pp. 1376-1380, Dec. 1997, doi:10.1109/34.643897
Usage of this product signifies your acceptance of the Terms of Use.