| 2011 | ||
|---|---|---|
| 76 | Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta: Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL 2011: 450-459 | |
| 75 | Mark-Jan Nederhof, Giorgio Satta: Prefix Probability for Probabilistic Synchronous Context-Free Grammars. ACL 2011: 460-469 | |
| 74 | Marco Kuhlmann, Carlos Gómez-Rodríguez, Giorgio Satta: Dynamic Programming Algorithms for Transition-Based Dependency Parsers. ACL 2011: 673-682 | |
| 73 | Mark-Jan Nederhof, Giorgio Satta: Computation of Infix Probabilities for Probabilistic Context-Free Grammars. EMNLP 2011: 1213-1221 | |
| 72 | Shay B. Cohen, Carlos Gómez-Rodríguez, Giorgio Satta: Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing. EMNLP 2011: 1234-1245 | |
| 71 | Mark-Jan Nederhof, Giorgio Satta: Prefix Probabilities for Linear Context-Free Rewriting Systems. IWPT 2011: 151-162 | |
| 70 | Mark-Jan Nederhof, Giorgio Satta: IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing CoRR abs/1107.0026: (2011) | |
| 69 | Mark-Jan Nederhof, Giorgio Satta: Splittability of Bilexical Context-Free Grammars is Undecidable. Computational Linguistics 37(4): 867-879 (2011) | |
| 2010 | ||
| 68 | Benoît Sagot, Giorgio Satta: Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL 2010: 525-533 | |
| 67 | Marco Kuhlmann, Alexander Koller, Giorgio Satta: The Importance of Rule Restrictions in CCG. ACL 2010: 534-543 | |
| 66 | Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta: Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. HLT-NAACL 2010: 276-284 | |
| 65 | Rebecca Nesson, Giorgio Satta, Stuart M. Shieber: Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar. Computational Linguistics 36(3): 443-480 (2010) | |
| 2009 | ||
| 64 | Carlos Gómez-Rodríguez, Giorgio Satta: An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two. ACL/AFNLP 2009: 985-993 | |
| 63 | Laura Kallmeyer, Giorgio Satta: A Polynomial-Time Parsing Algorithm for TT-MCTAG. ACL/AFNLP 2009: 994-1002 | |
| 62 | Marco Kuhlmann, Giorgio Satta: Treebank Grammar Techniques for Non-Projective Dependency Parsing. EACL 2009: 478-486 | |
| 61 | Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, David J. Weir: Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems. HLT-NAACL 2009: 539-547 | |
| 60 | Andreas Maletti, Giorgio Satta: Parsing Algorithms based on Tree Automata. IWPT 2009: 1-12 | |
| 59 | Laura Kallmeyer, Wolfgang Maier, Giorgio Satta: Synchronous Rewriting in Treebanks. IWPT 2009: 69-72 | |
| 58 | Alberto Apostolico, Giorgio Satta: Discovering subword associations in strings in time linear in the output size. J. Discrete Algorithms 7(2): 227-238 (2009) | |
| 2008 | ||
| 57 | Rebecca Nesson, Giorgio Satta, Stuart M. Shieber: Optimal $k$-arization of Synchronous Tree-Adjoining Grammar. ACL 2008: 604-612 | |
| 56 | Cristina Bosco, Alessandro Mazzei, Vincenzo Lombardo, Giuseppe Attardi, Anna Corazza, Alberto Lavelli, Leonardo Lesmo, Giorgio Satta, Maria Simi: Comparing Italian parsers on a common Treebank: the EVALITA experience. LREC 2008 | |
| 55 | Mark-Jan Nederhof, Giorgio Satta: Probabilistic Parsing. New Developments in Formal Languages and Applications 2008: 229-258 | |
| 54 | 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 | ||
| 53 | Libin Shen, Giorgio Satta, Aravind K. Joshi: Guided Learning for Bidirectional Sequence Classification. ACL 2007 | |
| 52 | Anna Corazza, Giorgio Satta: Probabilistic Context-Free Grammars Estimated from Infinite Distributions. IEEE Trans. Pattern Anal. Mach. Intell. 29(8): 1379-1393 (2007) | |
| 2006 | ||
| 51 | Daniel Gildea, Giorgio Satta, Hao Zhang: Factoring Synchronous Grammars by Sorting. ACL 2006 | |
| 50 | Anna Corazza, Giorgio Satta: Cross-Entropy and Estimation of Probabilistic Context-Free Grammars. HLT-NAACL 2006 | |
| 49 | Mark-Jan Nederhof, Giorgio Satta: Estimation of Consistent Probabilistic Context-free Grammars. HLT-NAACL 2006 | |
| 48 | Mark-Jan Nederhof, Giorgio Satta: Probabilistic parsing strategies. J. ACM 53(3): 406-436 (2006) | |
| 2005 | ||
| 47 | Giorgio Satta, Enoch Peserico: Some Computational Complexity Results for Synchronous Context-Free Grammars. HLT/EMNLP 2005 | |
| 2004 | ||
| 46 | Mark-Jan Nederhof, Giorgio Satta: Probabilistic Parsing Strategies. ACL 2004: 542-549 | |
| 45 | Mark-Jan Nederhof, Giorgio Satta: An Alternative Method of Training Probabilistic LR Parsers. ACL 2004: 550-557 | |
| 44 | I. Dan Melamed, Giorgio Satta, Benjamin Wellington: Generalized Multitext Grammars. ACL 2004: 661-668 | |
| 43 | Alberto Apostolico, Cinzia Pizzi, Giorgio Satta: Optimal Discovery of Subword Associations in Strings. Discovery Science 2004: 270-277 | |
| 42 | Mark-Jan Nederhof, Giorgio Satta: Tabular Parsing CoRR cs.CL/0404009: (2004) | |
| 41 | Mark-Jan Nederhof, Giorgio Satta: The language intersection problem for non-recursive context-free grammars. Inf. Comput. 192(2): 172-184 (2004) | |
| 40 | 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 | ||
| 39 | 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 | ||
| 38 | Mark-Jan Nederhof, Giorgio Satta: Parsing non-recursive CFGs. ACL 2002: 112-119 | |
| 37 | Mark-Jan Nederhof, Giorgio Satta: Probabilistic Parsing Strategies. DCFS 2002: 216-230 | |
| 36 | Mark-Jan Nederhof, Giorgio Satta: Probabilistic Parsing Strategies CoRR cs.CL/0211017: (2002) | |
| 2000 | ||
| 35 | Mark-Jan Nederhof, Giorgio Satta: Left-To-Right Parsing and Bilexical Context-Free Grammars. ANLP 2000: 272-279 | |
| 34 | Fabio Ciravegna, Alberto Lavelli, Giorgio Satta: Bringing Information Extraction out of the Labs: the NoName Environment. ECAI 2000: 416-420 | |
| 1999 | ||
| 33 | Jason Eisner, Giorgio Satta: Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars. ACL 1999 | |
| 32 | Owen Rambow, Giorgio Satta: Independent Parallelism in Finite Copying Parallel Rewriting Systems. Theor. Comput. Sci. 223(1-2): 87-120 (1999) | |
| 1998 | ||
| 31 | Giorgio Satta, William Schuler: Restrictions on Tree Adjoining Languages. COLING-ACL 1998: 1176-1182 | |
| 30 | Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta: Prefix Probabilities from Stochastic Tree Adjoining Grammars. COLING-ACL 1998: 953-959 | |
| 29 | Mark-Jan Nederhof, Giorgio Satta: A Variant of Earley Parsing CoRR cmp-lg/9808017: (1998) | |
| 28 | Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta: Prefix Probabilities from Stochastic Tree Adjoining Grammars CoRR cs.CL/9809026: (1998) | |
| 27 | Giorgio Satta, William Schuler: Restrictions on Tree Adjoining Languages CoRR cs.CL/9810015: (1998) | |
| 26 | Robert Frank, Giorgio Satta: Optimality Theory and the Generative Complexity of Constraint Violability. Computational Linguistics 24(2): 307-315 (1998) | |
| 25 | Giorgio Satta: Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems. J. Comput. Syst. Sci. 56(1): 27-45 (1998) | |
| 1997 | ||
| 24 | Giorgio Satta, John C. Henderson: String Transformation Learning. ACL 1997: 444-451 | |
| 23 | Mark-Jan Nederhof, Giorgio Satta: A Variant of Early Parsing. AI*IA 1997: 84-95 | |
| 1996 | ||
| 22 | Owen Rambow, Giorgio Satta: Synchronous Models of Language. ACL 1996: 116-123 | |
| 21 | Mark-Jan Nederhof, Giorgio Satta: Efficient Tabular LR Parsing. ACL 1996: 239-247 | |
| 20 | Giorgio Satta, Eric Brill: Efficient Transformation-Based Parsing. ACL 1996: 255-262 | |
| 19 | Mark-Jan Nederhof, Giorgio Satta: Efficient Tabular LR Parsing CoRR cmp-lg/9605018: (1996) | |
| 18 | Owen Rambow, Giorgio Satta: Synchronous Models of Language CoRR cmp-lg/9605032: (1996) | |
| 17 | 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 | ||
| 16 | Giorgio Satta: The Membership Problem for Unordered Vector Languages. Developments in Language Theory 1995: 267-275 | |
| 1994 | ||
| 15 | Mark-Jan Nederhof, Giorgio Satta: An Extended Theory of Head-Driven Parsing. ACL 1994: 210-217 | |
| 14 | Owen Rambow, Giorgio Satta: A Rank Hierarchy for Determinsitic Tree-Walking Transducers. CAAP 1994: 309-321 | |
| 13 | Giorgio Satta, Oliviero Stock: Bidirectional Context-Free Grammar Parsing for Natural Language Processing. Artif. Intell. 69(1-2): 123-164 (1994) | |
| 12 | Giorgio Satta: Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication. Computational Linguistics 20(2): 173-191 (1994) | |
| 11 | 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) | |
| 1993 | ||
| 10 | Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta: Language modeling using stochastic context-free grammars. Speech Communication 13(1-2): 163-170 (1993) | |
| 1992 | ||
| 9 | Anna Corazza, Renato de Mori, Giorgio Satta: Computation of Upper-Bounds for Stochastic Context-Free Languages. AAAI 1992: 344-349 | |
| 8 | Giorgio Satta: Recognition of Linear Context-Free Rewriting Systems. ACL 1992: 89-95 | |
| 1991 | ||
| 7 | Giorgio Satta, Oliviero Stock: A Tabular Method for Island-Driven Context-Free Grammar Parsing. AAAI 1991: 143-148 | |
| 6 | Alberto Lavelli, Giorgio Satta: Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars. EACL 1991: 27-32 | |
| 5 | Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta: Computation of upper-bounds for island-driven stochastic parsers. EUROSPEECH 1991 | |
| 4 | 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 | ||
| 3 | Alessandra Giorgi, Fabio Pianesi, Giorgio Satta: A Computational Approach to Binding Theory. COLING 1990: 120-125 | |
| 2 | A. Corazzat, Renato de Mori, Roberto Gretter, Giorgio Satta: Computation of probabilities for island-driven parsers. ICSLP 1990 | |
| 1989 | ||
| 1 | Giorgio Satta, Oliviero Stock: Formal Properties and Implementation of Bidirectional Charts. IJCAI 1989: 1480-1485 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page