@misc{MaierWolff, author = {Maier, Isidor Konrad and Wolff, Matthias}, title = {A Decomposition Algorithm for Numerals based on Arithmetics}, doi = {10.5281/zenodo.7501698}, pages = {1}, abstract = {Poster presentation for an idea to decompose numerals}, language = {en} } @misc{TschoepeKraljevskiDuckhornetal., author = {Tsch{\"o}pe, Constanze and Kraljevski, Ivan and Duckhorn, Frank and Wolff, Matthias}, title = {Sprachtechnologie und akustische Mustererkennung in der medizinischen Anwendung}, series = {16. Landeskonferenz „Digitalisierung im Gesundheitswesen" 2021}, journal = {16. Landeskonferenz „Digitalisierung im Gesundheitswesen" 2021}, pages = {9}, language = {de} } @misc{RoemerbeimGrabenHuberLiebletal., author = {R{\"o}mer, Ronald and beim Graben, Peter and Huber-Liebl, Markus and Wolff, Matthias}, title = {(Pre-)linguistic Problem Solving based on Dynamic Semantics}, series = {14th IEEE International Conference on Cognitive Infocommunications - CogInfoCom 2023, September 22-23, Budapest, Hungary}, journal = {14th IEEE International Conference on Cognitive Infocommunications - CogInfoCom 2023, September 22-23, Budapest, Hungary}, isbn = {979-8-3503-2565-2}, issn = {2473-5671}, doi = {10.1109/CogInfoCom59411.2023.10397487}, pages = {147 -- 152}, language = {en} } @misc{MaierKuhnBeisegeletal., author = {Maier, Isidor Konrad and Kuhn, Johannes and Beisegel, Jesse and Huber-Liebl, Markus and Wolff, Matthias}, title = {Minimalist Grammar: Construction without Overgeneration}, series = {arXiv}, journal = {arXiv}, doi = {10.48550/arXiv.2311.01820}, pages = {51}, abstract = {In this paper we give instructions on how to write a minimalist grammar (MG). In order to present the instructions as an algorithm, we use a variant of context free grammars (CFG) as an input format. We can exclude overgeneration, if the CFG has no recursion, i.e. no non-terminal can (indirectly) derive to a right-hand side containing itself. The constructed MGs utilize licensors/-ees as a special way of exception handling. A CFG format for a derivation A_eats_B↦∗peter_eats_apples, where A and B generate noun phrases, normally leads to overgeneration, e.\,g., i_eats_apples. In order to avoid overgeneration, a CFG would need many non-terminal symbols and rules, that mainly produce the same word, just to handle exceptions. In our MGs however, we can summarize CFG rules that produce the same word in one item and handle exceptions by a proper distribution of licensees/-ors. The difficulty with this technique is that in most generations the majority of licensees/-ors is not needed, but still has to be triggered somehow. We solve this problem with ϵ-items called \emph{adapters}.}, language = {en} } @misc{KuhnWolffBorislavov, author = {Kuhn, Johannes and Wolff, Matthias and Borislavov, Borislav}, title = {Epsilon-Verarbeitung bei Minimalistischen Grammatiken f{\"u}r Zahlen}, series = {Elektronische Sprachsignalverarbeitung, Tagungsband der 35. Konferenz, 06.-08.03.2024, Regensburg}, journal = {Elektronische Sprachsignalverarbeitung, Tagungsband der 35. Konferenz, 06.-08.03.2024, Regensburg}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-325-6}, issn = {0940-6832}, pages = {78 -- 85}, abstract = {Um bei Minimalistischen Grammatiken (MG) {\"U}bergenerierung zu vermeiden, kann man Eintr{\"a}ge mit leeren Exponenten (ε-Eintr{\"a}ge) verwenden. Ein Eintrag besteht aus einem Exponenten, der die {\"A}ußerung oder Schrift eines Wortes repr{\"a}sentiert, einer Merkmalsliste, welche die Syntax kodiert und einem λ-Ausdruck, der die Semantik repr{\"a}sentiert. Leere Eintr{\"a}ge f{\"u}hren allerdings zu einer schlechteren Verwendbarkeit der Grammatik f{\"u}r das Parsen. Die vorliegende Arbeit wird ein Umformungsalgorithmus f{\"u}r MGs vorstellen, sodass die Anzahl der ε-Eintr{\"a}ge verringert werden kann, um sie wieder f{\"u}r Parser verwendbar zu machen. Hierzu werden die ε-Eintr{\"a}ge mit den anderen Eintr{\"a}gen vorverarbeitet und dadurch neue Eintr{\"a}ge geschaffen. Die nun {\"u}berfl{\"u}ssigen ε-Eintr{\"a}ge k{\"o}nnen dann problemlos entfernt werden. Der Algorithmus wurde anhand von {\"u}ber 260 Zahlwortgrammatiken getestet.}, language = {de} } @misc{KuhnWolffMaier, author = {Kuhn, Johannes and Wolff, Matthias and Maier, Isidor Konrad}, title = {Wortgenerator f{\"u}r Minimalistische Grammatiken}, series = {Elektronische Sprachsignalverarbeitung, Tagungsband der 36. Konferenz, 05.-07.03.2025, Halle/Saale}, journal = {Elektronische Sprachsignalverarbeitung, Tagungsband der 36. Konferenz, 05.-07.03.2025, Halle/Saale}, editor = {Grawunder, Sven}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-803-9}, issn = {0940-6832}, pages = {27 -- 34}, abstract = {Um eine bidirektionale Verarbeitung von Sprache zu realisieren, ist es von Vorteil den gleichen Sprachformalismus f{\"u}r das Parsen und die Generierung zu verwenden. F{\"u}r Minimalistische Grammatiken gibt es eine ausgepr{\"a}gte Literatur zu Parsern, aber noch keine Ver{\"o}ffentlichung zu Generatoren. Diese Arbeit stellt einen ersten Generator vor, der mittels Minimalistischer Grammatiken und λ-Ausdr{\"u}cken, S{\"a}tze erzeugt. Der hier vorgestellte Generator kann entgegen manchen anderen Generatoren, von anderen Grammatikformalismen, mit ε-Regeln arbeiten.}, language = {de} } @misc{HuberLieblRosenowRoemeretal., author = {Huber-Liebl, Markus and Rosenow, Tillmann and R{\"o}mer, Ronald and Wirsching, G{\"u}nther and Wolff, Matthias}, title = {It all starts with a little difference : tensors as data and code.}, series = {Elektronische Sprachsignalverarbeitung 2025 : Tagungsband der 36. Konferenz Halle/Saale, 5.-7. M{\"a}rz 2025}, journal = {Elektronische Sprachsignalverarbeitung 2025 : Tagungsband der 36. Konferenz Halle/Saale, 5.-7. M{\"a}rz 2025}, editor = {Grawunder, Sven}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-803-9}, issn = {0940-6832}, pages = {170 -- 179}, abstract = {We further promote the idea of quantum inspiration and propose to equip cognitive systems not only with tensors for data representation but also for operation representation. We argue that these are two sides of the same coin. For experimental symbolic algorithms we introduce a suitable testbed and give its proper specification. We formalize our method of behavioural control with tensor algebra and discuss its implementation for our physical testbed realization.}, language = {en} } @misc{MaierRosenowTuurietal., author = {Maier, Isidor Konrad and Rosenow, Tillmann and Tuuri, Okko and Wolff, Matthias}, title = {Frequency-magnitude relation of numeral words based on search-engine results}, series = {Elektronische Sprachsignalverarbeitung, Tagungsband der 36. Konferenz, 05.-07.03.2025, Halle/Saale}, journal = {Elektronische Sprachsignalverarbeitung, Tagungsband der 36. Konferenz, 05.-07.03.2025, Halle/Saale}, editor = {Grawunder, Sven}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-95908-803-9}, issn = {0940-6832}, pages = {51 -- 60}, abstract = {We googled various numeral words from 28 languages. Different approaches for the description of the data were investigated. In all of the 28 languages, the found frequency-magnitude dependence fits better to a power law than to an exponential law. The result can be used to distinguish grammatically correct from incorrect numerals based on the prediction of search results.}, language = {en} } @inproceedings{WolffSchubertHoffmannetal., author = {Wolff, Matthias and Schubert, R. and Hoffmann, R{\"u}diger and Tsch{\"o}pe, Constanze and Schulze, E. and Neun{\"u}bel, H.}, title = {Experiments in Acoustic Structural Health Monitoring of Airplane Parts}, series = {IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2008), 30.3.-4.4.2008, Las Vegas, USA}, booktitle = {IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2008), 30.3.-4.4.2008, Las Vegas, USA}, publisher = {IEEE}, isbn = {978-1-4244-1483-3}, doi = {10.1109/ICASSP.2008.4518040}, pages = {2037 -- 2040}, language = {en} } @inproceedings{StrechaWolffDuckhornetal., author = {Strecha, Guntram and Wolff, Matthias and Duckhorn, Frank and Wittenberg, S{\"o}ren and Tsch{\"o}pe, Constanze}, title = {The HMM synthesis algorithm of an embedded unified speech recognizer and synthesizer}, series = {Proceedings of the Annual Conference of the International Speech Communication Association 2009, Interspeech 2009, 6 - 10 September, 2009, Brighton, UK}, booktitle = {Proceedings of the Annual Conference of the International Speech Communication Association 2009, Interspeech 2009, 6 - 10 September, 2009, Brighton, UK}, publisher = {ISCA}, address = {Brighton}, pages = {1763 -- 1766}, language = {en} } @misc{PuschCherifFarooqetal., author = {Pusch, T. and Cherif, Chokri and Farooq, Aamir and Wittenberg, S{\"o}ren and Wolff, Matthias and Hoffmann, R{\"u}diger and Tsch{\"o}pe, Constanze}, title = {Fehlerfr{\"u}herkennung an Textilmaschinen mit Hilfe der K{\"o}rperschallanalyse}, series = {Melliand Textilberichte}, volume = {90}, journal = {Melliand Textilberichte}, number = {3}, issn = {0341-0781}, pages = {113 -- 115}, language = {de} } @inproceedings{WolffTschoepe, author = {Wolff, Matthias and Tsch{\"o}pe, Constanze}, title = {Pattern recognition for sensor signals}, series = {Proceedings of the IEEE Sensors Conference 2009, Christchurch, New Zealand, 25 - 28 October 2009}, booktitle = {Proceedings of the IEEE Sensors Conference 2009, Christchurch, New Zealand, 25 - 28 October 2009}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-424-44548-6}, doi = {10.1109/ICSENS.2009.5398338}, pages = {665 -- 668}, language = {en} } @phdthesis{Wolff, author = {Wolff, Matthias}, title = {Akustische Mustererkennung}, publisher = {TUDpress}, address = {Dresden}, isbn = {978-3-942710-14-5}, pages = {XIV, 313}, language = {de} }