TY - GEN A1 - Römer, Ronald A1 - beim Graben, Peter A1 - Huber-Liebl, Markus A1 - Wolff, Matthias T1 - (Pre-)linguistic Problem Solving based on Dynamic Semantics T2 - 14th IEEE International Conference on Cognitive Infocommunications – CogInfoCom 2023, September 22-23, Budapest, Hungary Y1 - 2023 SN - 979-8-3503-2565-2 SN - 979-8-3503-2566-9 U6 - https://doi.org/10.1109/CogInfoCom59411.2023.10397487 SN - 2473-5671 SN - 2380-7350 SP - 147 EP - 152 ER - TY - GEN A1 - Maier, Isidor Konrad A1 - Kuhn, Johannes A1 - Beisegel, Jesse A1 - Huber-Liebl, Markus A1 - Wolff, Matthias T1 - Minimalist Grammar: Construction without Overgeneration T2 - arXiv N2 - 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}. Y1 - 2023 UR - https://arxiv.org/abs/2311.01820 U6 - https://doi.org/10.48550/arXiv.2311.01820 ER -