SATTA, GIORGIO
SATTA, GIORGIO
Dipartimento di Ingegneria dell'Informazione - DEI
Tractable Parsing for CCGs of Bounded Degree
2022 Katharina Schiffer, Lena; Kuhlmann, Marco; Satta, Giorgio
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
2021 Bjorklund, J.; Cohen, S. B.; Drewes, F.; Satta, G.
Cyk parsing over distributed representations
2020 Zanzotto, F. M.; Satta, G.; Cristini, G.
Ordered Tree Decomposition for HRG Rule Extraction
2019 Gildea, Daniel; Satta, Giorgio; Peng, Xiaochang
Cache Transition Systems for Graph Parsing
2018 Gildea, DANIEL JOSEPH; Satta, Giorgio; Peng, Xiaochang
On the Complexity of CCG Parsing
2018 Kuhlmann, Marco; Satta, Giorgio; Jonsson, Peter
Weighted DAG Automata for Semantic Graphs
2018 David, Chiang; Frank, Drewes; Gildea, DANIEL JOSEPH; Adam, Lopez; Satta, Giorgio
Synchronous Context-Free Grammars and Optimal Parsing Strategies
2016 Gildea, DANIEL JOSEPH; Satta, Giorgio
Lexicalization and Generative Power in CCG
2015 Kuhlmann, Marco; Koller, Alexander; Satta, Giorgio
Synchronous context-free grammars and optimal linear parsing strategies
2015 Crescenzi, Pierluigi; Gildea, Daniel; Marino, Andrea; Rossi, Gianluca; Satta, Giorgio
A New Parsing Algorithm for Combinatory Categorial Grammar
2014 Marco, Kuhlmann; Satta, Giorgio
A Tabular Method for Dynamic Oracles in Transition-Based Parsing
2014 Yoav, Goldberg; Sartorio, Francesco; Satta, Giorgio
Prefix probabilities for linear context-free rewriting systems
2014 M., Nederhof; Satta, Giorgio
An Information Theoretic Measure to Evaluate Parsing Difficulty Across Treebanks
2013 A., Corazza; A., Lavelli; Satta, Giorgio
Efficient Parsing for Head-Split Dependency Trees
2013 Satta, Giorgio; M., Kuhlmann
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
2012 M., Kuhlmann; Satta, Giorgio
Splittability of Bilexical Context-Free Grammars is Undecidable
2011 M. J., Nederhof; Satta, Giorgio
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammars
2010 Nesson, R; Satta, Giorgio; Shieber, S.
Discovering subword associations in strings in time linear in the output size.
2009 Apostolico, Alberto; Satta, Giorgio
Computation of Distances for Regular and Context-Free Probabilistic Languages
2008 Nederhof, M. J.; Satta, Giorgio