Sciweavers

675 search results - page 38 / 135
» On Compression of Parse Trees
Sort
View
DCC
2005
IEEE
14 years 8 months ago
Lossless Data Compression Using Optimal Tree Machines
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
Gergely Korodi, Jorma Rissanen, Ioan Tabus
COLING
2010
13 years 3 months ago
Simplicity is Better: Revisiting Single Kernel PPI Extraction
It has been known that a combination of multiple kernels and addition of various resources are the best options for improving effectiveness of kernel-based PPI extraction methods....
Sung-Pil Choi, Sung-Hyon Myaeng
ACL
2011
13 years 11 days ago
Adjoining Tree-to-String Translation
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...
Yang Liu, Qun Liu, Yajuan Lü
ACL
2012
11 years 11 months ago
Higher-order Constituent Parsing and Parser Combination
This paper presents a higher-order model for constituent parsing aimed at utilizing more local structural context to decide the score of a grammar rule instance in a parse tree. E...
Xiao Chen, Chunyu Kit
ICIP
1999
IEEE
14 years 10 months ago
Unsupervised Progressive Parsing of Poisson Fields Using Minimum Description Length, Criteria
This paper describes novel methods for estimating piecewise homogeneous Poisson elds based on minimum description length (MDL) criteria. By adopting a coding-theoretic approach, o...
Mário A. T. Figueiredo, Robert D. Nowak