Giorgio Satta
34 papers · 2000–2026 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
๐ Interdisciplinary Bridge ๐งญ Keyword Pioneer ๐ฃ Hot Topic Early Bird ๐ Cross-Pollinator (14) ๐ Academic Marathon (18)
๐
Conference Polyglot
(6)
๐ฅ
Unstoppable
(11)
๐
Conference Pioneer
๐
Century Club
(33)
โก
Prolific Year
(5)
Conferences
ACL (17)
NAACL (6)
EMNLP (4)
EACL (3)
COLING (2)
IJCNLP (2)
Top co-authors
Keywords
abstract meaning representation
(2)
named entity recognition
(1)
semantic parsing
(1)
semantic analysis
(1)
semantic role labeling
(1)
persuasion detection
(1)
transition system
(1)
sequence-to-sequence model
(1)
amr parsing
(1)
neural parser
(1)
semantic graph
(1)
transition-based parser
(1)
graph parsing
(1)
co-reference resolution
(1)
argument quality
(1)
text classification
(1)
persuasion strategies
(1)
Papers
Detecting Winning Arguments with Large Language Models and Persuasion Strategies
EACL 2026
Sequence-to-sequence Models for Cache Transition Systems
ACL 2018
An Incremental Parser for Abstract Meaning Representation
EACL 2017
A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing
EMNLP 2014
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy
ACL 2013
Approximate PCFG Parsing Using Tensor Decomposition
NAACL 2013
Heuristic Cube Pruning in Linear Time
ACL 2012
Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing
EMNLP 2011
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
ACL 2011
Prefix Probability for Probabilistic Synchronous Context-Free Grammars
ACL 2011
Dynamic Programming Algorithms for Transition-Based Dependency Parsers
ACL 2011
Computation of Infix Probabilities for Probabilistic Context-Free Grammars
EMNLP 2011
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
NAACL 2010
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
ACL 2010
The Importance of Rule Restrictions in CCG
ACL 2010
A Polynomial-Time Parsing Algorithm for TT-MCTAG
ACL 2009
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two
IJCNLP 2009
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two
ACL 2009
A Polynomial-Time Parsing Algorithm for TT-MCTAG
IJCNLP 2009
Treebank Grammar Techniques for Non-Projective Dependency Parsing
EACL 2009
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
NAACL 2009
Optimal k-arization of Synchronous Tree-Adjoining Grammar
ACL 2008
Guided Learning for Bidirectional Sequence Classification
ACL 2007
Estimation of Consistent Probabilistic Context-free Grammars
NAACL 2006
Cross-Entropy and Estimation of Probabilistic Context-Free Grammars
NAACL 2006
Factoring Synchronous Grammars by Sorting
ACL 2006
Factoring Synchronous Grammars by Sorting
COLING 2006
Some Computational Complexity Results for Synchronous Context-Free Grammars
EMNLP 2005
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata
COLING 2004
Probabilistic Parsing Strategies
ACL 2004
An Alternative Method of Training Probabilistic LR Parsers
ACL 2004
Generalized Multitext Grammars
ACL 2004
Parsing non-recursive CFGs
ACL 2002
Left-To-Right Parsing and Bilexical Context-Free Grammars
NAACL 2000