Sciweavers

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

12

EMNLP
2009

favoriteEmaildiscussreport

144views Natural Language Processing» more EMNLP 2009»

Statistical Bistratal Dependency Parsing

13 years 2 months ago

Statistical Bistratal Dependency Parsing

Download www.aclweb.org

We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search algorithm for projective dependency parsing, which is used as the backbone of a beam search procedure. This allows us to handle the complex nonlocal feature dependencies occurring in bistratal parsing if we model the interdependency between the two layers. We apply the algorithm to the syntactic

Richard Johansson

Real-time Traffic

EMNLP 2009 | Inexact Search Algorithm | Natural Language Processing | Search Algorithm | Two-layered Dependency Graph |

claim paper

Related Content

» A lowcomplexity broadcoverage probabilistic Dependency Parser for English

» It Depends on the Translation Unsupervised Dependency Parsing via Word Alignment

» Japanese Dependency Parsing Using CoOccurrence Information and a Combination of Case Eleme...

» Deep Dependencies from ContextFree Statistical Parsers Correcting the Surface Dependency A...

» Incremental CFG Parsing with Statistical Lexical Dependencies

» Importance of Linguistic Constraints in Statistical Dependency Parsing

» Benchmarking of Statistical Dependency Parsers for French

» Probabilistic Models of Nonprojective Dependency Trees

» Statistical French Dependency Parsing Treebank Conversion and First Results

Post Info
More Details (n/a)

Added	17 Feb 2011
Updated	17 Feb 2011
Type	Journal
Year	2009
Where	EMNLP
Authors	Richard Johansson

Comments (0)