Sciweavers

213 search results - page 21 / 43
» Relating Word and Tree Automata
Sort
View
CSL
2007
Springer
13 years 7 months ago
Discriminative n-gram language modeling
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins
CORR
2007
Springer
78views Education» more  CORR 2007»
13 years 7 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
LREC
2008
141views Education» more  LREC 2008»
13 years 9 months ago
The Penn Discourse TreeBank 2.0
We present the second version of the Penn Discourse Treebank, PDTB-2.0, describing its lexically-grounded annotations of discourse s and their two abstract object arguments over t...
Rashmi Prasad, Nikhil Dinesh, Alan Lee, Eleni Milt...