A generalized parsing framework for Abstract Grammars

10/31/2017
by   Daniel Harasim, et al.
0

This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of the hierarchy, including Context Free Grammars, Minimalist Grammars, and Generalized Context-free Grammars. We then develop a single parsing framework which is capable of parsing grammars which are at least up to GCFGs on the hierarchy. Our parsing framework exposes a grammar interface, so that it can parse any particular grammar formalism that can be reduced to an Abstract Grammar.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2017

On the Complexity of CCG Parsing

We study the parsing complexity of Combinatory Categorial Grammar (CCG) ...
research
06/29/2009

Restricted Global Grammar Constraints

We investigate the global GRAMMAR constraint over restricted classes of ...
research
04/30/2023

How to enumerate trees from a context-free grammar

I present a simple algorithm for enumerating the trees generated by a Co...
research
09/21/2021

Something Old, Something New: Grammar-based CCG Parsing with Transformer Models

This report describes the parsing problem for Combinatory Categorial Gra...
research
06/01/2019

Abstract Predicate Entailment over Points-To Heaplets is Syntax Recognition

Abstract predicates are considered in this paper as abstraction techniqu...
research
09/18/2019

Default Disambiguation for Online Parsers

Since composed grammars are often ambiguous, grammar composition require...
research
12/18/2022

Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars

We study grammar induction with mildly context-sensitive grammars for un...

Please sign up or login with your details

Forgot password? Click here to reset