Sciweavers

675 search results - page 31 / 135
» On Compression of Parse Trees
Sort
View
NAACL
1994
13 years 10 months ago
Decision Tree Parsing using a Hidden Derivation Model
Frederick Jelinek, John D. Lafferty, David M. Mage...
DAM
2010
66views more  DAM 2010»
13 years 8 months 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ý
TIT
2008
74views more  TIT 2008»
13 years 8 months 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
SPIRE
2010
Springer
13 years 7 months ago
Training Parse Trees for Efficient VF Coding
Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tats...