doi: 10.4304/jsw.5.5.490-497
A Novel Probabilistic Model for Dependency Parsing
Abstract—A new knowledge based probabilistic dependency parsing (KPDP) is presented to overcome the local optimization problem of native probabilistic models. KPDP is composed of two stages: (1) selecting a set of constituent parse trees with an extensive bottom-up chart parsing algorithm which employs Maximum Entropy Models to calculate single arc probabilities; (2) finding the best parsing tree with the help of word knowledge. Different from previous studies, we incorporate word knowledge into parsing procedure. Based on case grammar theory, the word knowledge is represented as some patterns which group those arcs with the same head. Thus, the KPDP contains both single arc information and the relationship information between relevant arcs. KPDP is evaluated experimentally using the dataset distributed in CoNLL 2008 share-task. An unlabelled arc score of 87 % is reported, which is 3.39% higher than the native model without word knowledge. This work will contribute to and stimulate other researches in the field of parsing.
Index Terms—knowledge based probabilistic dependency parsing, Chart Parsing, Maximum Entropy Models.
Cite: Shixi Fan, Xuan Wang, Xiaolong Wang, "A Novel Probabilistic Model for Dependency Parsing," Journal of Software vol. 5, no. 5, pp. 490-497, 2010.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]