Lexicalized Beam Thresholding Parsing with Prior and Boundary Estimates

  • Deyi Xiong
  • Qun Liu
  • Shouxun Lin
Conference paper

DOI: 10.1007/978-3-540-30586-6_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3406)
Cite this paper as:
Xiong D., Liu Q., Lin S. (2005) Lexicalized Beam Thresholding Parsing with Prior and Boundary Estimates. In: Gelbukh A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2005. Lecture Notes in Computer Science, vol 3406. Springer, Berlin, Heidelberg

Abstract

We use prior and boundary estimates as the approximation of outside probability and establish our beam thresholding strategies based on these estimates. Lexical items, e.g. head word and head tag, are also incorporated to lexicalized prior and boundary estimates. Experiments on the Penn Chinese Treebank show that beam thresholding with lexicalized prior works much better than that with unlexicalized prior. Differentiating completed edges from incomplete edges paves the way for using boundary estimates in the edge-based beam chart parsing. The beam thresholding based on lexicalized prior, combined with unlexicalized boundary, runs faster than that only with lexicalized prior by a factor of 1.5, at the same performance level.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Deyi Xiong
    • 1
    • 2
  • Qun Liu
    • 1
  • Shouxun Lin
    • 1
  1. 1.Institute of Computing TechnologyChinese Academy of SciencesBeijingChina
  2. 2.Graduate School of Chinese Academy of Sciences 

Personalised recommendations