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.
no code implementations • WS 2019 • Johanna Bj{\"o}rklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs.
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.
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.
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.
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.
no code implementations • 24 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.
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).
4 code implementations • EACL 2017 • Marco Damonte, Shay B. Cohen, Giorgio Satta
We describe a transition-based parser for AMR that parses sentences left-to-right, in linear time.
Ranked #5 on AMR Parsing on LDC2015E86
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).
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.
no code implementations • 25 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.
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.