Sciweavers

Share
37 search results - page 1 / 8
» Non-Projective Dependency Parsing in Expected Linear Time
Sort
View
ACL
2009
10 years 11 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre
EACL
2006
ACL Anthology
11 years 3 months ago
Constraints on Non-Projective Dependency Parsing
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
Joakim Nivre
NAACL
2007
11 years 3 months ago
Incremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
Joakim Nivre
COLING
2008
11 years 3 months ago
Robust and Efficient Chinese Word Dependency Analysis with Linear Kernel Support Vector Machines
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
Yu-Chieh Wu, Jie-Chi Yang, Yue-Shi Lee
ACL
2010
10 years 11 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
books