Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bernt Andrassy

dblp:65/7163 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Speech recognition and synthesis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis
automatic speech recognition
0.012002
ASR in mobile phones - an industrial approach · IEEE Trans. Speech Audio Process. 2002
Natural language and speech › Speech recognition and synthesis › automatic speech recognition
embedded speech recognition
0.012002
ASR in mobile phones - an industrial approach · IEEE Trans. Speech Audio Process. 2002
Natural language and speech › Speech recognition and synthesis › automatic speech recognition › robust speech recognition
noise-robust speech recognition
0.012002
ASR in mobile phones - an industrial approach · IEEE Trans. Speech Audio Process. 2002

Methods — techniques the papers use, named apart from their topics

integer implementation · 0.1hidden markov model · 0.1discriminative training · 0.1
YearPublicationVenuePosition
2018 Deep Temporal-Recurrent-Replicated-Softmax for Topical Trends over Time
abstract
Pankaj Gupta, Subburam Rajaram, Hinrich Schütze, Bernt Andrassy. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). 2018.
Pankaj Gupta 0003, Subburam Rajaram, Hinrich Schütze, Bernt Andrassy
NAACL-HLT4
2016 Table Filling Multi-Task Recurrent Neural Network for Joint Entity and Relation Extraction
abstract
This paper proposes a novel context-aware joint entity and word-level relation extraction approach through semantic composition of words, introducing a Table Filling Multi-Task Recurrent Neural Network (TF-MTRNN) model that reduces the entity recognition and relation classification tasks to a table-filling problem and models their interdependencies. The proposed neural network architecture is capable of modeling multiple relation instances without knowing the corresponding relation arguments in a sentence. The experimental results show that a simple approach of piggybacking candidate entities to model the label dependencies from relations to entities improves performance. We present state-of-the-art results with improvements of 2.0% and 2.7% for entity recognition and relation classification, respectively on CoNLL04 dataset.
Pankaj Gupta 0003, Hinrich Schütze, Bernt Andrassy
COLING3
2007 Comparison of Four Approaches to Age and Gender Recognition for Telephone Applications
abstract
This paper presents a comparative study of four different approaches to automatic age and gender classification using seven classes on a telephony speech task and also compares the results with human performance on the same data. The automatic approaches compared are based on (1) a parallel phone recognizer, derived from an automatic language identification system; (2) a system using dynamic Bayesian networks to combine several prosodic features; (3) a system based solely on linear prediction analysis; and (4) Gaussian mixture models based on MFCCs for separate recognition of age and gender. On average, the parallel phone recognizer performs as well as Human listeners do, while loosing performance on short utterances. The system based on prosodic features however shows very little dependence on the length of the utterance.
Florian Metze, Jitendra Ajmera, Roman Englert, Udo Bub, Felix Burkhardt, Joachim Stegmann, Christian Müller 0014, Richard Huber, Bernt Andrassy, Josef G. Bauer, Bernhard Littel
ICASSP (4)9
2007 Discriminative optimization of language adapted HMMs for a language identification system based on parallel phoneme recognizers
Josef G. Bauer, Bernt Andrassy, Ekaterina Timoshenko
INTERSPEECH2
2006 Human and machine recognition as a function of SNR
Bernt Andrassy, Harald Höge
LREC1
2003 Large vocabulary speaker independent isolated word recognition for embedded systems
Sergey Astrov, Bernt Andrassy
INTERSPEECH2
2003 Environment adaptive control of noise reduction parameters for improved robustness of ASR
Chng Chin Soon, Bernt Andrassy, Josef G. Bauer, Günther Ruske
INTERSPEECH2
2002 ASR in mobile phones - an industrial approach
abstract
In order to make hidden Markov model (HMM) speech recognition suitable for mobile phone applications, Siemens developed a recognizer, Very Smart Recognizer (VSR), for deployment in future mobile phone generations. Typical applications will be name dialling, command and control operations suited for different environments, for example in cars. The paper describes research and development issues of a speech recognizer in mobile devices focusing on noise robustness, memory efficiency and integer implementation. The VSR is shown to reach a word error rate as low as 4.1% on continuous digits recorded in a car environment. Furthermore by means of discriminative training and HMM-parameter coding, the memory requirements of the VSR HMMs are smaller than 64 kBytes.
Imre Varga, Stefanie Aalburg, Bernt Andrassy, Sergey Astrov, Josef G. Bauer, Christophe Beaugeant, Christian Geißler, Harald Höge
IEEE Trans. Speech Audio Process.3
2001 Recognition performance of the siemens front-end with and without frame dropping on the Aurora 2 database
abstract
Abstract Following the objective of the Eurospeech special event,'Noise Robust Recognition', the recognition results of a noiserobust front-end, developed by Siemens, on the Aurora 2 da-tabase [1] are presented in this paper. The front-end wastested with and without a frame dropping algorithm. It isshown that the front-end improves the recognition results inhigh mismatch between training and testing by 43.90% overthe reference front-end and works particularily well in con-ditions with high noise. Furthermore it is shown that theframe dropping mainly increases the performance of the front-end. 1. Introduction The front-end employed is a cepstral analysis scheme withspectral attenuation and spectral subtraction, a channel com-pensation, calculation of the time derivatives, an LDA and aframe dropping algorithm (Figure 1).Details of the front-end can be seen from Table 1. The spe-cific algorithms are shortly described in the following.Parameter settings of the front-endFrame length: 32 msFrame shift: 15 msNumber of samples per frame, NF: 256Preemphasis factor: 0.95Lenght of FFT, FFTL: 256Number of Mel filter banks: 15Number of cepstral coefficients: 12Number of first derivatives: 13Number of second derivatives: 13Size of the feature vector: 24Table 1: Parameter settings of the front-end
Bernt Andrassy, Damjan Vlaj, Christophe Beaugeant
INTERSPEECH1