14 citations · 43 across the 14 of their papers we have counts for
14 papers
Parsing with CYK over Distributed Representations
Fabio Massimo Zanzotto, Giordano Cristini, Giorgio Satta
Syntactic parsing is a key task in natural language processing. This task has been dominated by symbolic, grammar-based parsers. Neural networks, with their distributed representat…
On the Complexity of CCG Parsing
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). As our main result, we prove that any parsing algorithm f…
An Incremental Parser for Abstract Meaning Representation
Marco Damonte, Shay B. Cohen, Giorgio Satta
Meaning Representation (AMR) is a semantic representation for natural language that embeds annotations related to traditional tasks such as named entity recognition, semantic role…
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino +2
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. In ge…
Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing
Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta
We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (compu…
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing
M. J. Nederhof, G. Satta
We propose a formalism for representation of finite languages, referred to as the class of IDL-expressions, which combines concepts that were only considered in isolation in existi…