Sciweavers

CSL
2007
Springer
13 years 4 months ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young
CSL
2007
Springer
13 years 4 months ago
Automatic phonetic transcription of large speech corpora
This study is aimed at investigating whether automatic phonetic transcription procedures can approximate manual transcriptions typically delivered with contemporary large speech c...
Christophe Van Bael, Lou Boves, Henk van den Heuve...
CSL
2007
Springer
13 years 4 months ago
Discriminative semi-parametric trajectory model for speech recognition
Hidden Markov Models (HMMs) are the most commonly used acoustic model for speech recognition. In HMMs, the probability of successive observations is assumed independent given the ...
K. C. Sim, M. J. F. Gales
CSL
2007
Springer
13 years 4 months ago
Iterative reconstruction of speech from short-time Fourier transform phase and magnitude spectra
In this paper, we consider the topic of iterative, one dimensional, signal reconstruction (specifically speech signals) from the magnitude spectrum and the phase spectrum. While ...
Leigh D. Alsteris, Kuldip K. Paliwal
CSL
2007
Springer
13 years 4 months ago
'Early recognition' of polysyllabic words in continuous speech
Humans are able to recognise a word before its acoustic realisation is complete. This in contrast to conventional automatic speech recognition (ASR) systems, which compute the lik...
Odette Scharenborg, Louis ten Bosch, Lou Boves
CSL
2007
Springer
13 years 8 months ago
Logical Refinements of Church's Problem
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
Alexander Rabinovich, Wolfgang Thomas
CSL
2007
Springer
13 years 8 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
CSL
2007
Springer
13 years 8 months ago
Lambda Theories of Effective Lambda Models
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
Chantal Berline, Giulio Manzonetto, Antonino Salib...
CSL
2007
Springer
13 years 8 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...