Related papers: Mathematical Structure of Syntactic Merge
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…
In recent years, central components of a new approach to linguistics, the Minimalist Program (MP) have come closer to physics. Features of the Minimalist Program, such as the unconstrained nature of recursive Merge, the operation of the…
In this paper we compare some old formulations of Minimalism, in particular Stabler's computational minimalism, and Chomsky's new formulation of Merge and Minimalism, from the point of view of their mathematical description in terms of Hopf…
Within the context of the mathematical formulation of Merge and the Strong Minimalist Thesis, we present a mathematical model of the morphology-syntax interface. In this setting, morphology has compositional properties responsible for word…
Two important generalizations of the Hopf algebra of symmetric functions are the Hopf algebra of noncommutative symmetric functions and its graded dual the Hopf algebra of quasisymmetric functions. A common generalization of the latter is…
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…
Matrix syntax is a formal model of syntactic relations in language. The purpose of this paper is to explain its mathematical foundations, for an audience with some formal background. We make an axiomatic presentation, motivating each axiom…
We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is mapped to…
A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism---to express syntactic theories purely in terms of the properties of…
We briefly review the Hopf algebra structure arising in the renormalization of quantum field theories. We construct the Hopf algebra explicitly for a simple toy model and show how renormalization is achieved for this particular model.
This article aims to give a short introduction into Hopf-algebraic aspects of renormalization, enjoying growing attention for more than a decade by now. As most available literature is concerned with the minimal subtraction scheme, we like…
Hybrid probabilistic logic programs can represent several scenarios thanks to the expressivity of Logic Programming extended with facts representing discrete and continuous distributions. The semantics for this type of programs is crucial…
In these lectures we discuss some of the mathematical structures that appear when computing multi-loop Feynman integrals. We focus on a specific class of special functions, the so-called multiple polylogarithms, and discuss introduce their…
We define graded Hopf algebras with bases labeled by various types of graphs and hypergraphs, provided with natural embeddings into an algebra of polynomials in infinitely many variables. These algebras are graded by the number of edges and…
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…
We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.
In a series of papers the present authors and their coworkers have developed a family of algebraic techniques to solve a number of problems in the theory of discrete or continuous dynamical systems and to analyze numerical integrators.…
The thesis presents an attempt at using the syntactic structure in natural language for improved language models for speech recognition. The structured language model merges techniques in automatic parsing and language modeling using an…
Functors from (co)operads to bialgebras relate Hopf algebras that occur in renormalisation to operads, which simplifies the proof of the Hopf algebra axioms, and induces a characterisation of the corresponding group of characters and Lie…
We introduce a coloured generalization $\mathrm{NSym}_A$ of the Hopf algebra of non-commutative symmetric functions described as a subalgebra of the of rooted ordered coloured trees Hopf algebra. Its natural basis can be identified with the…