675 search results - page 67 / 135 » On Compression of Parse Trees |
ESSLLI
1999
Springer
14 years 1 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
TPDS
2008
13 years 8 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
EMNLP
2009
13 years 6 months ago
2009
This work introduces a model free approach to sentence compression, which grew out of ideas from Nomoto (2008), and examines how it compares to a state-of-art model intensive appr...
LATA
2010
Springer
14 years 3 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...