Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ACL
2007

favoriteEmaildiscussreport

168views Computational Linguistics» more ACL 2007»

K-best Spanning Tree Parsing

13 years 5 months ago

K-best Spanning Tree Parsing

Download aclweb.org

This paper introduces a Maximum Entropy dependency parser based on an efﬁcient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored constraints of the MST algorithm signiﬁcantly inhibit parsing accuracy, we show that generating the 50-best parses according to an edge-factored model has an oracle performance well above the 1-best performance of the best dependency parsers. This motivates our parsing approach, which is based on reranking the kbest parses generated by an edge-factored model. Oracle parse accuracy results are presented for the edge-factored model and 1-best results for the reranker on eight languages (seven from CoNLL-X and English).

Keith Hall

Real-time Traffic

ACL 2007 | Computational Linguistics | Dependency Parsers | Edge-factored Model | Maximum Entropy Dependency |

claim paper

Related Content

» Efficient probabilistic topdown and leftcorner parsing

» Finding the k Smallest Spanning Trees

» QuadraticTime Dependency Parsing for Machine Translation

» Exploiting Constituent Dependencies for Tree KernelBased Semantic Relation Extraction

» Tree KernelBased Semantic Relation Extraction Using Unified Dynamic Relation Tree

» Dependency Parsing and Projection Based on WordPair Classification

» Extracting Narrative Timelines as Temporal Dependency Structures

» Tree KernelBased Relation Extraction with ContextSensitive Structured Parse Tree Informati...

» Dual Decomposition for Parsing with NonProjective Head Automata

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	ACL
Authors	Keith Hall

Comments (0)