Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Convolutional 2D Knowledge Graph Embeddings
20181.4k citationsPasquale Minervini, Pontus Stenetorp et al.profile →
brat: a Web-based Tool for NLP-Assisted Text Annotation
2012588 citationsPontus Stenetorp, Sampo Pyysalo et al.Conference of the European Chapter of the Association for Computational Linguisticsprofile →
Convolutional 2D Knowledge Graph Embeddings
2017325 citationsPasquale Minervini, Pontus Stenetorp et al.Zenodo (CERN European Organization for Nuclear Research)profile →
Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity
2022248 citationsYao Lu, Max Bartolo et al.Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Pontus Stenetorp
Since
Specialization
Citations
This map shows the geographic impact of Pontus Stenetorp'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 Pontus Stenetorp with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pontus Stenetorp more than expected).
Fields of papers citing papers by Pontus Stenetorp
This network shows the impact of papers produced by Pontus Stenetorp. 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 Pontus Stenetorp. The network helps show where Pontus Stenetorp may publish in the future.
Co-authorship network of co-authors of Pontus Stenetorp
This figure shows the co-authorship network connecting the top 25 collaborators of Pontus Stenetorp.
A scholar is included among the top collaborators of Pontus Stenetorp 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 Pontus Stenetorp. Pontus Stenetorp is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Lu, Yao, Max Bartolo, Alastair Moore, Sebastian Riedel, & Pontus Stenetorp. (2022). Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity. Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 8086–8098.248 indexed citations breakdown →
Bartolo, Max, et al.. (2020). Beat the AI: Investigating Adversarial Human Annotations for Reading Comprehension. Empirical Methods in Natural Language Processing.1 indexed citations
Neumann, Mark E, Pontus Stenetorp, & Sebastian Riedel. (2016). Learning to Reason with Adaptive Computation. UCL Discovery (University College London).1 indexed citations
Stenetorp, Pontus, Akiko Aizawa, Sampo Pyysalo, Sophia Ananiadou, & Goran Topić. (2012). Normalisation with the BRAT rapid annotation tool. 87–90.3 indexed citations
17.
Stenetorp, Pontus, Sampo Pyysalo, Goran Topić, et al.. (2012). brat: a Web-based Tool for NLP-Assisted Text Annotation. Conference of the European Chapter of the Association for Computational Linguistics. 25(8). 102–107.588 indexed citations breakdown →
18.
Stenetorp, Pontus, Goran Topić, Sampo Pyysalo, et al.. (2011). BioNLP Shared Task 2011: Supporting Resources. Meeting of the Association for Computational Linguistics. 112–103.37 indexed citations
19.
Stenetorp, Pontus, Sampo Pyysalo, & Jun’ichi Tsujii. (2011). SimSem: Fast Approximate String Matching in Relation to Semantic Category Disambiguation. Meeting of the Association for Computational Linguistics. 136–145.4 indexed citations
20.
Stenetorp, Pontus, Sampo Pyysalo, Sophia Ananiadou, & J Tsujii. (2011). Almost Total Recall: Semantic Category Disambiguation Using Large Lexical Resources and Approximate String Matching. Research Explorer (The University of Manchester).2 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.