FG Kommunikationstechnik
Refine
Year of publication
Document Type
- Conference Proceeding (180)
- Part of a book (chapter) (24)
- Scientific journal article peer-reviewed (21)
- Conference publication peer-reviewed (21)
- Scientific journal article not peer-reviewed (15)
- Book (publisher) (9)
- Report (8)
- Patent (7)
- Doctoral thesis (6)
- Book (3)
Way of publication
- Open Access (7)
Keywords
- machine learning (4)
- Künstliche Intelligenz (2)
- Machine learning (2)
- Music psychology (2)
- Non-destructive testing (2)
- AURORA (1)
- Accessability (1)
- Acoustic (1)
- Anfragesysteme (1)
- Artificial intelligence (1)
Institute
Zum Einsatz akustischer Komponenten im E-Learning-Modul "Elektronische Sprachsignalverarbeitung"
(2002)
In this paper we show how word class based language modeling can support the integration of a small language in modern applications of speech technology. The methods described in this paper can be applied for any language. We demonstrate the methods on Upper Sorbian. The word classes model the semantic expressions of numerals, date and time of day. The implementation of the created grammars was realized in the form of finite-state-transducers (FSTs) and minimalists grammars (MGs). We practically demonstrate the usage of the FSTs in a simple smart-home speech application, that is able to set wake-up alarms and appointments expressed in a variety of spontaneous and natural sentences. While the created MGs are not integrated in an application for practical use yet, they provide evidence that MGs could potentially work more efficient than FSTs in built-on applications. In particular, MGs can work with a significantly smaller lexicon size, since their more complex structure lets them generate more expressions with less items, while still avoiding wrong expressions.
Vector symbolic architectures (VSA) are a viable approach for the hyperdimensional representation of symbolic data, such as documents, syntactic structures, or semantic frames. We present a rigorous mathematical framework for the representation of phrase structure trees and parse trees of context-free grammars (CFG) in Fock space, i.e. infinite-dimensional Hilbert space as being used in quantum field theory. We define a novel normal form for CFG by means of term algebras. Using a recently developed software toolbox, called FockBox, we construct Fock space representations for the trees built up by a CFG left-corner (LC) parser. We prove a universal representation theorem for CFG term algebras in Fock space and illustrate our findings through a low-dimensional principal component projection of the LC parser state. Our approach could leverage the development of VSA for explainable artificial intelligence (XAI) by means of hyperdimensional deep neural computation.