Sciweavers

3818 search results - page 65 / 764
» Word Problems on Compressed Words
Sort
View
SPIRE
1998
Springer
15 years 8 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
SIAMIS
2011
14 years 11 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
TSD
2007
Springer
15 years 10 months ago
The Effect of Lexicon Composition in Pronunciation by Analogy
Abstract. Pronunciation by analogy (PbA) is a data-driven approach to phonetic transcription that generates pronunciations for unknown words by exploiting the phonological knowledg...
Tasanawan Soonklang, Robert I. Damper, Yannick Mar...
ENTCS
2007
101views more  ENTCS 2007»
15 years 4 months ago
Compressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large p...
Hasan Amjad
ACL
2006
15 years 5 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...