<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>32577</id>
    <completedYear/>
    <publishedYear>2023</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>51</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>articlenr</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-01-22</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Minimalist Grammar: Construction without Overgeneration</title>
    <abstract language="eng">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}.</abstract>
    <parentTitle language="eng">arXiv</parentTitle>
    <identifier type="url">https://arxiv.org/abs/2311.01820</identifier>
    <identifier type="doi">10.48550/arXiv.2311.01820</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Publikationsweg">Open Access</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Isidor Konrad</firstName>
      <lastName>Maier</lastName>
    </author>
    <submitter>
      <firstName>Doreen</firstName>
      <lastName>Hobracht</lastName>
    </submitter>
    <author>
      <firstName>Johannes</firstName>
      <lastName>Kuhn</lastName>
    </author>
    <author>
      <firstName>Jesse</firstName>
      <lastName>Beisegel</lastName>
    </author>
    <author>
      <firstName>Markus</firstName>
      <lastName>Huber-Liebl</lastName>
    </author>
    <author>
      <firstName>Matthias</firstName>
      <lastName>Wolff</lastName>
    </author>
    <collection role="institutes" number="1104">FG Kommunikationstechnik</collection>
    <collection role="institutes" number="1307">FG Ingenieurmathematik und Numerik der Optimierung</collection>
  </doc>
  <doc>
    <id>34599</id>
    <completedYear/>
    <publishedYear>2024</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>78</pageFirst>
    <pageLast>85</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_ref</type>
    <publisherName>TUDpress</publisherName>
    <publisherPlace>Dresden</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2024-11-15</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Epsilon-Verarbeitung bei Minimalistischen Grammatiken für Zahlen</title>
    <abstract language="deu">Um bei Minimalistischen Grammatiken (MG) Übergenerierung zu vermeiden, kann man Einträge mit leeren Exponenten (ε-Einträge) verwenden. Ein Eintrag besteht aus einem Exponenten, der die Äußerung oder Schrift eines Wortes repräsentiert, einer Merkmalsliste, welche die Syntax kodiert und einem λ-Ausdruck, der die Semantik repräsentiert. Leere Einträge führen allerdings zu einer schlechteren Verwendbarkeit der Grammatik für das Parsen. Die vorliegende Arbeit wird ein Umformungsalgorithmus für MGs vorstellen, sodass die Anzahl der ε-Einträge verringert werden kann, um sie wieder für Parser verwendbar zu machen. Hierzu werden die ε-Einträge mit den anderen Einträgen vorverarbeitet und dadurch neue Einträge geschaffen. Die nun überflüssigen ε-Einträge können dann problemlos entfernt werden. Der Algorithmus wurde anhand von über 260 Zahlwortgrammatiken getestet.</abstract>
    <parentTitle language="deu">Elektronische Sprachsignalverarbeitung, Tagungsband der 35. Konferenz, 06.-08.03.2024, Regensburg</parentTitle>
    <identifier type="isbn">978-3-95908-325-6</identifier>
    <identifier type="issn">0940-6832</identifier>
    <identifier type="url">https://www.essv.de/pdf/2024_78_85.pdf?id=1208</identifier>
    <enrichment key="UBICOseries">Studientexte zur Sprachkommunikation ; Band 107</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>
      <firstName>Johannes</firstName>
      <lastName>Kuhn</lastName>
    </author>
    <submitter>
      <firstName>Doreen</firstName>
      <lastName>Hobracht</lastName>
    </submitter>
    <author>
      <firstName>Matthias</firstName>
      <lastName>Wolff</lastName>
    </author>
    <author>
      <firstName>Borislav</firstName>
      <lastName>Borislavov</lastName>
    </author>
    <collection role="institutes" number="1104">FG Kommunikationstechnik</collection>
  </doc>
  <doc>
    <id>35645</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst>27</pageFirst>
    <pageLast>34</pageLast>
    <pageNumber>8</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_ref</type>
    <publisherName>TUDpress</publisherName>
    <publisherPlace>Dresden</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2025-04-01</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Wortgenerator für Minimalistische Grammatiken</title>
    <abstract language="deu">Um eine bidirektionale Verarbeitung von Sprache zu realisieren, ist&#13;
es von Vorteil den gleichen Sprachformalismus für das Parsen und die Generierung&#13;
zu verwenden. Für Minimalistische Grammatiken gibt es eine ausgeprägte&#13;
Literatur zu Parsern, aber noch keine Veröffentlichung zu Generatoren. Diese Arbeit&#13;
stellt einen ersten Generator vor, der mittels Minimalistischer Grammatiken&#13;
und λ-Ausdrücken, Sätze erzeugt. Der hier vorgestellte Generator kann entgegen&#13;
manchen anderen Generatoren, von anderen Grammatikformalismen, mit ε-Regeln&#13;
arbeiten.</abstract>
    <parentTitle language="deu">Elektronische Sprachsignalverarbeitung, Tagungsband der 36. Konferenz, 05.-07.03.2025, Halle/Saale</parentTitle>
    <identifier type="isbn">978-3-95908-803-9</identifier>
    <identifier type="issn">0940-6832</identifier>
    <identifier type="url">https://www.essv.de/pdf/2025_27_34.pdf</identifier>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <enrichment key="UBICOseries">Studientexte zur Sprachkommunikation ; Band 110</enrichment>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <author>
      <firstName>Johannes</firstName>
      <lastName>Kuhn</lastName>
    </author>
    <editor>
      <firstName>Sven</firstName>
      <lastName>Grawunder</lastName>
    </editor>
    <submitter>
      <firstName>Doreen</firstName>
      <lastName>Hobracht</lastName>
    </submitter>
    <author>
      <firstName>Matthias</firstName>
      <lastName>Wolff</lastName>
    </author>
    <author>
      <firstName>Isidor Konrad</firstName>
      <lastName>Maier</lastName>
    </author>
    <collection role="institutes" number="1104">FG Kommunikationstechnik</collection>
  </doc>
  <doc>
    <id>30199</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>28</pageFirst>
    <pageLast>35</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject_ref</type>
    <publisherName>European Language Resources Association</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-01-30</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Word Class Based Language Modeling: A Case of Upper Sorbian</title>
    <abstract language="eng">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.</abstract>
    <parentTitle language="eng">Proceedings of The Workshop on Resources and Technologies for Indigenous, Endangered and Lesser-resourced Languages in Eurasia within the 13th Language Resources and Evaluation Conference, Marseille, France</parentTitle>
    <identifier type="isbn">978-2-493814-07-4</identifier>
    <identifier type="url">http://www.lrec-conf.org/proceedings/lrec2022/workshops/EURALI/pdf/2022.eurali-1.5.pdf</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Isidor Konrad</firstName>
      <lastName>Maier</lastName>
    </author>
    <submitter>
      <firstName>Doreen</firstName>
      <lastName>Hobracht</lastName>
    </submitter>
    <author>
      <firstName>Johannes Ferdinand Joachim</firstName>
      <lastName>Kuhn</lastName>
    </author>
    <author>
      <firstName>Frank</firstName>
      <lastName>Duckhorn</lastName>
    </author>
    <author>
      <firstName>Ivan</firstName>
      <lastName>Kraljevski</lastName>
    </author>
    <author>
      <firstName>Daniel</firstName>
      <lastName>Sobe</lastName>
    </author>
    <author>
      <firstName>Matthias</firstName>
      <lastName>Wolff</lastName>
    </author>
    <author>
      <firstName>Constanze</firstName>
      <lastName>Tschöpe</lastName>
    </author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>word classes, minimalist grammar, language modeling, speech recognition, Upper Sorbian</value>
    </subject>
    <collection role="institutes" number="1104">FG Kommunikationstechnik</collection>
    <collection role="institutes" number="1124">FG Kognitive Materialanalytik</collection>
  </doc>
  <doc>
    <id>30156</id>
    <completedYear/>
    <publishedYear>2022</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber>1</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>image</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2023-01-24</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Word Class Based Language Modeling: A Case of Upper Sorbian, LREC 2022, Marseille</title>
    <parentTitle language="deu">Language Resources and Evaluation Conference 2022 (LREC 2022), Marseille, 2022-06-13</parentTitle>
    <identifier type="doi">10.5281/zenodo.7501145</identifier>
    <enrichment key="BTU">an der BTU erstellt / created at BTU</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="Publikationsweg">Open Access</enrichment>
    <enrichment key="Fprofil">4 Künstliche Intelligenz und Sensorik / Artificial Intelligence and Sensor Technology</enrichment>
    <author>
      <firstName>Isidor Konrad</firstName>
      <lastName>Maier</lastName>
    </author>
    <submitter>
      <firstName>Doreen</firstName>
      <lastName>Hobracht</lastName>
    </submitter>
    <author>
      <firstName>Johannes</firstName>
      <lastName>Kuhn</lastName>
    </author>
    <author>
      <firstName>Frank</firstName>
      <lastName>Duckhorn</lastName>
    </author>
    <author>
      <firstName>Ivan</firstName>
      <lastName>Kraljevski</lastName>
    </author>
    <author>
      <firstName>Daniel</firstName>
      <lastName>Sobe</lastName>
    </author>
    <author>
      <firstName>Matthias</firstName>
      <lastName>Wolff</lastName>
    </author>
    <author>
      <firstName>Constanze</firstName>
      <lastName>Tschöpe</lastName>
    </author>
    <collection role="institutes" number="1104">FG Kommunikationstechnik</collection>
    <collection role="institutes" number="1124">FG Kognitive Materialanalytik</collection>
  </doc>
</export-example>
