Phrase Parses Reranking Based on Higher-Order Lexical Dependencies
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The existing works on parsing show that lexical dependencies are helpful for phrase tree parsing.However, only first-order lexical dependencies have been employed and investigated in previous research. Thispaper proposes a novel method for employing higher-order lexical dependencies for phrase tree evaluation. Themethod is based on a parse reranking framework, which provides a constrained search space (via N-best lists orparse forests) and enables the parser to employ relatively complicated lexical dependency features. The models areevaluated on the UPenn Chinese Treebank. The highest F1 score reaches 85.74% and has outperformed allpreviously reported state-of-the-art systems. The dependency accuracy of phrase trees generated by the parser hasbeen significantly improved as well.

    Reference
    Related
    Cited by
Get Citation

王志国,宗成庆.基于高阶词汇依存的短语结构树重排序模型.软件学报,2012,23(10):2628-2642

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 13,2011
  • Revised:February 15,2012
  • Adopted:
  • Online: September 30,2012
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063