Sciweavers

621 search results - page 30 / 125
» Parsing As Tree Traversal
Sort
View
82
Voted
NAACL
2007
15 years 1 months ago
Tree Revision Learning for Dependency Parsing
We present a revision learning model for improving the accuracy of a dependency parser. The revision stage corrects the output of the base parser by means of revision rules learne...
Giuseppe Attardi, Massimiliano Ciaramita
71
Voted
NAACL
1994
15 years 1 months ago
Decision Tree Parsing using a Hidden Derivation Model
Frederick Jelinek, John D. Lafferty, David M. Mage...
61
Voted
DAM
2010
66views more  DAM 2010»
15 years 18 days ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
76
Voted
TIT
2008
74views more  TIT 2008»
15 years 12 days ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
77
Voted
SPIRE
2010
Springer
14 years 11 months ago
Training Parse Trees for Efficient VF Coding
Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tats...