Formal Properties and Implementation of Bidirectional Charts. - Giorgio Satta; Oliviero Stock (IJCAI, 1989)

Head-Driven Bidirectional Parsing: A Tabular Method. - Giorgio Satta; Oliviero Stock (IWPT, 1989)

A Computational Approach to Binding Theory. - Alessandra Giorgi; Fabio Pianesi; Giorgio Satta (COLING, 1990)

Computation of probabilities for island-driven parsers. - A. Corazzat; Renato de Mori; Roberto Gretter; Giorgio Satta (ICSLP, 1990)

A Tabular Method for Island-Driven Context-Free Grammar Parsing. - Giorgio Satta; Oliviero Stock (AAAI, 1991)

Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars. - Alberto Lavelli; Giorgio Satta (EACL, 1991)

Computation of upper-bounds for island-driven stochastic parsers. - Anna Corazza; Renato de Mori; Roberto Gretter; Giorgio Satta (EUROSPEECH, 1991)

Computation of Probabilities for an Island-Driven Parser. - Anna Corazza; Renato de Mori; Roberto Gretter; Giorgio Satta (IEEE Trans. Pattern Anal. Mach. Intell., 1991)

Computation of Upper-Bounds for Stochastic Context-Free Languages. - Anna Corazza; Renato de Mori; Giorgio Satta (AAAI, 1992)

Recognition of Linear Context-Free Rewriting Systems. - Giorgio Satta (ACL, 1992)

Language modeling using stochastic context-free grammars. - Anna Corazza; Renato de Mori; Roberto Gretter; Giorgio Satta (Speech Commun., 1993)

An Extended Theory of Head-Driven Parsing. - Mark-Jan Nederhof; Giorgio Satta (ACL, 1994)

A Rank Hierarchy for Determinsitic Tree-Walking Transducers. - Owen Rambow; Giorgio Satta (CAAP, 1994)

Bidirectional Context-Free Grammar Parsing for Natural Language Processing. - Giorgio Satta; Oliviero Stock (Artif. Intell., 1994)

Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication. - Giorgio Satta (Comput. Linguistics, 1994)

Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars. - Anna Corazza; Renato de Mori; Roberto Gretter; Giorgio Satta (IEEE Trans. Pattern Anal. Mach. Intell., 1994)

The Membership Problem for Unordered Vector Languages. - Giorgio Satta (Developments in Language Theory, 1995)

Efficient Tabular LR Parsing. - Mark-Jan Nederhof; Giorgio Satta (ACL, 1996)

Synchronous Models of Language. - Owen Rambow; Giorgio Satta (ACL, 1996)

Efficient Transformation-Based Parsing. - Giorgio Satta; Eric Brill (ACL, 1996)

Symbol-Relation Grammars: A Formalism for Graphical Languages. - Filomena Ferrucci; Giuliano Pacini; Giorgio Satta; Maria I. Sessa; Genoveffa Tortora; Maurizio Tucci; Giuliana Vitiello (Inf. Comput., 1996)

String Transformation Learning. - Giorgio Satta; John C. Henderson (ACL, 1997)

A Variant of Earley Parsing. - Mark-Jan Nederhof; Giorgio Satta (AI*IA, 1997)

Prefix Probabilities from Stochastic Tree Adjoining Grammars. - Mark-Jan Nederhof; Anoop Sarkar; Giorgio Satta (COLING-ACL, 1998)

Restrictions on Tree Adjoining Languages. - Giorgio Satta; William Schuler (COLING-ACL, 1998)

Prefix probabilities for linear indexed grammars. - Mark-Jan Nederhof; Anoop Sarkar; Giorgio Satta (TAG+, 1998)

Optimality Theory and the Generative Complexity of Constraint Violability. - Robert Frank 001; Giorgio Satta (Comput. Linguistics, 1998)

Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. - Giorgio Satta (J. Comput. Syst. Sci., 1998)

Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars. - Jason Eisner; Giorgio Satta (ACL, 1999)

Independent Parallelism in Finite Copying Parallel Rewriting Systems. - Owen Rambow; Giorgio Satta (Theor. Comput. Sci., 1999)

Left-To-Right Parsing and Bilexical Context-Free Grammars. - Mark-Jan Nederhof; Giorgio Satta (ANLP, 2000)

Bringing Information Extraction out of the Labs: the NoName Environment. - Fabio Ciravegna; Alberto Lavelli; Giorgio Satta (ECAI, 2000)

Parsing Techniques for Lexicalized Context-Free Grammars. - Giorgio Satta (IWPT, 2000)

A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars. - Jason Eisner; Giorgio Satta (TAG+, 2000)

Parsing non-recursive CFGs. - Mark-Jan Nederhof; Giorgio Satta (ACL, 2002)

Probabilistic Parsing as Intersection. - Mark-Jan Nederhof; Giorgio Satta (IWPT, 2003)

Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. - Mark-Jan Nederhof; Giorgio Satta; Stuart M. Shieber (IWPT, 2003)

Efficient text fingerprinting via Parikh mapping. - Amihood Amir; Alberto Apostolico; Gad M. Landau; Giorgio Satta (J. Discrete Algorithms, 2003)

Generalized Multitext Grammars. - I. Dan Melamed; Giorgio Satta; Benjamin Wellington (ACL, 2004)

An Alternative Method of Training Probabilistic LR Parsers. - Mark-Jan Nederhof; Giorgio Satta (ACL, 2004)

Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. - Mark-Jan Nederhof; Giorgio Satta (COLING, 2004)

Optimal Discovery of Subword Associations in Strings. - Alberto Apostolico; Cinzia Pizzi; Giorgio Satta (Discovery Science, 2004)

Tabular Parsing - Mark-Jan Nederhof; Giorgio Satta (CoRR, 2004)

The language intersection problem for non-recursive context-free grammars. - Mark-Jan Nederhof; Giorgio Satta (Inf. Comput., 2004)

IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. - Mark-Jan Nederhof; Giorgio Satta (J. Artif. Intell. Res., 2004)

Some Computational Complexity Results for Synchronous Context-Free Grammars. - Giorgio Satta; Enoch Peserico (HLT/EMNLP, 2005)

Factoring Synchronous Grammars by Sorting. - Daniel Gildea; Giorgio Satta; Hao Zhang 010 (ACL, 2006)

Cross-Entropy and Estimation of Probabilistic Context-Free Grammars. - Anna Corazza; Giorgio Satta (HLT-NAACL, 2006)

Estimation of Consistent Probabilistic Context-free Grammars. - Mark-Jan Nederhof; Giorgio Satta (HLT-NAACL, 2006)

Probabilistic parsing strategies. - Mark-Jan Nederhof; Giorgio Satta (J. ACM, 2006)

Guided Learning for Bidirectional Sequence Classification. - Libin Shen; Giorgio Satta; Aravind K. Joshi (ACL, 2007)

On the Complexity of Non-Projective Data-Driven Dependency Parsing. - Ryan T. McDonald; Giorgio Satta (IWPT, 2007)

Probabilistic Context-Free Grammars Estimated from Infinite Distributions. - Anna Corazza; Giorgio Satta (IEEE Trans. Pattern Anal. Mach. Intell., 2007)

Optimal k-arization of Synchronous Tree-Adjoining Grammar. - Rebecca Nesson; Giorgio Satta; Stuart M. Shieber (ACL, 2008)

Comparing 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 (LREC, 2008)

Computation of distances for regular and context-free probabilistic languages. - Mark-Jan Nederhof; Giorgio Satta (Theor. Comput. Sci., 2008)

Probabilistic Parsing. - Mark-Jan Nederhof; Giorgio Satta (New Developments in Formal Languages and Applications, 2008)

An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two. - Carlos Gómez-Rodríguez; Giorgio Satta (ACL/IJCNLP, 2009)

A Polynomial-Time Parsing Algorithm for TT-MCTAG. - Laura Kallmeyer; Giorgio Satta (ACL/IJCNLP, 2009)

Treebank Grammar Techniques for Non-Projective Dependency Parsing. - Marco Kuhlmann; Giorgio Satta (EACL, 2009)

Synchronous Rewriting in Treebanks. - Laura Kallmeyer; Wolfgang Maier 001; Giorgio Satta (IWPT, 2009)

Parsing Algorithms based on Tree Automata. - Andreas Maletti; Giorgio Satta (IWPT, 2009)

Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. - Carlos Gómez-Rodríguez; Marco Kuhlmann; Giorgio Satta; David J. Weir (HLT-NAACL, 2009)

Discovering subword associations in strings in time linear in the output size. - Alberto Apostolico; Giorgio Satta (J. Discrete Algorithms, 2009)

The Importance of Rule Restrictions in CCG. - Marco Kuhlmann; Alexander Koller; Giorgio Satta (ACL, 2010)

Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. - Andreas Maletti; Giorgio Satta (ATANLP@ACL 2010, 2010)

Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two. - Benoît Sagot; Giorgio Satta (ACL, 2010)

Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. - Carlos Gómez-Rodríguez; Marco Kuhlmann; Giorgio Satta (HLT-NAACL, 2010)

Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar. - Rebecca Nesson; Giorgio Satta; Stuart M. Shieber (Comput. Linguistics, 2010)

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. - Pierluigi Crescenzi; Daniel Gildea; Andrea Marino 001; Gianluca Rossi; Giorgio Satta (ACL, 2011)

Dynamic Programming Algorithms for Transition-Based Dependency Parsers. - Marco Kuhlmann; Carlos Gómez-Rodríguez; Giorgio Satta (ACL, 2011)

Prefix Probability for Probabilistic Synchronous Context-Free Grammars. - Mark-Jan Nederhof; Giorgio Satta (ACL, 2011)

Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing. - Shay B. Cohen; Carlos Gómez-Rodríguez; Giorgio Satta (EMNLP, 2011)

Computation of Infix Probabilities for Probabilistic Context-Free Grammars. - Mark-Jan Nederhof; Giorgio Satta (EMNLP, 2011)

Splittability of Bilexical Context-Free Grammars is Undecidable. - Mark-Jan Nederhof; Giorgio Satta (Comput. Linguistics, 2011)

Heuristic Cube Pruning in Linear Time. - Andrea Gesmundo; Giorgio Satta; James Henderson 001 (ACL (2), 2012)

Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization. - Marco Kuhlmann; Giorgio Satta (Comput. Linguistics, 2012)

Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing - Shay B. Cohen; Carlos Gómez-Rodríguez; Giorgio Satta (CoRR, 2012)

A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy. - Francesco Sartorio; Giorgio Satta; Joakim Nivre (ACL (1), 2013)

Approximate PCFG Parsing Using Tensor Decomposition. - Shay B. Cohen; Giorgio Satta; Michael Collins 001 (HLT-NAACL, 2013)

Efficient Parsing for Head-Split Dependency Trees. - Giorgio Satta; Marco Kuhlmann (Trans. Assoc. Comput. Linguistics, 2013)

An information-theoretic measure to evaluate parsing difficulty across treebanks. - Anna Corazza; Alberto Lavelli; Giorgio Satta (ACM Trans. Speech Lang. Process., 2013)

A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing. - Carlos Gómez-Rodríguez; Francesco Sartorio; Giorgio Satta (EMNLP, 2014)

Prefix probabilities for linear context-free rewriting systems. - Mark-Jan Nederhof; Giorgio Satta (J. Log. Comput., 2014)

A Tabular Method for Dynamic Oracles in Transition-Based Parsing. - Yoav Goldberg; Francesco Sartorio; Giorgio Satta (Trans. Assoc. Comput. Linguistics, 2014)

A New Parsing Algorithm for Combinatory Categorial Grammar. - Marco Kuhlmann; Giorgio Satta (Trans. Assoc. Comput. Linguistics, 2014)

Lexicalization and Generative Power in CCG. - Marco Kuhlmann; Alexander Koller; Giorgio Satta (Comput. Linguistics, 2015)

Synchronous context-free grammars and optimal linear parsing strategies. - Pierluigi Crescenzi; Daniel Gildea; Andrea Marino 001; Gianluca Rossi; Giorgio Satta (J. Comput. Syst. Sci., 2015)

Synchronous Context-Free Grammars and Optimal Parsing Strategies. - Daniel Gildea; Giorgio Satta (Comput. Linguistics, 2016)

An Incremental Parser for Abstract Meaning Representation. - Marco Damonte; Shay B. Cohen; Giorgio Satta (EACL (1), 2017)

AMR Parsing With Cache Transition Systems. - Xiaochang Peng; Daniel Gildea; Giorgio Satta (AAAI, 2018)

Sequence-to-sequence Models for Cache Transition Systems. - Xiaochang Peng; Linfeng Song; Daniel Gildea; Giorgio Satta (ACL (1), 2018)

Weighted DAG Automata for Semantic Graphs. - David Chiang 001; Frank Drewes; Daniel Gildea; Adam Lopez; Giorgio Satta (Comput. Linguistics, 2018)

Cache Transition Systems for Graph Parsing. - Daniel Gildea; Giorgio Satta; Xiaochang Peng (Comput. Linguistics, 2018)

On the Complexity of CCG Parsing. - Marco Kuhlmann; Giorgio Satta; Peter Jonsson (Comput. Linguistics, 2018)

Z-Automata for Compact and Direct Representation of Unranked Tree Languages. - Johanna Björklund; Frank Drewes; Giorgio Satta (CIAA, 2019)

Ordered Tree Decomposition for HRG Rule Extraction. - Daniel Gildea; Giorgio Satta; Xiaochang Peng (Comput. Linguistics, 2019)

CYK Parsing over Distributed Representations. - Fabio Massimo Zanzotto; Giorgio Satta; Giordano Cristini (Algorithms, 2020)

Natural language parsing. - Mark-Jan Nederhof; Giorgio Satta (Handbook of Automata Theory (II.), 2021)

Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. - Johanna Björklund; Shay B. Cohen; Frank Drewes; Giorgio Satta (Theor. Comput. Sci., 2021)

Tractable Parsing for CCGs of Bounded Degree. - Lena Katharina Schiffer; Marco Kuhlmann; Giorgio Satta (Comput. Linguistics, 2022)