CSL
2002
Springer
13 years 11 months ago
2002
Springer
CSL
2002
Springer
13 years 11 months ago
2002
Springer
CSL
2002
Springer
13 years 11 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. We show that Gentzen's sequent calculus admits generalization of semi-terms of particularly simple form. This theorem extends one of the main results in [BS95] to la...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. Building on previous work by Mints, Buchholz and Schwichtenberg, a simplified version of continuous normalization for the untyped -calculus and G
CSL
2000
Springer
13 years 11 months ago
2000
Springer
This paper introduces a new form of observation distributions for hidden Markov models (HMMs), combining subvector quantization and mixtures of discrete distrib utions. Despite w...
CSL
2000
Springer
13 years 11 months ago
2000
Springer
CSL
2000
Springer
13 years 11 months ago
2000
Springer
Conversational speech exhibits considerable pronunciation variability, which has been shown to have a detrimental effect on the accuracy of automatic speech recognition. There hav...
CSL
2000
Springer
13 years 11 months ago
2000
Springer
We report work on the first component of a two stage speech recognition architecture based on phonological features rather than phones. The paper reports experiments on three phon...
CSL
2000
Springer
13 years 11 months ago
2000
Springer
This paper outlines ProSynth, an approach to speech synthesis which takes a rich linguistic structure as central to the generation of natural-sounding speech. We start from the as...