39 search results - page 7 / 8 » Tree Compression Using String Grammars |
CORR
1998
Springer
13 years 10 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
EMNLP
2010
13 years 8 months ago
2010
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...
DCC
2010
IEEE
14 years 5 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
ACL
2010
13 years 9 months ago
2010
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...