Fast semantic parsing with well-typedness guarantees

09/15/2020
by   Matthias Lindemann, et al.
0

AM dependency parsing is a linguistically principled method for neural semantic parsing with high accuracy across multiple graphbanks. It relies on a type system that models semantic valency but makes existing parsers slow. We describe an A* parser and a transition-based parser for AM dependency parsing which guarantee well-typedness and improve the parsing speed to up to 2200 tokens/s, while maintaining or improving accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2018

AMR Dependency Parsing with a Typed Semantic Algebra

We present a semantic parser for Abstract Meaning Representations which ...
research
05/27/2019

Sequential Graph Dependency Parser

We propose a method for non-projective dependency parsing by incremental...
research
08/28/2018

Universal Dependency Parsing with a General Transition-Based DAG Parser

This paper presents our experiments with applying TUPA to the CoNLL 2018...
research
02/22/2017

Improving a Strong Neural Parser with Conjunction-Specific Features

While dependency parsers reach very high overall accuracy, some dependen...
research
04/24/2017

Robust Incremental Neural Semantic Graph Parsing

Parsing sentences to linguistically-expressive semantic representations ...
research
07/20/2015

Notes About a More Aware Dependency Parser

In this paper I explain the reasons that led me to research and conceive...
research
08/20/2018

Question Generation from SQL Queries Improves Neural Semantic Parsing

We study how to learn a semantic parser of state-of-the-art accuracy wit...

Please sign up or login with your details

Forgot password? Click here to reset