Giorgio Satta - RankMe

121 papers A* 26A 3B 4C 2Journal 48Unranked 33

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Detecting Winning Arguments with Large Language Models and Persuasion Strategies. EACL (Findings) Tiziano Labruna, Arkadiusz Modzelewski, Giorgio Satta, Giovanni Da San Martino
2026	J	`jnl`	Detecting Winning Arguments with Large Language Models and Persuasion Strategies. CoRR Tiziano Labruna, Arkadiusz Modzelewski, Giorgio Satta, Giovanni Da San Martino
2022	J	`jnl`	Tractable Parsing for CCGs of Bounded Degree. Comput. Linguistics Lena Katharina Schiffer, Marco Kuhlmann, Giorgio Satta
2021	J	`jnl`	Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
2021	—	`ch.`	Natural language parsing. Handbook of Automata Theory (II.) Mark-Jan Nederhof, Giorgio Satta
2020	J	`jnl`	CYK Parsing over Distributed Representations. Algorithms Fabio Massimo Zanzotto, Giorgio Satta, Giordano Cristini
2019	—	`conf`	Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
2019	J	`jnl`	Ordered Tree Decomposition for HRG Rule Extraction. Comput. Linguistics Daniel Gildea, Giorgio Satta, Xiaochang Peng
2019	C	`conf`	Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA Johanna Björklund, Frank Drewes, Giorgio Satta
2018	A*	`conf`	AMR Parsing With Cache Transition Systems. AAAI Xiaochang Peng, Daniel Gildea, Giorgio Satta
2018	J	`jnl`	Cache Transition Systems for Graph Parsing. Comput. Linguistics Daniel Gildea, Giorgio Satta, Xiaochang Peng
2018	J	`jnl`	On the Complexity of CCG Parsing. Comput. Linguistics Marco Kuhlmann, Giorgio Satta, Peter Jonsson
2018	—	`conf`	Sequence-to-sequence Models for Cache Transition Systems. ACL (1) Xiaochang Peng, Linfeng Song, Daniel Gildea, Giorgio Satta
2018	J	`jnl`	Weighted DAG Automata for Semantic Graphs. Comput. Linguistics David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta
2017	—	`conf`	An Incremental Parser for Abstract Meaning Representation. EACL (1) Marco Damonte, Shay B. Cohen, Giorgio Satta
2017	J	`jnl`	On the Complexity of CCG Parsing. CoRR Marco Kuhlmann, Giorgio Satta, Peter Jonsson
2017	—	`ed.`	Proceedings of the Fourth Italian Conference on Computational Linguistics (CLiC-it 2017), Rome, Italy, December 11-13, 2017. CLiC-it Roberto Basili, Malvina Nissim, Giorgio Satta
2016	J	`jnl`	An Incremental Parser for Abstract Meaning Representation. CoRR Marco Damonte, Shay B. Cohen, Giorgio Satta
2016	J	`jnl`	Synchronous Context-Free Grammars and Optimal Parsing Strategies. Comput. Linguistics Daniel Gildea, Giorgio Satta
2015	J	`jnl`	Lexicalization and Generative Power in CCG. Comput. Linguistics Marco Kuhlmann, Alexander Koller, Giorgio Satta
2015	J	`jnl`	Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2014	J	`jnl`	A New Parsing Algorithm for Combinatory Categorial Grammar. Trans. Assoc. Comput. Linguistics Marco Kuhlmann, Giorgio Satta
2014	A*	`conf`	A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing. EMNLP Carlos Gómez-Rodríguez, Francesco Sartorio, Giorgio Satta
2014	J	`jnl`	A Tabular Method for Dynamic Oracles in Transition-Based Parsing. Trans. Assoc. Comput. Linguistics Yoav Goldberg, Francesco Sartorio, Giorgio Satta
2014	J	`jnl`	Prefix probabilities for linear context-free rewriting systems. J. Log. Comput. Mark-Jan Nederhof, Giorgio Satta
2013	—	`conf`	A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy. ACL (1) Francesco Sartorio, Giorgio Satta, Joakim Nivre
2013	J	`jnl`	An information-theoretic measure to evaluate parsing difficulty across treebanks. ACM Trans. Speech Lang. Process. Anna Corazza, Alberto Lavelli, Giorgio Satta
2013	—	`conf`	Approximate PCFG Parsing Using Tensor Decomposition. HLT-NAACL Shay B. Cohen, Giorgio Satta, Michael Collins
2013	J	`jnl`	Efficient Parsing for Head-Split Dependency Trees. Trans. Assoc. Comput. Linguistics Giorgio Satta, Marco Kuhlmann
2013	J	`jnl`	Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2012	J	`jnl`	Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing CoRR Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta
2012	—	`conf`	Heuristic Cube Pruning in Linear Time. ACL (2) Andrea Gesmundo, Giorgio Satta, James Henderson
2012	—	`ed.`	Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, TAG+ 2012, Paris, France, September 26-28, 2012 TAG Giorgio Satta, Chung-hye Han
2012	J	`jnl`	Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization. Comput. Linguistics Marco Kuhlmann, Giorgio Satta
2011	A*	`conf`	Computation of Infix Probabilities for Probabilistic Context-Free Grammars. EMNLP Mark-Jan Nederhof, Giorgio Satta
2011	A*	`conf`	Dynamic Programming Algorithms for Transition-Based Dependency Parsers. ACL Marco Kuhlmann, Carlos Gómez-Rodríguez, Giorgio Satta
2011	A*	`conf`	Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing. EMNLP Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta
2011	J	`jnl`	IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing CoRR Mark-Jan Nederhof, Giorgio Satta
2011	A*	`conf`	Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2011	—	`conf`	Prefix Probabilities for Linear Context-Free Rewriting Systems. IWPT Mark-Jan Nederhof, Giorgio Satta
2011	A*	`conf`	Prefix Probability for Probabilistic Synchronous Context-Free Grammars. ACL Mark-Jan Nederhof, Giorgio Satta
2011	J	`jnl`	Splittability of Bilexical Context-Free Grammars is Undecidable. Comput. Linguistics Mark-Jan Nederhof, Giorgio Satta
2010	J	`jnl`	Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar. Comput. Linguistics Rebecca Nesson, Giorgio Satta, Stuart M. Shieber
2010	—	`conf`	Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. HLT-NAACL Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta
2010	A*	`conf`	Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL Benoît Sagot, Giorgio Satta
2010	—	`conf`	Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. ATANLP@ACL 2010 Andreas Maletti, Giorgio Satta
2010	A*	`conf`	The Importance of Rule Restrictions in CCG. ACL Marco Kuhlmann, Alexander Koller, Giorgio Satta
2009	—	`conf`	A Polynomial-Time Parsing Algorithm for TT-MCTAG. ACL/IJCNLP Laura Kallmeyer, Giorgio Satta
2009	—	`conf`	An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL/IJCNLP Carlos Gómez-Rodríguez, Giorgio Satta
2009	J	`jnl`	Discovering subword associations in strings in time linear in the output size. J. Discrete Algorithms Alberto Apostolico, Giorgio Satta
2009	—	`conf`	Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. HLT-NAACL Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David J. Weir
2009	—	`conf`	Parsing Algorithms based on Tree Automata. IWPT Andreas Maletti, Giorgio Satta
2009	—	`conf`	Synchronous Rewriting in Treebanks. IWPT Laura Kallmeyer, Wolfgang Maier, Giorgio Satta
2009	A	`conf`	Treebank Grammar Techniques for Non-Projective Dependency Parsing. EACL Marco Kuhlmann, Giorgio Satta
2008	B	`conf`	Comparing Italian parsers on a common Treebank: the EVALITA experience. LREC Cristina Bosco, Alessandro Mazzei, Vincenzo Lombardo, Giuseppe Attardi, Anna Corazza, Alberto Lavelli, Leonardo Lesmo, Giorgio Satta, Maria Simi
2008	J	`jnl`	Computation of distances for regular and context-free probabilistic languages. Theor. Comput. Sci. Mark-Jan Nederhof, Giorgio Satta
2008	A*	`conf`	Optimal ACL Rebecca Nesson, Giorgio Satta, Stuart M. Shieber
2008	—	`ch.`	Probabilistic Parsing. New Developments in Formal Languages and Applications Mark-Jan Nederhof, Giorgio Satta
2007	A*	`conf`	Guided Learning for Bidirectional Sequence Classification. ACL Libin Shen, Giorgio Satta, Aravind K. Joshi
2007	—	`conf`	On the Complexity of Non-Projective Data-Driven Dependency Parsing. IWPT Ryan T. McDonald, Giorgio Satta
2007	J	`jnl`	Probabilistic Context-Free Grammars Estimated from Infinite Distributions. IEEE Trans. Pattern Anal. Mach. Intell. Anna Corazza, Giorgio Satta
2006	—	`conf`	Cross-Entropy and Estimation of Probabilistic Context-Free Grammars. HLT-NAACL Anna Corazza, Giorgio Satta
2006	—	`conf`	Estimation of Consistent Probabilistic Context-free Grammars. HLT-NAACL Mark-Jan Nederhof, Giorgio Satta
2006	A*	`conf`	Factoring Synchronous Grammars by Sorting. ACL Daniel Gildea, Giorgio Satta, Hao Zhang
2006	J	`jnl`	Probabilistic parsing strategies. J. ACM Mark-Jan Nederhof, Giorgio Satta
2005	—	`conf`	Some Computational Complexity Results for Synchronous Context-Free Grammars. HLT/EMNLP Giorgio Satta, Enoch Peserico
2004	A*	`conf`	An Alternative Method of Training Probabilistic LR Parsers. ACL Mark-Jan Nederhof, Giorgio Satta
2004	A*	`conf`	Generalized Multitext Grammars. ACL I. Dan Melamed, Giorgio Satta, Benjamin Wellington
2004	J	`jnl`	IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. J. Artif. Intell. Res. Mark-Jan Nederhof, Giorgio Satta
2004	B	`conf`	Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. COLING Mark-Jan Nederhof, Giorgio Satta
2004	B	`conf`	Optimal Discovery of Subword Associations in Strings. Discovery Science Alberto Apostolico, Cinzia Pizzi, Giorgio Satta
2004	A*	`conf`	Probabilistic Parsing Strategies. ACL Mark-Jan Nederhof, Giorgio Satta
2004	J	`jnl`	Tabular Parsing CoRR Mark-Jan Nederhof, Giorgio Satta
2004	J	`jnl`	The language intersection problem for non-recursive context-free grammars. Inf. Comput. Mark-Jan Nederhof, Giorgio Satta
2003	J	`jnl`	Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta
2003	—	`conf`	Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. IWPT Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber
2003	—	`conf`	Probabilistic Parsing as Intersection. IWPT Mark-Jan Nederhof, Giorgio Satta
2002	A*	`conf`	Parsing non-recursive CFGs. ACL Mark-Jan Nederhof, Giorgio Satta
2002	J	`jnl`	Probabilistic Parsing Strategies CoRR Mark-Jan Nederhof, Giorgio Satta
2002	—	`conf`	Probabilistic Parsing Strategies. DCFS Mark-Jan Nederhof, Giorgio Satta
2000	—	`conf`	A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars. TAG+ Jason Eisner, Giorgio Satta
2000	A	`conf`	Bringing Information Extraction out of the Labs: the NoName Environment. ECAI Fabio Ciravegna, Alberto Lavelli, Giorgio Satta
2000	—	`conf`	Left-To-Right Parsing and Bilexical Context-Free Grammars. ANLP Mark-Jan Nederhof, Giorgio Satta
2000	—	`conf`	Parsing Techniques for Lexicalized Context-Free Grammars. IWPT Giorgio Satta
1999	A*	`conf`	Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars. ACL Jason Eisner, Giorgio Satta
1999	J	`jnl`	Independent Parallelism in Finite Copying Parallel Rewriting Systems. Theor. Comput. Sci. Owen Rambow, Giorgio Satta
1998	J	`jnl`	A Variant of Earley Parsing CoRR Mark-Jan Nederhof, Giorgio Satta
1998	J	`jnl`	Optimality Theory and the Generative Complexity of Constraint Violability. Comput. Linguistics Robert Frank, Giorgio Satta
1998	J	`jnl`	Prefix Probabilities from Stochastic Tree Adjoining Grammars CoRR Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
1998	—	`conf`	Prefix Probabilities from Stochastic Tree Adjoining Grammars. COLING-ACL Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
1998	—	`conf`	Prefix probabilities for linear indexed grammars. TAG+ Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
1998	—	`ed.`	Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, TAG+ 1998, University of Pennsylvania, USA, August 1998 TAG+ Anne Abeillé, Tilman Becker, Giorgio Satta, K. Vijay-Shanker
1998	J	`jnl`	Restrictions on Tree Adjoining Languages CoRR Giorgio Satta, William Schuler
1998	—	`conf`	Restrictions on Tree Adjoining Languages. COLING-ACL Giorgio Satta, William Schuler
1998	J	`jnl`	Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. J. Comput. Syst. Sci. Giorgio Satta
1997	—	`conf`	A Variant of Earley Parsing. AI*IA Mark-Jan Nederhof, Giorgio Satta
1997	A*	`conf`	String Transformation Learning. ACL Giorgio Satta, John C. Henderson
1996	J	`jnl`	Efficient Tabular LR Parsing CoRR Mark-Jan Nederhof, Giorgio Satta
1996	A*	`conf`	Efficient Tabular LR Parsing. ACL Mark-Jan Nederhof, Giorgio Satta
1996	A*	`conf`	Efficient Transformation-Based Parsing. ACL Giorgio Satta, Eric Brill
1996	J	`jnl`	Symbol-Relation Grammars: A Formalism for Graphical Languages. Inf. Comput. Filomena Ferrucci, Giuliano Pacini, Giorgio Satta, Maria I. Sessa, Genoveffa Tortora, Maurizio Tucci, Giuliana Vitiello
1996	J	`jnl`	Synchronous Models of Language CoRR Owen Rambow, Giorgio Satta
1996	A*	`conf`	Synchronous Models of Language. ACL Owen Rambow, Giorgio Satta
1995	C	`conf`	The Membership Problem for Unordered Vector Languages. Developments in Language Theory Giorgio Satta
1994	—	`conf`	A Rank Hierarchy for Determinsitic Tree-Walking Transducers. CAAP Owen Rambow, Giorgio Satta
1994	A*	`conf`	An Extended Theory of Head-Driven Parsing. ACL Mark-Jan Nederhof, Giorgio Satta
1994	J	`jnl`	An Extended Theory of Head-Driven Parsing. CoRR Mark-Jan Nederhof, Giorgio Satta
1994	J	`jnl`	Bidirectional Context-Free Grammar Parsing for Natural Language Processing. Artif. Intell. Giorgio Satta, Oliviero Stock
1994	J	`jnl`	Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars. IEEE Trans. Pattern Anal. Mach. Intell. Anna Corazza, Renato De Mori, Roberto Gretter, Giorgio Satta
1994	J	`jnl`	Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication. Comput. Linguistics Giorgio Satta
1993	J	`jnl`	Language modeling using stochastic context-free grammars. Speech Commun. Anna Corazza, Renato De Mori, Roberto Gretter, Giorgio Satta
1992	A*	`conf`	Computation of Upper-Bounds for Stochastic Context-Free Languages. AAAI Anna Corazza, Renato De Mori, Giorgio Satta
1992	A*	`conf`	Recognition of Linear Context-Free Rewriting Systems. ACL Giorgio Satta
1991	A*	`conf`	A Tabular Method for Island-Driven Context-Free Grammar Parsing. AAAI Giorgio Satta, Oliviero Stock
1991	A	`conf`	Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars. EACL Alberto Lavelli, Giorgio Satta
1991	J	`jnl`	Computation of Probabilities for an Island-Driven Parser. IEEE Trans. Pattern Anal. Mach. Intell. Anna Corazza, Renato De Mori, Roberto Gretter, Giorgio Satta
1991	—	`conf`	Computation of upper-bounds for island-driven stochastic parsers. EUROSPEECH Anna Corazza, Renato De Mori, Roberto Gretter, Giorgio Satta
1990	B	`conf`	A Computational Approach to Binding Theory. COLING Alessandra Giorgi, Fabio Pianesi, Giorgio Satta
1990	—	`conf`	Computation of probabilities for island-driven parsers. ICSLP A. Corazzat, Renato De Mori, Roberto Gretter, Giorgio Satta
1989	A*	`conf`	Formal Properties and Implementation of Bidirectional Charts. IJCAI Giorgio Satta, Oliviero Stock
1989	—	`conf`	Head-Driven Bidirectional Parsing: A Tabular Method. IWPT Giorgio Satta, Oliviero Stock