| Guided learning for bidirectional sequence classification L Shen, G Satta, A Joshi Proceedings of the 45th annual meeting of the association of computational …, 2007 | 231 | 2007 |
| Efficient parsing for bilexical context-free grammars and head automaton grammars J Eisner, G Satta Proceedings of the 37th Annual Meeting of the Association for Computational …, 1999 | 194 | 1999 |
| Optimality theory and the generative complexity of constraint violability R Frank, G Satta Computational linguistics 24 (2), 307-315, 1998 | 188 | 1998 |
| On the complexity of non-projective data-driven dependency parsing R McDonald, G Satta | 153 | 2007 |
| An incremental parser for abstract meaning representation M Damonte, SB Cohen, G Satta arXiv preprint arXiv:1608.06111, 2016 | 152 | 2016 |
| Dynamic programming algorithms for transition-based dependency parsers M Kuhlmann, C Gómez-Rodríguez, G Satta Proceedings of the 49th Annual Meeting of the Association for Computational …, 2011 | 113 | 2011 |
| Efficient text fingerprinting via Parikh mapping A Amir, A Apostolico, GM Landau, G Satta Journal of Discrete Algorithms 1 (5-6), 409-421, 2003 | 74 | 2003 |
| Generalized multitext grammars ID Melamed, G Satta, B Wellington Proceedings of the 42nd Annual Meeting of the Association for Computational …, 2004 | 73 | 2004 |
| Some computational complexity results for synchronous context-free grammars G Satta, E Peserico Proceedings of the conference on Human Language Technology and Empirical …, 2005 | 67 | 2005 |
| Independent parallelism in finite copying parallel rewriting systems O Rambow, G Satta Theoretical Computer Science 223 (1-2), 87-120, 1999 | 63 | 1999 |
| A polynomial-time dynamic oracle for non-projective dependency parsing C Gómez-Rodríguez, F Sartorio, G Satta Proceedings of the 2014 Conference on Empirical Methods in Natural Language …, 2014 | 57 | 2014 |
| Treebank grammar techniques for non-projective dependency parsing M Kuhlmann, G Satta Proceedings of the 12th Conference of the European Chapter of the ACL (EACL …, 2009 | 57 | 2009 |
| Symbol–relation grammars: a formalism for graphical languages F Ferrucci, G Pacini, G Satta, MI Sessa, G Tortora, M Tucci, G Vitiello Information and Computation 131 (1), 1-46, 1996 | 57 | 1996 |
| Computation of Probabilities A Corazza, R De Mori, R Gretter, G Satta IEEE Transactions on Pattern Analysis and Machine Intelligence 13 (9), 1991 | 57 | 1991 |
| Probabilistic parsing as intersection MJ Nederhof, G Satta Proceedings of the Eighth International Conference on Parsing Technologies …, 2003 | 56 | 2003 |
| Tree-adjoining grammar parsing and boolean matrix multiplication G Satta Computational linguistics 20 (2), 173-191, 1994 | 56 | 1994 |
| Bidirectional context-free grammar parsing for natural language processing G Satta, O Stock Artificial Intelligence 69 (1-2), 123-164, 1994 | 48 | 1994 |
| Recognition of linear context-free rewriting systems G Satta 30th Annual Meeting of the Association for Computational Linguistics, 89-95, 1992 | 43 | 1992 |
| Efficient parsing of well-nested linear context-free rewriting systems C Gómez-Rodríguez, M Kuhlmann, G Satta Human Language Technologies: The 2010 Annual Conference of the North …, 2010 | 41 | 2010 |
| Optimal reduction of rule length in linear context-free rewriting systems C Gómez-Rodríguez, M Kuhlmann, G Satta, D Weir Proceedings of Human Language Technologies: The 2009 Annual Conference of …, 2009 | 38 | 2009 |
Mark-Jan NederhofUniversity of St AndrewsVerified email at st-andrews.ac.uk
