Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower bounds which are reached with high probability. We prove bounds for all values of m(n) ≥ n/polylog(n) by using the simple and well-known method of the first and second moment.
The project Technology and Corpora for Speech to Speech Translation (TC-STAR) aims at making a breakthrough in speech-to-speech translation research, significantly reducing the gap between the performance of machines and humans at this task. Technological and scientific progress is driven by periodic, competitive evaluations within the project. For… (More)
This paper presents a review of already collected non-native speech databases. Although the number of non-native speech databases is significantly less than the one of common speech databases, there were already a lot of data collection efforts taken at different institutes and companies. Because of the comparably small size of the databases, many of them… (More)
In many embedded systems commands and other words in the user's main language must be recognized with maximum accuracy, but it should be possible to use foreign names as they frequently occur in music titles or city names. Example systems with constrained resources are navigation systems, mobile phones and MP3 players. Speech recognizers on embedded systems… (More)
Following ideas from [Hei83, DFGS91, MT97] and applying the techniques proposed in [May89, KM96, Küh98], we present a deterministic algorithm for computing the dimension of a polynomial ideal requiring polynomial working space.
Our goal is to provide a multilingual speech based Human Machine Interface for in-car infotainment and navigation systems. The multilinguality is for example needed for music player control via speech as artist and song names in the globalized music market come from many languages. Another frequent use case is the input of foreign navigation destinations… (More)
This paper presents results of a combination of two algorithms for the fast and effective support of multilingual speech in a dialog system. Previously only results of the individual algorithms were published. The Multilingual Weighted Codebook algorithm generates sets of Gaussians (codebooks) that cover multiple languages well, especially it was designed… (More)
This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may… (More)