An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree |
| |
Authors: | FENG Shao-rong XIAO Wen-jun |
| |
Affiliation: | (1) College of Information Science and Technology, Xiamen University, Xiamen, 361005, China;(2) School of Computer Science and Engineering, South China University of Technology, Guangzhou, 510641, China |
| |
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.
Foundation item: Project(50474033) supported by the National Natural Science Foundation of China |
| |
Keywords: | pattern recognition tree matching algorithm dependency tree rule matching metaphor information processing |
本文献已被 维普 万方数据 SpringerLink 等数据库收录! |
|