Related papers: $q$-Derivative Grammar
We continue our study of ordered context-free grammars, a grammar formalism that places an order on the parse trees produced by the corresponding context-free grammar. In particular, we simplify our previous definition of a derivation of a…
Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, such as context-free…
Closed-book question answering (QA) requires a model to directly answer an open-domain question without access to any external knowledge. Prior work on closed-book QA either directly finetunes or prompts a pretrained language model (LM) to…
Connected the generalized Goncharov polynomials associated to a pair ($\partial,\mathcal{Z}$) if a delta operator $\partial$ and an interpolation grid $\mathcal{Z}$, introduced by Lorentz, Tringali and Yan in [7], with the theory of…
In this paper, we prove the semidecidability of the problem of saying whether or not a context-free grammar generates a regular language. We introduce the notion of context-free grammar in Marciani Normal Form. We prove that a context-free…
The main purpose of this paper is to introduce and investigate a class of generalized Bernoulli polynomials and Euler polynomials based on the generating function. we unify all forms of q-exponential functions by one more parameter. we…
Graph data model and graph databases are very popular in various areas such as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars.…
We construct the generalized version of covariant Z_3-graded differential calculus introduced by one of us (R.K.), and then extended to the case of arbitrary Z_N grading. Here our main purpose is to establish the recurrence formulae for the…
Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state…
This paper describes a pattern to formalise context-free grammars in OWL and its use for sequence classification. The proposed approach is compared to existing methods in terms of computational complexity as well as pragmatic applicability,…
Using the technique developed in approximation theory, we construct examples of exponential families of infinitely divisible laws which can be viewed as deformations of the normal, gamma, and Poisson exponential families. Replacing the…
QDMR is a meaning representation for complex questions, which decomposes questions into a sequence of atomic steps. While state-of-the-art QDMR parsers use the common sequence-to-sequence (seq2seq) approach, a QDMR structure fundamentally…
Answering compositional questions requiring multi-step reasoning is challenging. We introduce an end-to-end differentiable model for interpreting questions about a knowledge graph (KG), which is inspired by formal approaches to semantics.…
Given a unital associatve graded algebra we construct the graded q-differential algebra by means of a graded q-commutator, where q is a primitive N-th root of unity. The N-th power (N>1) of the differential of this graded q-differential…
The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well…
We show that a semi-commutative Galois extension of a unital associative algebra can be endowed with the structure of a graded q-differential algebra. We study the first and higher order noncommutative differential calculus of…
In this paper we first propose a new statistical parsing model, which is a generative model of lexicalised context-free grammar. We then extend the model to include a probabilistic treatment of both subcategorisation and wh-movement.…
The purpose of this paper is to show that Bessel polynomials, double factorials and Catalan triangle can be generated by using context-free grammars.
Existing technology can parse arbitrary context-free grammars, but only a single, static grammar per input. In order to support more powerful syntax-extension systems, we propose reflective grammars, which can modify their own syntax during…
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…