Giorgio Satta

发表

Prefix Probabilities from Stochastic Tree Adjoining Grammars

Giorgio Satta, Mark-Jan Nederhof, Anoop Sarkar, 1998, COLING-ACL.

Comparing Italian parsers on a common Treebank: the EVALITA experience

Giorgio Satta, Maria Simi, Giuseppe Attardi, 2008, LREC.

A New Parsing Algorithm for Combinatory Categorial Grammar

Giorgio Satta, Marco Kuhlmann, 2014, Transactions of the Association for Computational Linguistics.

Prefix probabilities for linear indexed grammars

Giorgio Satta, Mark-Jan Nederhof, Anoop Sarkar, 1998, TAG+.

Language modeling using stochastic context-free grammars

Giorgio Satta, Renato De Mori, Roberto Gretter, 1993, Speech Commun..

Finite-State Methods and Natural Language Processing

Josef van Genabith, Giorgio Satta, Tero Harju, 2005, Lecture Notes in Computer Science.

A Polynomial-Time Parsing Algorithm for TT-MCTAG

Giorgio Satta, Laura Kallmeyer, 2009, ACL/IJCNLP.

Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)

Giorgio Satta, Anne Abeillé, K. Vijay-Shanker, 1998 .

Efficient text fingerprinting via Parikh mapping

Giorgio Satta, Amihood Amir, Alberto Apostolico, 2003, J. Discrete Algorithms.

Computation of Infix Probabilities for Probabilistic Context-Free Grammars

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2011, EMNLP.

Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies

Giorgio Satta, Shay B. Cohen, Michael Collins, 2013 .

Tabular Parsing

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2004, ArXiv.

String Transformation Learning

Giorgio Satta, John C. Henderson, G. Satta, 1997, Annual Meeting of the Association for Computational Linguistics.

Parsing Algorithms based on Tree Automata

Giorgio Satta, Andreas Maletti, G. Satta, 2009, IWPT.

Partially ordered multiset context-free grammars and ID/LP parsing

Giorgio Satta, Mark-Jan Nederhof, Stuart M. Shieber, 2003 .

Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing

Giorgio Satta, Shay B. Cohen, Carlos Gómez-Rodríguez, 2011, EMNLP.

Computation of distances for regular and context-free probabilistic languages

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2008, Theor. Comput. Sci..

Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks

Giorgio Satta, Anne Abeillé, K. Vijay-Shanker, 1998 .

New developments in parsing technology

Giorgio Satta, Harry Bunt, John Carroll, 2004 .

Probabilistic Parsing

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2008, New Developments in Formal Languages and Applications.

Estimation of Consistent Probabilistic Context-free Grammars

Giorgio Satta, Mark-Jan Nederhof, 2006, HLT-NAACL.

Sequence-to-sequence Models for Cache Transition Systems

Giorgio Satta, Xiaochang Peng, Daniel Gildea, 2018, ACL.

Stochastic Context-Free Grammars for Island-Driven Probabilistic Parsing

Giorgio Satta, Roberto Gretter, Anna Corazza, 1991, IWPT.

A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy

Giorgio Satta, Joakim Nivre, Francesco Sartorio, 2013, ACL.

Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing pdf

Giorgio Satta, Shay B. Cohen, Carlos Gómez-Rodríguez, 2012, ArXiv.

Computation of upper-bounds for island-driven stochastic parsers

Giorgio Satta, Renato De Mori, Roberto Gretter, 1991, EUROSPEECH.

A Variant of Early Parsing

Giorgio Satta, Mark-Jan Nederhof, 1997 .

Discovering subword associations in strings in time linear in the output size

Giorgio Satta, Alberto Apostolico, A. Apostolico, 2009, J. Discrete Algorithms.

Some Recent results on Stochastic Language Modelling

Giorgio Satta, Anna Corazza, R. De Mori, 1993 .

An Incremental Parser for Abstract Meaning Representation

Giorgio Satta, Shay B. Cohen, Marco Damonte, 2016, EACL.

An information-theoretic measure to evaluate parsing difficulty across treebanks

Giorgio Satta, Anna Corazza, Alberto Lavelli, 2013, TSLP.

Parsing Schemata for Practical Text Analysis

Giorgio Satta, Campus de Elvi, 2010 .

An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two

Giorgio Satta, Carlos Gómez-Rodríguez, 2009, ACL/IJCNLP.

Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar

Giorgio Satta, Stuart M. Shieber, Rebecca Nesson, 2010, CL.

An Alternative Method of Training Probabilistic LR Parsers

Giorgio Satta, Mark-Jan Nederhof, 2004, ACL.

A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars

Giorgio Satta, Jason Eisner, Jason Eisner, 2000, TAG+.

Optimality Theory and the Generative Complexity of Constraint Violability

Giorgio Satta, Robert Frank, R. Frank, 1998, CL.

Review of Parsing with principles and classes of information by Paola Merlo. Kluwer Academic Publishers 1996.

Giorgio Satta, G. Satta, 1998 .

Guided Learning for Bidirectional Sequence Classification

Giorgio Satta, Aravind K. Joshi, Libin Shen, 2007, ACL.

AMR Parsing With Cache Transition Systems

Giorgio Satta, Xiaochang Peng, Daniel Gildea, 2018, AAAI.

Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems

Giorgio Satta, Carlos Gómez-Rodríguez, Marco Kuhlmann, 2010, HLT-NAACL.

On the Complexity of Non-Projective Data-Driven Dependency Parsing

Giorgio Satta, Ryan T. McDonald, Ryan McDonald, 2007, IWPT.

Bringing information extraction out of the labs: the Pinocchio environment

Giorgio Satta, Fabio Ciravegna, Alberto Lavelli, 2000 .

The Importance of Rule Restrictions in CCG

Giorgio Satta, Alexander Koller, Marco Kuhlmann, 2010, ACL.

Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication

Giorgio Satta, G. Satta, 1994, Comput. Linguistics.

Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing

Giorgio Satta, Shay B. Cohen, Carlos Gómez-Rodríguez, 2011 .

Optimal discovery of subword associations in strings: (Extended abstract)

Giorgio Satta, Alberto Apostolico, Cinzia Pizzi, 2004 .

Bidirectional Context-Free Grammar Parsing for Natural Language Processing

Giorgio Satta, Oliviero Stock, O. Stock, 1994, Artif. Intell..

Symbol-Relation Grammars: A Formalism for Graphical Languages

Giorgio Satta, Genny Tortora, Filomena Ferrucci, 1996, Inf. Comput..

for Probabilistic Synchronous Context-Free Grammars

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2011 .

Optimal k-arization of Synchronous Tree-Adjoining Grammar

Giorgio Satta, Stuart M. Shieber, Rebecca Nesson, 2008, ACL.

Computation of Probabilities for an Island-Driven Parser

Giorgio Satta, Renato De Mori, Roberto Gretter, 1991, IEEE Trans. Pattern Anal. Mach. Intell..

Approximate PCFG Parsing Using Tensor Decomposition

Giorgio Satta, Shay B. Cohen, Michael Collins, 2013, NAACL.

Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization

Giorgio Satta, Marco Kuhlmann, 2012, Computational Linguistics.

A Tabular Method for Island-Driven Context-Free Grammar Parsing

Giorgio Satta, Oliviero Stock, 1991, AAAI.

Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2004, COLING.

Synchronous Models of Language

Giorgio Satta, Owen Rambow, Owen Rambow, 1996, ACL.

Efficient Parsing for Head-Split Dependency Trees

Giorgio Satta, Marco Kuhlmann, 2013, Transactions of the Association for Computational Linguistics.

Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing

Giorgio Satta, Mark-Jan Nederhof, Stuart M. Shieber, 2003, IWPT.

Bidirectional Parsing of Lexicalized Tree Adjoining Grammars

Giorgio Satta, Alberto Lavelli, A. Lavelli, 1991, EACL.

Algorithmic aspects of natural language processing

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2010 .

Synchronous Rewriting in Treebanks

Giorgio Satta, Laura Kallmeyer, Wolfgang Maier, 2009, IWPT.

A Two-Dimensional Hierarchy for Parallel Rewriting Systems

Giorgio Satta, Owen Rambow, Owen Rambow, 1994 .

Bringing Information Extraction out of the Labs: the NoName Environment

Giorgio Satta, Fabio Ciravegna, Alberto Lavelli, 2000, ECAI.

Parsing non-recursive CFGs

Giorgio Satta, Mark-Jan Nederhof, 2002, ACL.

Lexicalization and Generative Power in CCG

Giorgio Satta, Alexander Koller, Marco Kuhlmann, 2015, CL.

A Computational Approach to Binding Theory

Giorgio Satta, Fabio Pianesi, Alessandra Giorgi, 1990, COLING.

Cache Transition Systems for Graph Parsing

Giorgio Satta, Xiaochang Peng, Daniel Gildea, 2017, Computational Linguistics.

Efficient Tabular LR Parsing

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 1996, ACL.

Cross-Entropy and Estimation of Probabilistic Context-Free Grammars

Giorgio Satta, Anna Corazza, G. Satta, 2006, NAACL.

Probabilistic Parsing as Intersection

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2003, IWPT.

Computation of Upper-Bounds for Stochastic Context-Free Languages

Giorgio Satta, Renato De Mori, Anna Corazza, 1992, AAAI.

On the Complexity of CCG Parsing

Giorgio Satta, Peter Jonsson, Marco Kuhlmann, 2017, CL.

CYK Parsing over Distributed Representations

Giorgio Satta, Fabio Massimo Zanzotto, Giordano Cristini, 2020, Algorithms.

Some Computational Complexity Results for Synchronous Context-Free Grammars

Giorgio Satta, Enoch Peserico, 2005, HLT/EMNLP.

Analyzing an Italian Treebank with State-of-the-Art Statistical Parsers

Giorgio Satta, Anna Corazza, Alberto Lavelli, 2004 .

Formal Properties and Implementation of Bidirectional Charts

Giorgio Satta, Oliviero Stock, O. Stock, 1989, IJCAI.

Factoring Synchronous Grammars by Sorting

Giorgio Satta, Daniel Gildea, Hao Zhang, 2006, ACL.

A Variant of Earley Parsing

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 1997, AI*IA.

Tre parser per una lingua

Giorgio Satta, Fabio Pianesi, Alberto Lavelli, 1991 .

String Transformation Learning

Giorgio Satta, John C. Henderson, 1997, ACL.

Recognition of Linear Context-Free Rewriting Systems

Giorgio Satta, G. Satta, 1992, ACL.

A Tabular Method for Dynamic Oracles in Transition-Based Parsing

Giorgio Satta, Yoav Goldberg, Francesco Sartorio, 2014, TACL.

FG 2006: The 11th conference on Formal Grammar

Giorgio Satta, Gerald Penn, Shuly Wintner, 2006 .

Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems

Giorgio Satta, G. Satta, 1998, J. Comput. Syst. Sci..

The language intersection problem for non-recursive context-free grammars

Giorgio Satta, Mark-Jan Nederhof, 2004, Inf. Comput..

Z-Automata for Compact and Direct Representation of Unranked Tree Languages

Giorgio Satta, Frank Drewes, Johanna Björklund, 2019, CIAA.

Optimal Discovery of Subword Associations in Strings

Giorgio Satta, Alberto Apostolico, Cinzia Pizzi, 2004, Discovery Science.

Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars

Giorgio Satta, Jason Eisner, Jason Eisner, 1999, ACL.

Prefix Probabilities for Linear Context-Free Rewriting Systems

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2011, IWPT.

An Extended Theory of Head-Driven Parsing pdf

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 1994, ACL.

Generalized LR Parsing

Giorgio Satta, M. Tomita, 1991, Springer US.

Parsing with CYK over Distributed Representations

Giorgio Satta, Fabio Massimo Zanzotto, Giordano Cristini, 2017 .

Synchronous Context-Free Grammars and Optimal Parsing Strategies

Giorgio Satta, Daniel Gildea, D. Gildea, 2016, CL.

The Membership Problem for Unordered Vector Languages

Giorgio Satta, 1995, Developments in Language Theory.

Splittability of Bilexical Context-Free Grammars is Undecidable

Giorgio Satta, Mark-Jan Nederhof, 2011, Computational Linguistics.

Generalized Multitext Grammars

Giorgio Satta, I. Dan Melamed, Benjamin Wellington, 2004, ACL.

Theory of Parsing

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2010 .

Independent Parallelism in Finite Copying Parallel Rewriting Systems

Giorgio Satta, Owen Rambow, Owen Rambow, 1999, Theor. Comput. Sci..

Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs

Giorgio Satta, Shay B. Cohen, Frank Drewes, 2020 .

Synchronous context-free grammars and optimal linear parsing strategies

Giorgio Satta, Gianluca Rossi, Daniel Gildea, 2013, J. Comput. Syst. Sci..

Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems

Giorgio Satta, David J. Weir, Carlos Gómez-Rodríguez, 2009, NAACL.

Weighted DAG Automata for Semantic Graphs

Giorgio Satta, Daniel Gildea, Adam Lopez, 2017, CL.

Dynamic Programming Algorithms for Transition-Based Dependency Parsers

Giorgio Satta, Carlos Gómez-Rodríguez, Marco Kuhlmann, 2011, ACL.

The string-generative capacity of regular dependency languages

Giorgio Satta, Laura Kallmeyer, Gerald Penn, 2009 .

Language Models for Automatic Speech Recognition

Giorgio Satta, Roland Kuhn, Anna Corazza, 1995 .

Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers

Giorgio Satta, Andreas Maletti, G. Satta, 2010, ATANLP@ACL 2010.

Heuristic Cube Pruning in Linear Time

Giorgio Satta, James Henderson, Andrea Gesmundo, 2012, ACL.

Efficient Transformation-Based Parsing

Giorgio Satta, Eric Brill, 1996, ACL.

Probabilistic Parsing Strategies

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2002, ACL.

Computing Partition Functions of PCFGs

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2009, Research on Language and Computation.

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems

Giorgio Satta, Gianluca Rossi, Daniel Gildea, 2011, ACL.

Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars

Giorgio Satta, Renato De Mori, Roberto Gretter, 1994, IEEE Trans. Pattern Anal. Mach. Intell..

Left-To-Right Parsing and Bilexical Context-Free Grammars

Giorgio Satta, Mark-Jan Nederhof, 2000, ANLP.

Restrictions on Tree Adjoining Languages

Giorgio Satta, William Schuler, William Schuler, 1998, ACL.

Formal Languages and Applications

Giorgio Satta, 2004 .

Head-Driven Bidirectional Parsing: A Tabular Method

Giorgio Satta, Oliviero Stock, O. Stock, 1989, IWPT.

A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing

Giorgio Satta, Carlos Gómez-Rodríguez, Francesco Sartorio, 2014, EMNLP.

Review of Generalized LR parsing by Masaru Tomita. Kluwer Academic Publishers 1991.

Giorgio Satta, G. Satta, 1992 .

Developments in parsing techology : From Theory to Application

Giorgio Satta, Harry Bunt, John Carroll, 2004 .

Parsing Techniques for Lexicalized Context-Free Grammars

Giorgio Satta, 2000, IWPT.

Probabilistic Context-Free Grammars Estimated from Infinite Distributions

Giorgio Satta, Anna Corazza, G. Satta, 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs

Giorgio Satta, Shay B. Cohen, Frank Drewes, 2019, FSMNLP.

Development in parsing technology: from theory to application

Giorgio Satta, Harry Bunt, John Carroll, 2004 .

Ordered Tree Decomposition for HRG Rule Extraction

Giorgio Satta, Daniel Gildea, Xiaochang Peng, 2019, Computational Linguistics.

A Rank Hierarchy for Determinsitic Tree-Walking Transducers

Giorgio Satta, Owen Rambow, Owen Rambow, 1994, CAAP.

Treebank Grammar Techniques for Non-Projective Dependency Parsing

Giorgio Satta, Marco Kuhlmann, Marco Kuhlmann, 2009, EACL.

Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two

Giorgio Satta, Benoît Sagot, 2010, ACL.

Prefix Probability for Probabilistic Synchronous Context-Free Grammars

Giorgio Satta, Mark-Jan Nederhof, M. Nederhof, 2011, ACL.

Computation of probabilities for island-driven parsers

Giorgio Satta, Renato De Mori, Roberto Gretter, 1990, ICSLP.

Natural language parsing

Giorgio Satta, Mark-Jan Nederhof, 2021 .

IDL-expressions: a compact representation for finite

Giorgio Satta, G. Satta, G. Jaeger, 2002 .

Translation Algorithms by Means of Language Intersection

Giorgio Satta, G. Satta, 2006 .

Computing Partition Functions of PCFGs

Giorgio Satta, Mark-Jan Nederhof, 2008 .