Skip to content

Giorgio Satta

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

52

Venues

12

Active years

1989–2026

Best venue rank

A*

Where they publish

Papers

52 indexed papers, newest first.

YearVenueTitleAuthors
2026EACLDetecting Winning Arguments with Large Language Models and Persuasion Strategies.Tiziano Labruna, Arkadiusz Modzelewski, Giorgio Satta, Giovanni Da San Martino
2018AAAIAMR Parsing With Cache Transition Systems.Xiaochang Peng, Daniel Gildea, Giorgio Satta
2018ACLSequence-to-sequence Models for Cache Transition Systems.Xiaochang Peng, Linfeng Song, Daniel Gildea, Giorgio Satta
2017EACLAn Incremental Parser for Abstract Meaning Representation.Marco Damonte, Shay B. Cohen, Giorgio Satta
2014EMNLPA Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing.Carlos Gmez-Rodrguez, Francesco Sartorio, Giorgio Satta
2013ACLA Transition-Based Dependency Parser Using a Dynamic Parsing Strategy.Francesco Sartorio, Giorgio Satta, Joakim Nivre
2013NAACLApproximate PCFG Parsing Using Tensor Decomposition.Shay B. Cohen, Giorgio Satta, Michael Collins
2012ACLHeuristic Cube Pruning in Linear Time.Andrea Gesmundo, Giorgio Satta, James Henderson
2011ACLOptimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2011ACLDynamic Programming Algorithms for Transition-Based Dependency Parsers.Marco Kuhlmann, Carlos Gmez-Rodrguez, Giorgio Satta
2011ACLPrefix Probability for Probabilistic Synchronous Context-Free Grammars.Mark-Jan Nederhof, Giorgio Satta
2011EMNLPExact Inference for Generative Probabilistic Non-Projective Dependency Parsing.Shay B. Cohen, Carlos Gmez-Rodrguez, Giorgio Satta
2011EMNLPComputation of Infix Probabilities for Probabilistic Context-Free Grammars.Mark-Jan Nederhof, Giorgio Satta
2010ACLThe Importance of Rule Restrictions in CCG.Marco Kuhlmann, Alexander Koller, Giorgio Satta
2010ACLParsing and Translation Algorithms Based on Weighted Extended Tree Transducers.Andreas Maletti, Giorgio Satta
2010ACLOptimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two.Benot Sagot, Giorgio Satta
2010NAACLEfficient Parsing of Well-Nested Linear Context-Free Rewriting Systems.Carlos Gmez-Rodrguez, Marco Kuhlmann, Giorgio Satta
2009ACLAn Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two.Carlos Gmez-Rodrguez, Giorgio Satta
2009ACLA Polynomial-Time Parsing Algorithm for TT-MCTAG.Laura Kallmeyer, Giorgio Satta
2009EACLTreebank Grammar Techniques for Non-Projective Dependency Parsing.Marco Kuhlmann, Giorgio Satta
2009NAACLOptimal Reduction of Rule Length in Linear Context-Free Rewriting Systems.Carlos Gmez-Rodrguez, Marco Kuhlmann, Giorgio Satta, David J. Weir
2008ACLOptimalRebecca Nesson, Giorgio Satta, Stuart M. Shieber
2008LRECComparing Italian parsers on a common Treebank: the EVALITA experience.Cristina Bosco, Alessandro Mazzei, Vincenzo Lombardo, Giuseppe Attardi, Anna Corazza, Alberto Lavelli, Leonardo Lesmo, Giorgio Satta, Maria Simi
2007ACLGuided Learning for Bidirectional Sequence Classification.Libin Shen, Giorgio Satta, Aravind K. Joshi
2006ACLFactoring Synchronous Grammars by Sorting.Daniel Gildea, Giorgio Satta, Hao Zhang
2006NAACLCross-Entropy and Estimation of Probabilistic Context-Free Grammars.Anna Corazza, Giorgio Satta
2006NAACLEstimation of Consistent Probabilistic Context-free Grammars.Mark-Jan Nederhof, Giorgio Satta
2005NAACLSome Computational Complexity Results for Synchronous Context-Free Grammars.Giorgio Satta, Enoch Peserico
2004ACLGeneralized Multitext Grammars.I. Dan Melamed, Giorgio Satta, Benjamin Wellington
2004ACLProbabilistic Parsing Strategies.Mark-Jan Nederhof, Giorgio Satta
2004ACLAn Alternative Method of Training Probabilistic LR Parsers.Mark-Jan Nederhof, Giorgio Satta
2004COLINGKullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata.Mark-Jan Nederhof, Giorgio Satta
2004DISOptimal Discovery of Subword Associations in Strings.Alberto Apostolico, Cinzia Pizzi, Giorgio Satta
2002ACLParsing non-recursive CFGs.Mark-Jan Nederhof, Giorgio Satta
2000ECAIBringing Information Extraction out of the Labs: the NoName Environment.Fabio Ciravegna, Alberto Lavelli, Giorgio Satta
1999ACLEfficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars.Jason Eisner, Giorgio Satta
1998ACLPrefix Probabilities from Stochastic Tree Adjoining Grammars.Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
1998ACLRestrictions on Tree Adjoining Languages.Giorgio Satta, William Schuler
1997ACLString Transformation Learning.Giorgio Satta, John C. Henderson
1996ACLEfficient Tabular LR Parsing.Mark-Jan Nederhof, Giorgio Satta
1996ACLSynchronous Models of Language.Owen Rambow, Giorgio Satta
1996ACLEfficient Transformation-Based Parsing.Giorgio Satta, Eric Brill
1995DLTThe Membership Problem for Unordered Vector Languages.Giorgio Satta
1994ACLAn Extended Theory of Head-Driven Parsing.Mark-Jan Nederhof, Giorgio Satta
1992AAAIComputation of Upper-Bounds for Stochastic Context-Free Languages.Anna Corazza, Renato de Mori, Giorgio Satta
1992ACLRecognition of Linear Context-Free Rewriting Systems.Giorgio Satta
1991AAAIA Tabular Method for Island-Driven Context-Free Grammar Parsing.Giorgio Satta, Oliviero Stock
1991EACLBidirectional Parsing Of Lexicalized Tree Adjoining Grammars.Alberto Lavelli, Giorgio Satta
1991InterspeechComputation of upper-bounds for island-driven stochastic parsers.Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta
1990COLINGA Computational Approach to Binding Theory.Alessandra Giorgi, Fabio Pianesi, Giorgio Satta
1990InterspeechComputation of probabilities for island-driven parsers.A. Corazzat, Renato de Mori, Roberto Gretter, Giorgio Satta
1989IJCAIFormal Properties and Implementation of Bidirectional Charts.Giorgio Satta, Oliviero Stock