| 2009 |
|---|
| 51 | EE | Marco Kuhlmann,
Giorgio Satta:
Treebank Grammar Techniques for Non-Projective Dependency Parsing.
EACL 2009: 478-486 |
| 2008 |
|---|
| 50 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Computation of distances for regular and context-free probabilistic languages.
Theor. Comput. Sci. 395(2-3): 235-254 (2008) |
| 2007 |
|---|
| 49 | EE | Libin Shen,
Giorgio Satta,
Aravind K. Joshi:
Guided Learning for Bidirectional Sequence Classification.
ACL 2007 |
| 48 | EE | Anna Corazza,
Giorgio Satta:
Probabilistic Context-Free Grammars Estimated from Infinite Distributions.
IEEE Trans. Pattern Anal. Mach. Intell. 29(8): 1379-1393 (2007) |
| 2006 |
|---|
| 47 | EE | Daniel Gildea,
Giorgio Satta,
Hao Zhang:
Factoring Synchronous Grammars by Sorting.
ACL 2006 |
| 46 | EE | Anna Corazza,
Giorgio Satta:
Cross-Entropy and Estimation of Probabilistic Context-Free Grammars.
HLT-NAACL 2006 |
| 45 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Estimation of Consistent Probabilistic Context-free Grammars.
HLT-NAACL 2006 |
| 44 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Probabilistic parsing strategies.
J. ACM 53(3): 406-436 (2006) |
| 2005 |
|---|
| 43 | EE | Giorgio Satta,
Enoch Peserico:
Some Computational Complexity Results for Synchronous Context-Free Grammars.
HLT/EMNLP 2005 |
| 2004 |
|---|
| 42 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Probabilistic Parsing Strategies.
ACL 2004: 542-549 |
| 41 | EE | Mark-Jan Nederhof,
Giorgio Satta:
An Alternative Method of Training Probabilistic LR Parsers.
ACL 2004: 550-557 |
| 40 | EE | I. Dan Melamed,
Giorgio Satta,
Benjamin Wellington:
Generalized Multitext Grammars.
ACL 2004: 661-668 |
| 39 | EE | Alberto Apostolico,
Cinzia Pizzi,
Giorgio Satta:
Optimal Discovery of Subword Associations in Strings.
Discovery Science 2004: 270-277 |
| 38 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Tabular Parsing
CoRR cs.CL/0404009: (2004) |
| 37 | EE | Mark-Jan Nederhof,
Giorgio Satta:
The language intersection problem for non-recursive context-free grammars.
Inf. Comput. 192(2): 172-184 (2004) |
| 36 | EE | Mark-Jan Nederhof,
Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing.
J. Artif. Intell. Res. (JAIR) 21: 287-317 (2004) |
| 2003 |
|---|
| 35 | EE | Amihood Amir,
Alberto Apostolico,
Gad M. Landau,
Giorgio Satta:
Efficient text fingerprinting via Parikh mapping.
J. Discrete Algorithms 1(5-6): 409-421 (2003) |
| 2002 |
|---|
| 34 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Parsing non-recursive CFGs.
ACL 2002: 112-119 |
| 33 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Probabilistic Parsing Strategies
CoRR cs.CL/0211017: (2002) |
| 2000 |
|---|
| 32 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Left-To-Right Parsing and Bilexical Context-Free Grammars.
ANLP 2000: 272-279 |
| 31 | | Fabio Ciravegna,
Alberto Lavelli,
Giorgio Satta:
Bringing Information Extraction out of the Labs: the NoName Environment.
ECAI 2000: 416-420 |
| 1999 |
|---|
| 30 | EE | Jason Eisner,
Giorgio Satta:
Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars.
ACL 1999 |
| 29 | EE | Owen Rambow,
Giorgio Satta:
Independent Parallelism in Finite Copying Parallel Rewriting Systems.
Theor. Comput. Sci. 223(1-2): 87-120 (1999) |
| 1998 |
|---|
| 28 | | Giorgio Satta,
William Schuler:
Restrictions on Tree Adjoining Languages.
COLING-ACL 1998: 1176-1182 |
| 27 | | Mark-Jan Nederhof,
Anoop Sarkar,
Giorgio Satta:
Prefix Probabilities from Stochastic Tree Adjoining Grammars.
COLING-ACL 1998: 953-959 |
| 26 | EE | Mark-Jan Nederhof,
Giorgio Satta:
A Variant of Earley Parsing
CoRR cmp-lg/9808017: (1998) |
| 25 | EE | Mark-Jan Nederhof,
Anoop Sarkar,
Giorgio Satta:
Prefix Probabilities from Stochastic Tree Adjoining Grammars
CoRR cs.CL/9809026: (1998) |
| 24 | EE | Giorgio Satta,
William Schuler:
Restrictions on Tree Adjoining Languages
CoRR cs.CL/9810015: (1998) |
| 23 | | Robert Frank,
Giorgio Satta:
Optimality Theory and the Generative Complexity of Constraint Violability.
Computational Linguistics 24(2): 307-315 (1998) |
| 22 | | Giorgio Satta:
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems.
J. Comput. Syst. Sci. 56(1): 27-45 (1998) |
| 1997 |
|---|
| 21 | | Giorgio Satta,
John C. Henderson:
String Transformation Learning.
ACL 1997: 444-451 |
| 20 | | Mark-Jan Nederhof,
Giorgio Satta:
A Variant of Early Parsing.
AI*IA 1997: 84-95 |
| 1996 |
|---|
| 19 | | Owen Rambow,
Giorgio Satta:
Synchronous Models of Language.
ACL 1996: 116-123 |
| 18 | | Mark-Jan Nederhof,
Giorgio Satta:
Efficient Tabular LR Parsing.
ACL 1996: 239-247 |
| 17 | | Giorgio Satta,
Eric Brill:
Efficient Transformation-Based Parsing.
ACL 1996: 255-262 |
| 16 | EE | Mark-Jan Nederhof,
Giorgio Satta:
Efficient Tabular LR Parsing
CoRR cmp-lg/9605018: (1996) |
| 15 | EE | Owen Rambow,
Giorgio Satta:
Synchronous Models of Language
CoRR cmp-lg/9605032: (1996) |
| 14 | | Filomena Ferrucci,
Giuliano Pacini,
Giorgio Satta,
Maria I. Sessa,
Genoveffa Tortora,
Maurizio Tucci,
Giuliana Vitiello:
Symbol-Relation Grammars: A Formalism for Graphical Languages.
Inf. Comput. 131(1): 1-46 (1996) |
| 1995 |
|---|
| 13 | | Giorgio Satta:
The Membership Problem for Unordered Vector Languages.
Developments in Language Theory 1995: 267-275 |
| 1994 |
|---|
| 12 | | Mark-Jan Nederhof,
Giorgio Satta:
An Extended Theory of Head-Driven Parsing.
ACL 1994: 210-217 |
| 11 | | Owen Rambow,
Giorgio Satta:
A Rank Hierarchy for Determinsitic Tree-Walking Transducers.
CAAP 1994: 309-321 |
| 10 | | Giorgio Satta,
Oliviero Stock:
Bidirectional Context-Free Grammar Parsing for Natural Language Processing.
Artif. Intell. 69(1-2): 123-164 (1994) |
| 9 | | Giorgio Satta:
Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication.
Computational Linguistics 20(2): 173-191 (1994) |
| 8 | EE | Anna Corazza,
Renato de Mori,
Roberto Gretter,
Giorgio Satta:
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars.
IEEE Trans. Pattern Anal. Mach. Intell. 16(10): 1018-1027 (1994) |
| 1992 |
|---|
| 7 | | Anna Corazza,
Renato de Mori,
Giorgio Satta:
Computation of Upper-Bounds for Stochastic Context-Free Languages.
AAAI 1992: 344-349 |
| 6 | | Giorgio Satta:
Recognition of Linear Context-Free Rewriting Systems.
ACL 1992: 89-95 |
| 1991 |
|---|
| 5 | | Giorgio Satta,
Oliviero Stock:
A Tabular Method for Island-Driven Context-Free Grammar Parsing.
AAAI 1991: 143-148 |
| 4 | EE | Alberto Lavelli,
Giorgio Satta:
Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars.
EACL 1991: 27-32 |
| 3 | EE | Anna Corazza,
Renato de Mori,
Roberto Gretter,
Giorgio Satta:
Computation of Probabilities for an Island-Driven Parser.
IEEE Trans. Pattern Anal. Mach. Intell. 13(9): 936-950 (1991) |
| 1990 |
|---|
| 2 | EE | Alessandra Giorgi,
Fabio Pianesi,
Giorgio Satta:
A Computational Approach to Binding Theory.
COLING 1990: 120-125 |
| 1989 |
|---|
| 1 | | Giorgio Satta,
Oliviero Stock:
Formal Properties and Implementation of Bidirectional Charts.
IJCAI 1989: 1480-1485 |
