Refine
Year of publication
Document Type
- Conference Proceeding (36)
- Contribution to a Periodical (5)
- Book (2)
- Article (peer reviewed) (1)
Has Fulltext
- no (44)
Is part of the Bibliography
- no (44)
Keywords
- Speech Recognition (18)
- Automatic Speech Recognition (3)
- Automatic Evaluation (2)
- GMM (2)
- Spracherkennung (2)
- automatic assessment (2)
- automatic speech recognition (2)
- automatic summarization (2)
- meeting summarization (2)
- productivity (2)
Institute
In the past decade, semi-continuous hidden Markov models (SCHMMs) have not attracted much attention in the speech recognition community. Growing amounts of training data and increasing sophistication of model estimation led to the impression that continuous HMMs are the best choice of acoustic model. However, recent work on recognition of under-resourced languages faces the same old problem of estimating a large number of parameters from limited amounts of transcribed speech. This has led to a renewed interest in methods of reducing the number of parameters while maintaining or extending the modeling capabilities of continuous models. In this work, we compare classic and multiple-codebook semi-continuous models using diagonal and full covariance matrices with continuous HMMs and subspace Gaussian mixture models. Experiments on the RM and WSJ corpora show that while a classical semicontinuous system does not perform as well as a continuous one, multiple-codebook semi-continuous systems can perform better, particular when using full-covariance Gaussians.
Folks that have been here last winter prior to ASRU might be familiar with the title of that talk. But don't be misled, I'll have something new for you. In this talk, I will give an overview over the FAU Lecture Browser which I developed in the context of my thesis. I will start out with the description of a novel data set: The LME Lectures are a corpus of two series of graduate level computer science lectures with 18 recordings each. The courses cover topics in medical image processing and pattern analysis/machine learning. The roughly 40 hours of speech were manually transcribed, and one particular lecture was annotated with key phrases by five human raters. Using this data set, I trained three different speech recognizers using regular continuous, multi-codebook semi-continuous and subspace Gaussian mixture models, that show an error rate of about 10% WER. I will then briefly describe the key phrase extraction and automatic ranking, which was then compared against five raters on one lecture recording. Finally, I will talk about a little usability study where 10 students were asked to perform a certain task-- with and without the proposed lecture browser. Although the number of contestants is limited, the numbers are interesting: the users that had the interface could complete the tasks about 30% faster than the control group, while maintaining about the same accuracy.
We describe a lattice generation method that is exact, i.e. it satisfies all the natural properties we would want from a lattice of alternative transcriptions of an utterance. This method does not introduce substantial overhead above one-best decoding. Our method is most directly applicable when using WFST decoders where the WFST is “fully expanded”, i.e. where the arcs correspond to HMM transitions. It outputs lattices that include HMM-state-level alignments as well as word labels. The general idea is to create a state-level lattice during decoding, and to do a special form of determinization that retains only the best-scoring path for each word sequence. This special determinization algorithm is a solution to the following problem: Given a WFST A, compute a WFST B that, for each input-symbol-sequence of A, contains just the lowest-cost path through A.
Previously we have shown that ASR technology can be used to objectively evaluate pathologic speech. Here we report on progress for routine clinical use: 1) We introduce an easy-to-use recording and evaluation environment. 2) We confirm our previous results for a larger group of patients. 3) We show that telephone speech can be analyzed with the same methods with only a small loss of agreement with human experts. 4) We show that prosodic information leads to more robust results. 5) We show that text reference instead of transliteration can be used for evaluation. Using word accuracy of a speech recognizer and prosodic features as features for SVM regression, we achieve a correlation of .90 between the automatic analysis and human experts.
Online Identification of Learner Problem Solving Strategies Using Pattern Recognition Methods
(2010)
Learning and programming environments used in computer science education give feedback to the users by system messages. These are triggered by programming errors and give only "technical" hints without regard to the learners' problem solving process. To adapt the messages not only to the factual but also to the procedural knowledge of the learners, their problem solving strategies have to be identified automatically and in process. This article describes a way to achieve this with the help of pattern recognition methods. Using data from a study with 65 learners aged 12 to 13 using a learning environment for programming, a classification system based on hidden Markov models is trained and integrated in the very same environment. We discuss findings in that data and the performance of the automatic online identification, and present first results using the developed software in class.
In earlier studies, we assessed the degree of non-nativeness employing prosodic information. In this paper, we combine prosodic information with (1) features derived from a Gaussian Mixture Model used as Universal Background Model (GMM-UBM), a powerful approach used in speaker identification, and (2) openSMILE, a standard open-source toolkit for extracting acoustic features. We evaluate our approach with English speech from 94 non-native speakers. GMM-UBM or openSMILE modelling alone yields lower performance than our prosodic feature vector; however, adding information from the GMM-UBM modelling or openSMILE by late fusion improves results.
Tracheoesophageal voice is state-of-the-art in voice rehabilitation after laryngectomy. Intelligibility on a telephone is an important evaluation criterion as it is a crucial part of social life. An objective measure of intelligibility when talking on a telephone is desirable in the field of postlaryngectomy speech therapy and its evaluation.
Based upon successful earlier studies with broadband speech, an automatic speech recognition (ASR) system was applied to 41 recordings of postlaryngectomy patients. Recordings were available in different signal qualities; quality was the crucial criterion for this study.
Compared to the intelligibility rating of 5 human experts, the ASR system had a correlation coefficient of r = -0.87 and Krippendorff's alpha of 0.65 when broadband speech was processed. The rater group alone achieved alpha = 0.66. With the test recordings in telephone quality, the system reached r = -0.79 and alpha = 0.67.
For medical purposes, a comprehensive diagnostic approach to (substitute) voice has to cover both subjective and objective tests. An automatic recognition system such as the one proposed in this study can be used for objective intelligibility rating with results comparable to those of human experts. This holds for broadband speech as well as for automatic evaluation via telephone.
Tracheoesophageal (TE) speech is a possibility to restore the ability to speak after total laryngectomy, i.e. the removal of the larynx. The quality of the substitute voice has to be evaluated during therapy. For the intelligibility evaluation of German speakers over telephone, the Post-Laryngectomy Telephone Test (PLTT) was defined. Each patient reads out 20 of 400 different monosyllabic words and 5 out of 100 sentences. A human listener writes down the words and sentences understood and computes an overall score. This paper presents a means of objective and automatic evaluation that can replace the subjective method. The scores of 11 naïve raters for a set of 31 test speakers were compared to the word recognition rate of speech recognizers. Correlation values of about 0.9 were reached.
In dieser Studie wird ein objektives Verfahren für die Verständlichkeitsmessung mit dem Postlaryngektomie-Telefontest (PLTT) mittels automatischer Spracherkennungstechnik beschrieben.
31 Sprecher mit tracheoösophagealer Ersatzstimme (25 Männer und 6 Frauen; 63,4±8,7 Jahre) wurden zunächst von 11 naiven Hörern bewertet. Der vom Spracherkennungssystem ermittelte Verständlichkeitsgrad wird als Prozentsatz korrekt verstandener Wörter einer Wortkette, der Wortakkuratheit bzw. -korrektheit, angegeben und mit den subjektiv ermittelten PLTT-Werten verglichen.
Die durchschnittliche PLTT-Gesamtverständlichkeit der 11 naiven Hörer liegt bei 47%, die automatisch ermittelte Wortakkuratheit und Wortkorrektheit liegen deutlich niedriger (etwa 0% bzw. etwa 15%). Die Korrelation zwischen menschlicher und maschineller Bewertung liegt jedoch z. T. über 0,9.
Für den Gesamtverständlichkeitswert des PLTT kann mit Hilfe der automatischen Spracherkennung objektiv und effizient ein äquivalentes Maß berechnet werden.