Giorgio Satta

ORCID

Publication Activity (10 Years)

Years Active: 1989-2022
Publications (10 Years): 17

Top Venues

Comput. Linguistics

CoRR

Trans. Assoc. Comput. Linguistics

ACL (1)

Publications

Lena Katharina Schiffer, Marco Kuhlmann, Giorgio Satta
Tractable Parsing for CCGs of Bounded Degree. Comput. Linguistics 48 (3) (2022)
Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. 870 (2021)
Fabio Massimo Zanzotto, Giorgio Satta, Giordano Cristini
CYK Parsing over Distributed Representations. Algorithms 13 (10) (2020)
Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP (2019)
Johanna Björklund, Frank Drewes, Giorgio Satta
Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA (2019)
Daniel Gildea, Giorgio Satta, Xiaochang Peng
Ordered Tree Decomposition for HRG Rule Extraction. Comput. Linguistics 45 (2) (2019)
David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta
Weighted DAG Automata for Semantic Graphs. Comput. Linguistics 44 (1) (2018)
Daniel Gildea, Giorgio Satta, Xiaochang Peng
Cache Transition Systems for Graph Parsing. Comput. Linguistics 44 (1) (2018)
Xiaochang Peng, Daniel Gildea, Giorgio Satta
AMR Parsing With Cache Transition Systems. AAAI (2018)
Xiaochang Peng, Linfeng Song, Daniel Gildea, Giorgio Satta
Sequence-to-sequence Models for Cache Transition Systems. ACL (1) (2018)
Marco Kuhlmann, Giorgio Satta, Peter Jonsson
On the Complexity of CCG Parsing. Comput. Linguistics 44 (3) (2018)
Marco Damonte, Shay B. Cohen, Giorgio Satta
An Incremental Parser for Abstract Meaning Representation. EACL (1) (2017)
Marco Kuhlmann, Giorgio Satta, Peter Jonsson
On the Complexity of CCG Parsing. CoRR (2017)
Marco Damonte, Shay B. Cohen, Giorgio Satta
An Incremental Parser for Abstract Meaning Representation. CoRR (2016)
Daniel Gildea, Giorgio Satta
Synchronous Context-Free Grammars and Optimal Parsing Strategies. Comput. Linguistics 42 (2) (2016)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81 (7) (2015)
Marco Kuhlmann, Alexander Koller, Giorgio Satta
Lexicalization and Generative Power in CCG. Comput. Linguistics 41 (2) (2015)
Yoav Goldberg, Francesco Sartorio, Giorgio Satta
A Tabular Method for Dynamic Oracles in Transition-Based Parsing. Trans. Assoc. Comput. Linguistics 2 (2014)
Marco Kuhlmann, Giorgio Satta
A New Parsing Algorithm for Combinatory Categorial Grammar. Trans. Assoc. Comput. Linguistics 2 (2014)
Carlos Gómez-Rodríguez, Francesco Sartorio, Giorgio Satta
A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing. EMNLP (2014)
Mark-Jan Nederhof, Giorgio Satta
Prefix probabilities for linear context-free rewriting systems. J. Log. Comput. 24 (2) (2014)
Shay B. Cohen, Giorgio Satta, Michael Collins
Approximate PCFG Parsing Using Tensor Decomposition. HLT-NAACL (2013)
Anna Corazza, Alberto Lavelli, Giorgio Satta
An information-theoretic measure to evaluate parsing difficulty across treebanks. ACM Trans. Speech Lang. Process. 9 (4) (2013)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR (2013)
Francesco Sartorio, Giorgio Satta, Joakim Nivre
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy. ACL (1) (2013)
Giorgio Satta, Marco Kuhlmann
Efficient Parsing for Head-Split Dependency Trees. Trans. Assoc. Comput. Linguistics 1 (2013)
Andrea Gesmundo, Giorgio Satta, James Henderson
Heuristic Cube Pruning in Linear Time. ACL (2) (2012)
Marco Kuhlmann, Giorgio Satta
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization. Comput. Linguistics 38 (3) (2012)
Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta
Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing CoRR (2012)
Mark-Jan Nederhof, Giorgio Satta
Splittability of Bilexical Context-Free Grammars is Undecidable. Comput. Linguistics 37 (4) (2011)
Mark-Jan Nederhof, Giorgio Satta
Prefix Probability for Probabilistic Synchronous Context-Free Grammars. ACL (2011)
Marco Kuhlmann, Carlos Gómez-Rodríguez, Giorgio Satta
Dynamic Programming Algorithms for Transition-Based Dependency Parsers. ACL (2011)
Mark-Jan Nederhof, Giorgio Satta
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing CoRR (2011)
Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta
Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing. EMNLP (2011)
Mark-Jan Nederhof, Giorgio Satta
Prefix Probabilities for Linear Context-Free Rewriting Systems. IWPT (2011)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL (2011)
Mark-Jan Nederhof, Giorgio Satta
Computation of Infix Probabilities for Probabilistic Context-Free Grammars. EMNLP (2011)
Benoît Sagot, Giorgio Satta
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL (2010)
Andreas Maletti, Giorgio Satta
Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. ATANLP@ACL 2010 (2010)
Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. HLT-NAACL (2010)
Rebecca Nesson, Giorgio Satta, Stuart M. Shieber
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar. Comput. Linguistics 36 (3) (2010)
Marco Kuhlmann, Alexander Koller, Giorgio Satta
The Importance of Rule Restrictions in CCG. ACL (2010)
Carlos Gómez-Rodríguez, Giorgio Satta
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL/IJCNLP (2009)
Laura Kallmeyer, Wolfgang Maier, Giorgio Satta
Synchronous Rewriting in Treebanks. IWPT (2009)
Laura Kallmeyer, Giorgio Satta
A Polynomial-Time Parsing Algorithm for TT-MCTAG. ACL/IJCNLP (2009)
Andreas Maletti, Giorgio Satta
Parsing Algorithms based on Tree Automata. IWPT (2009)
Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David J. Weir
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. HLT-NAACL (2009)
Alberto Apostolico, Giorgio Satta
Discovering subword associations in strings in time linear in the output size. J. Discrete Algorithms 7 (2) (2009)
Marco Kuhlmann, Giorgio Satta
Treebank Grammar Techniques for Non-Projective Dependency Parsing. EACL (2009)
Rebecca Nesson, Giorgio Satta, Stuart M. Shieber
Optimal $k$-arization of Synchronous Tree-Adjoining Grammar. ACL (2008)
Cristina Bosco, Alessandro Mazzei, Vincenzo Lombardo, Giuseppe Attardi, Anna Corazza, Alberto Lavelli, Leonardo Lesmo, Giorgio Satta, Maria Simi
Comparing Italian parsers on a common Treebank: the EVALITA experience. LREC (2008)
Mark-Jan Nederhof, Giorgio Satta
Computation of distances for regular and context-free probabilistic languages. Theor. Comput. Sci. 395 (2-3) (2008)
Libin Shen, Giorgio Satta, Aravind K. Joshi
Guided Learning for Bidirectional Sequence Classification. ACL (2007)
Ryan T. McDonald, Giorgio Satta
On the Complexity of Non-Projective Data-Driven Dependency Parsing. IWPT (2007)
Anna Corazza, Giorgio Satta
Probabilistic Context-Free Grammars Estimated from Infinite Distributions. IEEE Trans. Pattern Anal. Mach. Intell. 29 (8) (2007)
Anna Corazza, Giorgio Satta
Cross-Entropy and Estimation of Probabilistic Context-Free Grammars. HLT-NAACL (2006)
Daniel Gildea, Giorgio Satta, Hao Zhang
Factoring Synchronous Grammars by Sorting. ACL (2006)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic parsing strategies. J. ACM 53 (3) (2006)
Mark-Jan Nederhof, Giorgio Satta
Estimation of Consistent Probabilistic Context-free Grammars. HLT-NAACL (2006)
Giorgio Satta, Enoch Peserico
Some Computational Complexity Results for Synchronous Context-Free Grammars. HLT/EMNLP (2005)
Mark-Jan Nederhof, Giorgio Satta
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. COLING (2004)
Alberto Apostolico, Cinzia Pizzi, Giorgio Satta
Optimal Discovery of Subword Associations in Strings. Discovery Science (2004)
Mark-Jan Nederhof, Giorgio Satta
An Alternative Method of Training Probabilistic LR Parsers. ACL (2004)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing Strategies. ACL (2004)
Mark-Jan Nederhof, Giorgio Satta
The language intersection problem for non-recursive context-free grammars. Inf. Comput. 192 (2) (2004)
Mark-Jan Nederhof, Giorgio Satta
Tabular Parsing CoRR (2004)
I. Dan Melamed, Giorgio Satta, Benjamin Wellington
Generalized Multitext Grammars. ACL (2004)
Mark-Jan Nederhof, Giorgio Satta
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. J. Artif. Intell. Res. 21 (2004)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing as Intersection. IWPT (2003)
Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta
Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1 (5-6) (2003)
Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber
Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. IWPT (2003)
Mark-Jan Nederhof, Giorgio Satta
Parsing non-recursive CFGs. ACL (2002)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing Strategies CoRR (2002)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing Strategies. DCFS (2002)
Giorgio Satta
Parsing Techniques for Lexicalized Context-Free Grammars. IWPT (2000)
Mark-Jan Nederhof, Giorgio Satta
Left-To-Right Parsing and Bilexical Context-Free Grammars. ANLP (2000)
Jason Eisner, Giorgio Satta
A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars. TAG+ (2000)
Fabio Ciravegna, Alberto Lavelli, Giorgio Satta
Bringing Information Extraction out of the Labs: the NoName Environment. ECAI (2000)
Owen Rambow, Giorgio Satta
Independent Parallelism in Finite Copying Parallel Rewriting Systems. Theor. Comput. Sci. 223 (1-2) (1999)
Jason Eisner, Giorgio Satta
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars. ACL (1999)
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities from Stochastic Tree Adjoining Grammars. COLING-ACL (1998)
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities from Stochastic Tree Adjoining Grammars CoRR (1998)
Giorgio Satta, William Schuler
Restrictions on Tree Adjoining Languages CoRR (1998)
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix probabilities for linear indexed grammars. TAG+ (1998)
Mark-Jan Nederhof, Giorgio Satta
A Variant of Earley Parsing CoRR (1998)
Robert Frank, Giorgio Satta
Optimality Theory and the Generative Complexity of Constraint Violability. Comput. Linguistics 24 (2) (1998)
Giorgio Satta, William Schuler
Restrictions on Tree Adjoining Languages. COLING-ACL (1998)
Giorgio Satta
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. J. Comput. Syst. Sci. 56 (1) (1998)
Mark-Jan Nederhof, Giorgio Satta
A Variant of Earley Parsing. AI*IA (1997)
Giorgio Satta, John C. Henderson
String Transformation Learning. ACL (1997)
Mark-Jan Nederhof, Giorgio Satta
Efficient Tabular LR Parsing. ACL (1996)
Mark-Jan Nederhof, Giorgio Satta
Efficient Tabular LR Parsing CoRR (1996)
Giorgio Satta, Eric Brill
Efficient Transformation-Based Parsing. ACL (1996)
Owen Rambow, Giorgio Satta
Synchronous Models of Language. ACL (1996)
Owen Rambow, Giorgio Satta
Synchronous Models of Language CoRR (1996)
Filomena Ferrucci, Giuliano Pacini, Giorgio Satta, Maria I. Sessa, Genoveffa Tortora, Maurizio Tucci, Giuliana Vitiello
Symbol-Relation Grammars: A Formalism for Graphical Languages. Inf. Comput. 131 (1) (1996)
Giorgio Satta
The Membership Problem for Unordered Vector Languages. Developments in Language Theory (1995)
Mark-Jan Nederhof, Giorgio Satta
An Extended Theory of Head-Driven Parsing. CoRR (1994)
Mark-Jan Nederhof, Giorgio Satta
An Extended Theory of Head-Driven Parsing. ACL (1994)
Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars. IEEE Trans. Pattern Anal. Mach. Intell. 16 (10) (1994)

Giorgio Satta.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Giorgio Satta