Sciweavers

370 search results - page 16 / 74
» Dependency Parsing of Turkish
Sort
View
NAACL
2010
14 years 8 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
NLPRS
2001
Springer
15 years 3 months ago
Incremental CFG Parsing with Statistical Lexical Dependencies
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
Takahisa Murase, Shigeki Matsubara, Yoshihide Kato...
70
Voted
ACL
2007
15 years 21 hour ago
K-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
Keith Hall
ACL
2003
14 years 12 months ago
Parsing with Generative Models of Predicate-Argument Structure
The model used by the CCG parser of Hockenmaier and Steedman (2002b) would fail to capture the correct bilexical dependencies in a language with freer word order, such as Dutch. T...
Julia Hockenmaier
NAACL
2010
14 years 8 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea