Extremely Lexicalized Models for Accurate and Fast HPSG Parsing

This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the probabilities of selecting lexical entries. The proposed model is very simple, and experiments revealed that the implemented parser runs around four times faster than the previous model and that the proposed model has a high accuracy comparable to that of the previous model for probabilistic HPSG, which is defined over phrase structures. We also developed a hybrid of our probabilistic model and the conventional phrasestructure-based model. The hybrid model is not only significantly faster but also significantly more accurate by two points of precision and recall compared to the previous model.

• Type: Conference
• Year: 2006
• Where: EMNLP
• Authors: Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsuruoka, Yusuke Miyao, Jun-ichi Tsujii
• Keywords: Accurate Hpsg Parsing, EMNLP 2006, EMNLP 2007, Model, Probabilistic Model