Search Results for author:
Found 20 papers, 2 papers with code
Tractable Parsing for CCGs of Bounded Degree
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be parsed in polynomial time when the size of the grammar is taken into account.
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs.
Ordered Tree Decomposition for HRG Rule Extraction
Our algorithms are based on finding a tree decomposition of smallest width, relative to the vertex order, and then extracting one rule for each node in this structure.
Sequence-to-sequence Models for Cache Transition Systems
In this paper, we present a sequence-to-sequence based approach for mapping natural language sentences to AMR semantic graphs.
Cache Transition Systems for Graph Parsing
Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree.
Weighted DAG Automata for Semantic Graphs
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning.
Parsing with CYK over Distributed Representations
By showing that CYK can be entirely performed on distributed representations, we open the way to the definition of recurrent layers of CYK-informed neural networks.
On the Complexity of CCG Parsing
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994).
An Incremental Parser for Abstract Meaning Representation
We describe a transition-based parser for AMR that parses sentences left-to-right, in linear time.
Ranked #5 on
AMR Parsing
on LDC2015E86
A Tabular Method for Dynamic Oracles in Transition-Based Parsing
We develop parsing oracles for two transition-based dependency parsers, including the arc-standard parser, solving a problem that was left open in (Goldberg and Nivre, 2013).
A New Parsing Algorithm for Combinatory Categorial Grammar
We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts.
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form.
Efficient Parsing for Head-Split Dependency Trees
Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model.
