An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree
Gespeichert in:
| Titel: | An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree |
|---|---|
| Autoren: | Feng, S. R., Xiao, W. J., 冯少荣 |
| Quelle: | http://dx.doi.org/10.1007/s11771-009-0047-x. |
| Publikationsjahr: | 2009 |
| Bestand: | Xiamen University Institutional Repository |
| Schlagwörter: | pattern recognition, tree matching algorithm, dependency tree, rule matching, metaphor information processing |
| Beschreibung: | National Natural Science Foundation of China [50474033] ; 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. |
| Publikationsart: | article in journal/newspaper |
| Sprache: | English |
| ISSN: | 1005-9784 |
| Relation: | Journal of Central South University of Technology, 2009,16(2):275-279; ISI:000265145400018; http://dspace.xmu.edu.cn/handle/2288/70634 |
| Verfügbarkeit: | http://dspace.xmu.edu.cn/handle/2288/70634 |
| Dokumentencode: | edsbas.56A5F222 |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science Schreiben Sie den ersten Kommentar!