An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree

Abstract

To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence, a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching. In this algorithm, the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences. These kinds of metaphor sentences are saved in the pattern library in advance. The main process of this algorithm is up-down searching and bottom-up backtracking revising. The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library. Finally, the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library. Hence, accurate dependency relationships can be achieved through this algorithm.

Keywords

pattern recognition / tree matching algorithm / dependency tree / rule matching / metaphor information processing

References

[1] YangZ.-k., LiuG.-r., HeJ.-hua.. New code match strategy for wideband code division multiple access code tree management [J]. Journal of Central South University of Technology, 2006, 13(3): 265-269

[2] TongX.-h., WuS.-c., WuS.-q., LiuD.-jie.. A novel vehicle navigation map matching algorithm based on fuzzy logic and its application [J]. Journal of Central South University of Technology, 2005, 12(2): 214-219

[3] PekkaK.Tree matching problems with applications to structured text databases [D], 1992, Helsinki, Department of Computer Science, University of Helsinki

[4] PascalF., ChristopheG.. An edit distance between quotiented trees [J]. Algorithmic, 2003, 36(1): 1-39

[5] WilliamB. F., ThomasP. P.. An empirical study of representation methods for reusable software components [J]. IEEE Transactions on Software Engineering, 1994, 20(8): 617-630

[6] TorstenS.ApproXQL: Design and implementation of an approximate pattern matching language for XML [R], 2001, Berlin, Freie Universität Berlin

[7] SchliederT., BerlinF. U., NaumannF.. Approximate tree embedding for querying XML data [C]. Proceedings of ACM SIGIR Workshop on XML and Information Retrieval, 2000, Athens, The Research Publication Repository of KFUPM

[8] ThorstenR.A new measure of the distance between ordered trees and its applications [R], 1997, Bonn, Department of Computer Science, University of Bonn

[9] DennisS., JasonT. L. W., ShanH. Y., ZhangK. Z.. ATreeGrep: Approximate search in unordered tree [C]. Proceedings of the 14th International Conference on Scientific and Statistical Database Management, 2002, Edinburgh, IEEE Computer Society: 89-98

[10] DennisS., JasonT. L. W., ZhangK. Z., FrankY. S.. Exact and approximate algorithm for unordered tree matching [J]. IEEE Transactions On Systems, Man and Cybernetics, 1994, 24(4): 668-678

[11] ZhangK. Z., RickS., DennisS.. On the editing distance between unordered labeled trees [J]. Information Processing Letters, 1992, 42(3): 133-139

[12] GabrielG. I. L., MaartenD. R., KhalilS.. A general probabilistic model for dependency parsing [C]. Proceedings of the 14th Dutch-Belgian Artificial Intelligence Conference, 2002, Leuven, Leuven University Press: 139-146

[13] AlexisN., OwenR.. A simple string-rewriting formalism for dependency grammar [C]. Workshop on Recent Advances in Dependency Grammar, International Conference on Computational Linguistics, 2004, Geneva, Switzerland, COLING: 25-32

[14] XiongD. Y., LiS. L., LiuQ., LinS. X., QianY. L.. Parsing the Penn Chinese treebank with semantic knowledge [J]. Lecture Notes in Computer Science, 2005, 3651: 70-81

[15] DingY. W.. Comparative study on metaphors in eastern and western cultures [J]. Academic Exchange, 2004, 129(12): 159-161

[16] WangZ. M., WangH. F., DuanH. M., HanS., YuS. W.. Chinese noun phrase metaphor recognition with maximum entropy approach [J]. Lecture Notes in Computer Science, 2006, 3878: 235-244