Sciweavers

27 search results - page 4 / 6
» A Small Automaton for Word Recognition in DNA Sequences
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 7 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
ACL
2003
13 years 8 months ago
Generalized Algorithms for Constructing Statistical Language Models
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
Cyril Allauzen, Mehryar Mohri, Brian Roark
ICASSP
2011
IEEE
12 years 11 months ago
Structured discriminative models for noise robust continuous speech recognition
Recently there has been interest in structured discriminative models for speech recognition. In these models sentence posteriors are directly modelled, given a set of features ext...
Anton Ragni, Mark John Francis Gales
JMLR
2008
148views more  JMLR 2008»
13 years 7 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
JMM2
2007
106views more  JMM2 2007»
13 years 7 months ago
Lexical Structure for Dialogue Act Recognition
— This paper deals with automatic dialogue acts (DAs) recognition in Czech. Dialogue acts are sentence-level labels that represent different states of a dialogue, such as questio...
Pavel Král, Christophe Cerisara, Jana Kleck...