Related papers: Capturing CFLs with Tree Adjoining Grammars
In this paper, we consider partially commutative metabelian Lie algebras whose defining graphs are cycles. We show that such algebras are universally equivalent iff the corresponding cycles have the same length. Moreover, we give an example…
Directed acyclic graphical models (DAGs) are often used to describe common structural properties in a family of probability distributions. This paper addresses the question of classifying DAGs up to an isomorphism. By considering Gaussian…
An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distributive and A is dualizable, then A has an NU term. An…
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…
We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs.
In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…
This paper proposes a novel algorithm which learns a formal regular grammar from real-world continuous data, such as videos. Learning latent terminals, non-terminals, and production rules directly from continuous data allows the…
This report describes the parsing problem for Combinatory Categorial Grammar (CCG), showing how a combination of Transformer-based neural models and a symbolic CCG grammar can lead to substantial gains over existing approaches. The report…
Representing time is crucial for cyber-physical systems and has been studied extensively in the Situation Calculus. The most commonly used approach represents time by adding a real-valued fluent $\mathit{time}(a)$ that attaches a time point…
This paper builds on previous work using Combinatory Categorial Grammar (CCG) to derive a transparent syntax-semantics interface for Abstract Meaning Representation (AMR) parsing. We define new semantics for the CCG combinators that is…
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell 96]. This paper clarifies the mathematical foundations of these…
In this paper we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining grammars. For a LIG $L$ and an input string $x$ of length $n$,…
Formal languages let us define the textual representation of data with precision. Formal grammars, typically in the form of BNF-like productions, describe the language syntax, which is then annotated for syntax-directed translation and…
We introduce a novel dependency parser, the hexatagger, that constructs dependency trees by tagging the words in a sentence with elements from a finite set of possible tags. In contrast to many approaches to dependency parsing, our approach…
Let $k$ be a field. We characterize the group schemes $G$ over $k$, not necessarily affine, such that $\mathsf{D}_{\mathrm{qc}}(B_kG)$ is compactly generated. We also describe the algebraic stacks that have finite cohomological dimension in…
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…
A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is…
Several old and recent classes of picture grammars, that variously extend context-free string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such grammars can be unified and extended using a tiling based…
Given a braided pivotal category $\mathcal C$ and a pivotal module tensor category $\mathcal M$, we define a functor $\mathrm{Tr}_{\mathcal C}:\mathcal M \to \mathcal C$, called the associated categorified trace. By a result of…
An exoflop takes a gauged Landau-Ginzburg (LG) model, partially compactifies it, and then performs certain birational transformations on it. When certain criteria hold, this can provide a crepant categorical resolution or equivalence of…