Search Results for author: Giorgio Satta

Found 20 papers, 2 papers with code

Tractable Parsing for CCGs of Bounded Degree

no code implementations CL (ACL) 2022 Lena Katharina Schiffer, Marco Kuhlmann, Giorgio Satta

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.

Ordered Tree Decomposition for HRG Rule Extraction

no code implementations CL 2019 Daniel Gildea, Giorgio Satta, Xiaochang Peng

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.

Tree Decomposition

Sequence-to-sequence Models for Cache Transition Systems

1 code implementation ACL 2018 Xiaochang Peng, Linfeng Song, Daniel Gildea, Giorgio Satta

In this paper, we present a sequence-to-sequence based approach for mapping natural language sentences to AMR semantic graphs.

AMR Parsing Decoder +2

Weighted DAG Automata for Semantic Graphs

no code implementations CL 2018 David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta

Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning.

Cache Transition Systems for Graph Parsing

no code implementations CL 2018 Daniel Gildea, Giorgio Satta, Xiaochang Peng

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.

Semantic Parsing Transition-Based Dependency Parsing +1

Parsing with CYK over Distributed Representations

no code implementations24 May 2017 Fabio Massimo Zanzotto, Giordano Cristini, Giorgio Satta

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

no code implementations CL 2018 Marco Kuhlmann, Giorgio Satta, Peter Jonsson

We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994).

Sentence TAG

A Tabular Method for Dynamic Oracles in Transition-Based Parsing

no code implementations TACL 2014 Yoav Goldberg, Francesco Sartorio, Giorgio Satta

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

no code implementations TACL 2014 Marco Kuhlmann, Giorgio Satta

We present a polynomial-time parsing algorithm for CCG, based on a new decomposition of derivations into small, shareable parts.

Machine Translation

Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies

no code implementations25 Nov 2013 Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta

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

no code implementations TACL 2013 Giorgio Satta, Marco Kuhlmann

Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model.

Dependency Parsing

Cannot find the paper you are looking for? You can Submit a new open access paper.