250 search results - page 27 / 50 » Reorganizing compressed text |
VLDB
1993
ACM
15 years 2 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
IUI
2003
ACM
15 years 3 months ago
2003
ACM
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on PDAs or cell phones or by disabled users) by taking a...
102
click to vote
EMNLP
2011
13 years 9 months ago
2011
Previous work has shown that high quality phrasal paraphrases can be extracted from bilingual parallel corpora. However, it is not clear whether bitexts are an appropriate resourc...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...