Default Disambiguation for Online Parsers

09/18/2019
by   Lukas Diekmann, et al.
0

Since composed grammars are often ambiguous, grammar composition requires a mechanism for dealing with ambiguity: either ruling it out by using delimiters (which are awkward to work with), or by using disambiguation operators to filter a parse forest down to a single parse tree (where, in general, we cannot be sure that we have covered all possible parse forests). In this paper, we show that default disambiguation, which is inappropriate for batch parsing, works well for online parsing, where it can be overridden by the user if necessary. We extend language boxes – a delimiter-based algorithm atop incremental parsing – in such a way that default disambiguation can automatically insert, remove, or resize, language boxes, leading to the automatic language boxes algorithm. The nature of the problem means that default disambiguation cannot always match a user's intention. However, our experimental evaluation shows that automatic language boxes behave acceptably in 98.8

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2017

A generalized parsing framework for Abstract Grammars

This technical report presents a general framework for parsing a variety...
research
06/01/2023

Zero and Few-shot Semantic Parsing with Ambiguous Inputs

Despite the ubiquity of ambiguity in natural language, it is often ignor...
research
06/04/2020

SMIE: Weakness is Power!: Auto-indentation with incomplete information

Automatic indentation of source code is fundamentally a simple matter of...
research
07/13/2020

Gradient Descent over Metagrammars for Syntax-Guided Synthesis

The performance of a syntax-guided synthesis algorithm is highly depende...
research
03/27/2018

Towards Zero-Overhead Disambiguation of Deep Priority Conflicts

**Context** Context-free grammars are widely used for language prototypi...
research
03/07/2000

Description of GADEL

This article describes the first implementation of the GADEL system : a ...
research
06/08/2021

A Modest Pareto Optimisation Analysis of Dependency Parsers in 2021

We evaluate three leading dependency parser systems from different parad...

Please sign up or login with your details

Forgot password? Click here to reset