English
Related papers

Related papers: The Algebraic Structure of Morphosyntax

200 papers

The syntactic Merge operation of the Minimalist Program in linguistics can be described mathematically in terms of Hopf algebras, with a formalism similar to the one arising in the physics of renormalization. This mathematical formulation…

Computation and Language · Computer Science 2023-05-30 Matilde Marcolli , Noam Chomsky , Robert Berwick

We give an explicit construction of the generating set of a colored operad that implements theta theory in the mathematical model of Minimalism in generative linguistics, in the form of a coloring algorithm for syntactic objects. We show…

Computation and Language · Computer Science 2025-03-11 Matilde Marcolli , Richard K. Larson

In this paper we present a lexicon-based approach to the problem of morphological processing. Full-form words, lemmas and grammatical tags are interconnected in a DAWG. Thus, the process of analysis/synthesis is reduced to a search in the…

Computation and Language · Computer Science 2007-05-23 Kyriakos N. Sgarbas , Nikos D. Fakotakis , George K. Kokkinakis

We reformulate minimalist grammars as partial functions on term algebras for strings and trees. Using filler/role bindings and tensor product representations, we construct homomorphisms for these data structures into geometric vector…

Computation and Language · Computer Science 2012-07-19 Peter beim Graben , Sabrina Gerth

Syntactic theory has traditionally adopted a constructivist approach, in which a set of atomic elements are manipulated by combinatory operations to yield derived, complex elements. Syntactic structure is thus seen as the result or discrete…

Computation and Language · Computer Science 2019-01-01 Diego Gabriel Krivochen

We extend our formulation of Merge and Minimalism in terms of Hopf algebras to an algebraic model of a syntactic-semantic interface. We show that methods adopted in the formulation of renormalization (extraction of meaningful physical…

Computation and Language · Computer Science 2023-11-13 Matilde Marcolli , Robert C. Berwick , Noam Chomsky

Several tasks in artificial intelligence require to be able to find models about knowledge dynamics. They include belief revision, fusion and belief merging, and abduction. In this paper we exploit the algebraic framework of mathematical…

Artificial Intelligence · Computer Science 2018-02-15 Isabelle Bloch , Jérôme Lang , Ramón Pino Pérez , Carlos Uzcátegui

Morphological segmentation has traditionally been modeled with non-hierarchical models, which yield flat segmentations as output. In many cases, however, proper morphological analysis requires hierarchical structure -- especially in the…

Computation and Language · Computer Science 2021-02-16 Ryan Cotterell , Arun Kumar , Hinrich Schütze

We provide a mathematical argument showing that, given a representation of lexical items as functions (wavelets, for instance) in some function space, it is possible to construct a faithful representation of arbitrary syntactic objects in…

Computation and Language · Computer Science 2026-02-09 Matilde Marcolli , Robert C. Berwick

In the modern language sciences, the core computational operation of syntax, 'Merge', is defined as an operation that combines two linguistic units (e.g., 'brown', 'cat') to form a categorized structure ('brown cat', a Noun Phrase). This…

Computation and Language · Computer Science 2025-08-06 Elliot Murphy , Rohan Venkatesh , Edward Khokhlovich , Andrey Vyshedskiy

Mathematical language in scientific communications and educational scenarios is important yet relatively understudied compared to natural languages. Recent works on mathematical language focus either on representing stand-alone mathematical…

Computation and Language · Computer Science 2023-02-17 Alexander Scarlatos , Andrew Lan

We show that an algebra over a cyclic operad supplied with an additional linear algebra datum called Hodge decomposition admits a minimal model whose structure maps are given in terms of summation over trees. This minimal model is unique up…

Quantum Algebra · Mathematics 2023-09-07 Joseph Chuang , Andrey Lazarev

We show that head functions on syntactic objects extend the magma structure to a hypermagma, with the c-command relation compatible with the magma operation and the m-command relation with the hypermagma. We then show that the structure of…

Computation and Language · Computer Science 2025-07-10 Matilde Marcolli , Riny Huijbregts , Richard K. Larson

The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…

Combinatorics · Mathematics 2017-12-12 Samuele Giraudo

A general definition of mathematical morphology has been defined within the algebraic framework of complete lattice theory. In this framework, dealing with deterministic and increasing operators, a dilation (respectively an erosion) is an…

Category Theory · Mathematics 2020-05-06 Marc Aiguier , Isabelle Bloch , Ramon Pino-Pérez

Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…

Artificial Intelligence · Computer Science 2023-03-10 Marc Aiguier , Isabelle Bloch , Salim Nibouche , Ramon Pino Perez

The study of semantic relationships has revealed a close connection between these relationships and the morphological characteristics of a language. Morphology, as a subfield of linguistics, investigates the internal structure and formation…

Computation and Language · Computer Science 2023-07-14 Mohamed Naamane

Much like sentences are composed of words, words themselves are composed of smaller units. For example, the English word questionably can be analyzed as question+able+ly. However, this structural decomposition of the word does not directly…

Computation and Language · Computer Science 2018-11-13 Ryan Cotterell , Hinrich Schütze

Morpho-syntactic lexicons provide information about the morphological and syntactic roles of words in a language. Such lexicons are not available for all languages and even when available, their coverage can be limited. We present a…

Computation and Language · Computer Science 2016-01-26 Manaal Faruqui , Ryan McDonald , Radu Soricut

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

Formal Languages and Automata Theory · Computer Science 2026-05-12 Shaull Almagor , Michaël Cadilhac , Asaf Shoham
‹ Prev 1 2 3 10 Next ›