Sciweavers

17 search results - page 2 / 4
» Algorithms for Deterministic Incremental Dependency Parsing
Sort
View
EMNLP
2007
13 years 7 months ago
Online Learning for Deterministic Dependency Parsing
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
Prashanth Mannem
ECML
2007
Springer
14 years 12 days ago
Probabilistic Models for Action-Based Chinese Dependency Parsing
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
Xiangyu Duan, Jun Zhao, Bo Xu
NAACL
2010
13 years 4 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
COLING
2008
13 years 7 months ago
Japanese Dependency Parsing Using a Tournament Model
In Japanese dependency parsing, Kudo's relative preference-based method (Kudo and Matsumoto, 2005) outperforms both deterministic and probabilistic CKY-based parsing methods....
Masakazu Iwatate, Masayuki Asahara, Yuji Matsumoto
ACL
2007
13 years 7 months ago
Fast Unsupervised Incremental Parsing
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structur...
Yoav Seginer