This map shows the geographic impact of Giorgio Satta's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Giorgio Satta with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Giorgio Satta more than expected).
This network shows the impact of papers produced by Giorgio Satta. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Giorgio Satta. The network helps show where Giorgio Satta may publish in the future.
Co-authorship network of co-authors of Giorgio Satta
This figure shows the co-authorship network connecting the top 25 collaborators of Giorgio Satta.
A scholar is included among the top collaborators of Giorgio Satta based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Giorgio Satta. Giorgio Satta is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Satta, Giorgio, et al.. (2013). A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy. Research Padua Archive (University of Padua). 135–144.18 indexed citations
2.
Cohen, Shay B., Carlos Gómez‐Rodríguez, & Giorgio Satta. (2011). Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing.12 indexed citations
3.
Cohen, Shay B., Carlos Gómez‐Rodríguez, & Giorgio Satta. (2011). Exact Inference for Generative Probabilistic Non-Projective Dependency Parsing. Edinburgh Research Explorer (University of Edinburgh). 1234–1245.14 indexed citations
4.
Crescenzi, Pierluigi, Daniel Gildea, Andrea Marino, Gianluca Del Rossi, & Giorgio Satta. (2011). Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. CINECA IRIS Institutial research information system (University of Pisa). 1. 450–459.4 indexed citations
5.
Nederhof, Mark-Jan & Giorgio Satta. (2011). Computation of Infix Probabilities for Probabilistic Context-Free Grammars. St Andrews Research Repository (St Andrews Research Repository). 1213–1221.5 indexed citations
6.
Gómez‐Rodríguez, Carlos, Marco Kuhlmann, & Giorgio Satta. (2010). Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems. North American Chapter of the Association for Computational Linguistics. 276–284.26 indexed citations
7.
Kuhlmann, Marco, Alexander Koller, & Giorgio Satta. (2010). The Importance of Rule Restrictions in CCG. Meeting of the Association for Computational Linguistics. 534–543.5 indexed citations
8.
Maletti, Andreas & Giorgio Satta. (2010). Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. Meeting of the Association for Computational Linguistics. 19–27.2 indexed citations
9.
Sagot, Benoît & Giorgio Satta. (2010). Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two. HAL (Le Centre pour la Communication Scientifique Directe). 525–533.7 indexed citations
10.
Bosco, Cristina, Alessandro Mazzei, Vincenzo Lombardo, et al.. (2008). Comparing Italian parsers on a common treebank: the Evalita experience. Language Resources and Evaluation. 2066–2073.9 indexed citations
11.
Shen, Libin, Giorgio Satta, & Aravind K. Joshi. (2007). Guided Learning for Bidirectional Sequence Classification. Meeting of the Association for Computational Linguistics. 760–767.112 indexed citations
12.
Satta, Giorgio. (2004). 42th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference. Meeting of the Association for Computational Linguistics.10 indexed citations
13.
Satta, Giorgio. (2004). 20th International Conference on Computational Linguistics, Proceedings of the Conference. Meeting of the Association for Computational Linguistics.1 indexed citations
14.
Satta, Giorgio & Stuart M. Shieber. (2003). Partially ordered multiset context-free grammars and free-word-order parsing. Data Archiving and Networked Services (DANS). 171–182.1 indexed citations
Satta, Giorgio. (1995). The Membership Problem for Unordered Vector Languages.. Research Padua Archive (University of Padua). 267–275.1 indexed citations
Satta, Giorgio & Oliviero Stock. (1991). A tabular method for island-driven context-free grammar parsing. Research Padua Archive (University of Padua). 143–148.2 indexed citations
20.
Satta, Giorgio & Oliviero Stock. (1989). Head-Driven Bidirectional Parsing: A Tabular Method. Research Padua Archive (University of Padua). 43–51.12 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.