Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. YANG Zong-kai, LIU Guang-ran, HE Jian-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.

    Article  Google Scholar 

  2. TONG Xiao-hua, WU Song-chun, WU Shu-qin, LIU Da-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.

    Google Scholar 

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

    Google Scholar 

  4. PASCAL F, CHRISTOPHE G. An edit distance between quotiented trees [J]. Algorithmic, 2003, 36(1): 1–39.

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  7. SCHLIEDER T, BERLIN F U, NAUMANN F. Approximate tree embedding for querying XML data [C]// Proceedings of ACM SIGIR Workshop on XML and Information Retrieval. Athens: The Research Publication Repository of KFUPM, 2000.

    Google Scholar 

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

    Google Scholar 

  9. DENNIS S, JASON T L W, SHAN H Y, ZHANG K Z. ATreeGrep: Approximate search in unordered tree [C]// Proceedings of the 14th International Conference on Scientific and Statistical Database Management. Edinburgh: IEEE Computer Society, 2002: 89–98.

    Google Scholar 

  10. DENNIS S, JASON T L W, ZHANG K Z, FRANK Y S. Exact and approximate algorithm for unordered tree matching [J]. IEEE Transactions On Systems, Man and Cybernetics, 1994, 24(4): 668–678.

    Article  MathSciNet  Google Scholar 

  11. ZHANG K Z, RICK S, DENNIS S. On the editing distance between unordered labeled trees [J]. Information Processing Letters, 1992, 42(3): 133–139.

    Article  MathSciNet  Google Scholar 

  12. GABRIEL G I L, MAARTEN D R, KHALIL S. A general probabilistic model for dependency parsing [C]// Proceedings of the 14th Dutch-Belgian Artificial Intelligence Conference. Leuven: Leuven University Press, 2002: 139–146.

    Google Scholar 

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

    Google Scholar 

  14. XIONG D Y, LI S L, LIU Q, LIN S X, QIAN Y L. Parsing the Penn Chinese treebank with semantic knowledge [J]. Lecture Notes in Computer Science, 2005, 3651: 70–81.

    Article  Google Scholar 

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

    Google Scholar 

  16. WANG Z M, WANG H F, DUAN H M, HAN S, YU S W. Chinese noun phrase metaphor recognition with maximum entropy approach [J]. Lecture Notes in Computer Science, 2006, 3878: 235–244.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Technology, Xiamen University, Xiamen, 361005, China

    Shao-rong Feng  (冯少荣)

  2. School of Computer Science and Engineering, South China University of Technology, Guangzhou, 510641, China

    Shao-rong Feng  (冯少荣) & Wen-jun Xiao  (肖文俊)

Authors
  1. Shao-rong Feng  (冯少荣)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-jun Xiao  (肖文俊)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shao-rong Feng  (冯少荣).

Additional information

Foundation item: Project(50474033) supported by the National Natural Science Foundation of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, Sr., Xiao, Wj. An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree. J. Cent. South Univ. Technol. 16, 275–279 (2009). https://doi.org/10.1007/s11771-009-0047-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-009-0047-x

Key words

Search

Navigation