Sciweavers

675 search results - page 50 / 135
» On Compression of Parse Trees
Sort
View
NAACL
2010
13 years 6 months ago
An extractive supervised two-stage method for sentence compression
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
Dimitrios Galanis, Ion Androutsopoulos
ACL
2009
13 years 6 months ago
Forest-based Tree Sequence to String Translation Model
This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string tr...
Hui Zhang, Min Zhang, Haizhou Li, AiTi Aw, Chew Li...
MT
2006
106views more  MT 2006»
13 years 8 months ago
Example-based machine translation based on tree-string correspondence and statistical generation
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
Zhan-yi Liu, Haifeng Wang, Hua Wu
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 3 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
ADBIS
2003
Springer
114views Database» more  ADBIS 2003»
14 years 2 months ago
Compressing Large Signature Trees
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...