#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1996

2017

- This year (3)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Wilhelm Plesken, Bernd Souvignier
- J. Symb. Comput.
- 1997

- Bernd Souvignier, Andreas Kellner, Bernhard Rüber, Hauke Schramm, Frank Seide
- IEEE Trans. Speech and Audio Processing
- 2000

In this paper we present technology used in spoken dialog systems for applications of a wide range. They include tasks from the travel domain and automatic switchboards as well as large scale directory assistance. The overall goal in developing spoken dialog systems is to allow for a natural and flexible dialog flow similar to human–human interaction. This… (More)

- John J. Cannon, Bernd Souvignier
- ISSAC
- 1997

We present new methods to compute the conjugacy classes of elements in a finite permutation group. For groups with a non-trivial soluble radical we lift the classes of the quotient by the radical through elementary abelian layers of it to classes of the full group. This reduces the general case to groups with trivial Fitting subgroup. For groups of thk type… (More)

The robust estimation of language models for new applications of spoken dialogue systems often suffers from a shortcoming of training material. An alternative to training a language model is to improve an initial language model using material obtained while running the new system, thus adapting it to the new task. In this paper we investigate different… (More)

- Derek F. Holt, Wilhelm Plesken, Bernd Souvignier
- J. Symb. Comput.
- 1997

- Wilhelm Plesken, Bernd Souvignier
- J. Symb. Comput.
- 1997

One idea how to prove that a finitely presented group G is infinite is to construct suitable homomorphisms into infinite matrix groups. In [HoP 92] this is done by starting with a finite image H of G and solving linear equations to check whether the epimorphism onto H can be lifted to a representation whose image is an extension of a ZZ-lattice by H, thus… (More)

- Wilhelm Plesken, Bernd Souvignier
- Experimental Mathematics
- 1996

Since automatic speech recognition is error prone it is highly desirable to obtain information on the reliability of a recognition result. For many applications it is interesting to know how well a sequence of words rather than a single word was understood, for example a credit card number or a phrase specifying a time or location. In this paper we present… (More)

- Bernd Souvignier, Andreas Kellner
- ICSLP
- 1998

The robust estimation of language models for new applications of spoken dialogue systems often suffers from a shortcoming of training material. An alternative to training a language model is to improve an initial language model using material obtained while running the new system, thus adapting it to the new task. In this paper we investigate different… (More)

- Bernd Souvignier
- Acta crystallographica. Section A, Foundations of…
- 2003

This paper gives classification results for crystallographic groups in dimensions up to 6 which refine earlier enumeration results. Based on the classification data, the asymptotic growth of the number of space-group types is discussed. The classification scheme for crystallographic groups is revisited and a new classification level in between that of… (More)