2017

Pdf Export Search An Incremental Parser for Abstract Meaning Representation
[E17-1051]: Marco Damonte | Shay B. Cohen | Giorgio Satta

2016

Pdf Export Search Synchronous Context-Free Grammars and Optimal Parsing Strategies
[J16-2002]: Daniel Gildea | Giorgio Satta

2015

Pdf Export Search Lexicalization and Generative Power in CCG
[J15-2002]: Marco Kuhlmann | Alexander Koller | Giorgio Satta

2014

Pdf Export Search A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing
[D14-1099]: Carlos Gómez-Rodríguez | Francesco Sartorio | Giorgio Satta

Pdf Export Search A Tabular Method for Dynamic Oracles in Transition-Based Parsing
[Q14-1010]: Yoav Goldberg | Francesco Sartorio | Giorgio Satta

Pdf Export Search A New Parsing Algorithm for Combinatory Categorial Grammar
[Q14-1032]: Marco Kuhlmann | Giorgio Satta

2013

Pdf Export Search Approximate PCFG Parsing Using Tensor Decomposition
[N13-1052]: Shay B. Cohen | Giorgio Satta | Michael Collins

Pdf Export Search A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy
[P13-1014]: Francesco Sartorio | Giorgio Satta | Joakim Nivre

Pdf Export Search Efficient Parsing for Head-Split Dependency Trees
[Q13-1022]: Giorgio Satta | Marco Kuhlmann

2012

Pdf Export Search Heuristic Cube Pruning in Linear Time
[P12-2058]: Andrea Gesmundo | Giorgio Satta | James Henderson

Pdf Export Search Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11)
[W12-4600]: Giorgio Satta | Chung-Hye Han

Pdf Export Search Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
[J12-3006]: Marco Kuhlmann | Giorgio Satta

2011

Pdf Export Search Computation of Infix Probabilities for Probabilistic Context-Free Grammars
[D11-1112]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing
[D11-1114]: Shay B. Cohen | Carlos Gómez-Rodríguez | Giorgio Satta

Pdf Export Search Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
[P11-1046]: Pierluigi Crescenzi | Daniel Gildea | Andrea Marino | Gianluca Rossi | Giorgio Satta

Pdf Export Search Prefix Probability for Probabilistic Synchronous Context-Free Grammars
[P11-1047]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Dynamic Programming Algorithms for Transition-Based Dependency Parsers
[P11-1068]: Marco Kuhlmann | Carlos Gómez-Rodrìguez | Giorgio Satta

Pdf Export Search Splittability of Bilexical Context-Free Grammars is Undecidable
[J11-4009]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Prefix Probabilities for Linear Context-Free Rewriting Systems
[W11-2919]: Mark-Jan Nederhof | Giorgio Satta

2010

Pdf Export Search Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
[J10-3006]: Rebecca Nesson | Giorgio Satta | Stuart M. Shieber

Pdf Export Search Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
[N10-1035]: Carlos Gómez-Rodríguez | Marco Kuhlmann | Giorgio Satta

Pdf Export Search Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
[P10-1054]: Benoît Sagot | Giorgio Satta

Pdf Export Search The Importance of Rule Restrictions in CCG
[P10-1055]: Marco Kuhlmann | Alexander Koller | Giorgio Satta

Pdf Export Search Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers
[W10-2503]: Andreas Maletti | Giorgio Satta

2009

Pdf Export Search Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
[N09-1061]: Carlos Gómez-Rodríguez | Marco Kuhlmann | Giorgio Satta | David Weir

Pdf Export Search An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two
[P09-1111]: Carlos Gómez-Rodríguez | Giorgio Satta

Pdf Export Search A Polynomial-Time Parsing Algorithm for TT-MCTAG
[P09-1112]: Laura Kallmeyer | Giorgio Satta

Pdf Export Search Treebank Grammar Techniques for Non-Projective Dependency Parsing
[E09-1055]: Marco Kuhlmann | Giorgio Satta

Pdf Export Search Parsing Algorithms based on Tree Automata
[W09-3801]: Andreas Maletti | Giorgio Satta

Pdf Export Search Synchronous Rewriting in Treebanks
[W09-3810]: Laura Kallmeyer | Wolfgang Maier | Giorgio Satta

2008

Pdf Export Search Comparing Italian parsers on a common Treebank: the EVALITA experience
[L08-1356]: Cristina Bosco | Alessandro Mazzei | Vincenzo Lombardo | Giuseppe Attardi | Anna Corazza | Alberto Lavelli | Leonardo Lesmo | Giorgio Satta | Maria Simi

Pdf Export Search Optimal $k$-arization of Synchronous Tree-Adjoining Grammar
[P08-1069]: Rebecca Nesson | Giorgio Satta | Stuart M. Shieber

2007

Pdf Export Search Guided Learning for Bidirectional Sequence Classification
[P07-1096]: Libin Shen | Giorgio Satta | Aravind Joshi

Pdf Export Search On the Complexity of Non-Projective Data-Driven Dependency Parsing
[W07-2216]: Ryan McDonald | Giorgio Satta

2006

Pdf Export Search Cross-Entropy and Estimation of Probabilistic Context-Free Grammars
[N06-1043]: Anna Corazza | Giorgio Satta

Pdf Export Search Estimation of Consistent Probabilistic Context-free Grammars
[N06-1044]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Factoring Synchronous Grammars by Sorting
[P06-2036]: Daniel Gildea | Giorgio Satta | Hao Zhang

2005

Pdf Export Search Some Computational Complexity Results for Synchronous Context-Free Grammars
[H05-1101]: Giorgio Satta | Enoch Peserico

2004

Pdf Export Search Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata
[C04-1011]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Probabilistic Parsing Strategies
[P04-1069]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search An Alternative Method of Training Probabilistic LR Parsers
[P04-1070]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Generalized Multitext Grammars
[P04-1084]: I. Dan Melamed | Giorgio Satta | Benjamin Wellington

2002

Pdf Export Search Parsing non-recursive CFGs
[P02-1015]: Mark-Jan Nederhof | Giorgio Satta

2000

Pdf Export Search Left-To-Right Parsing and Bilexical Context-Free Grammars
[A00-2036]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars
[W00-2011]: Jason Eisner | Giorgio Satta

1999

Pdf Export Search Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars
[P99-1059]: Jason Eisner | Giorgio Satta

1998

Pdf Export Search Prefix Probabilities from Stochastic Tree Adjoining Grammars
[C98-2152]: Mark-Jan Nederhof | Anoop Sarkar | Giorgio Satta

Pdf Export Search Restrictions on Tree Adjoining Languages
[C98-2187]: Giorgio Satta | William Schuler

Pdf Export Search Prefix Probabilities from Stochastic Free Adjoining Grammars
[P98-2157]: Mark-Jan Nederhof | Anoop Sarkar | Giorgio Satta

Pdf Export Search Restrictions on Tree Adjoining Languages
[P98-2192]: Giorgio Satta | William Schuler

Pdf Export Search Optimality Theory and the Generative Complexity of Constraint Violability
[J98-2006]: Robert Frank | Giorgio Satta

Pdf Export Search Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)
[W98-0100]: Anne Abeillé | Tilman Becker | Giorgio Satta | K. Vijay-Shanker

Pdf Export Search Prefix probabilities for linear indexed grammars
[W98-0130]: Mark-Jan Nederhof | Anoop Sarkar | Giorgio Satta

1997

Pdf Export Search String Transformation Learning
[E97-1057]: Giorgio Satta | John C. Henderson

Pdf Export Search String Transformation Learning
[P97-1057]: Giorgio Satta | John C. Henderson

1996

Pdf Export Search Synchronous Models off Language
[P96-1016]: Owen Rambow | Giorgio Satta

Pdf Export Search Efficient Tabular L R Parsing
[P96-1032]: Mark-Jan Nederhof | Giorgio Satta

1994

Pdf Export Search Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication
[J94-2002]: Giorgio Satta

Pdf Export Search AN EXTENDED THEORY OF HEAD-DRIVEN PARSING
[P94-1029]: Mark-Jan Nederhof | Giorgio Satta

1992

Pdf Export Search RECOGNITION OF LINEAR CONTEXT-FREE REWRITING SYSTEMS
[P92-1012]: Giorgio Satta

1991

Pdf Export Search BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS
[E91-1006]: Alberto Lavelli | Giorgio Satta

1990

Pdf Export Search A Computational Approach to Binding Theory
[C90-3022]: Alessandra Giorgi | Fabio Pianesi | Giorgio Satta