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.
Semantic Parsing on Freebase from Question-Answer Pairs
2013804 citationsJonathan Berant, Percy Liang et al.profile →
Countries citing papers authored by Jonathan Berant
Since
Specialization
Citations
This map shows the geographic impact of Jonathan Berant'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 Jonathan Berant with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jonathan Berant more than expected).
This network shows the impact of papers produced by Jonathan Berant. 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 Jonathan Berant. The network helps show where Jonathan Berant may publish in the future.
Co-authorship network of co-authors of Jonathan Berant
This figure shows the co-authorship network connecting the top 25 collaborators of Jonathan Berant.
A scholar is included among the top collaborators of Jonathan Berant 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 Jonathan Berant. Jonathan Berant is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chen, Liang, Mohammad Norouzi, Jonathan Berant, Quoc V. Le, & Ni Lao. (2018). Memory Augmented Policy Optimization for Program Synthesis with Generalization. arXiv (Cornell University).4 indexed citations
9.
Herzig, Roei, et al.. (2018). Mapping Images to Scene Graphs with Permutation-Invariant Structured Prediction. Neural Information Processing Systems. 31. 7211–7221.18 indexed citations
Melamud, Oren, Jonathan Berant, Ido Dagan, Jacob Goldberger, & Idan Szpektor. (2013). A Two Level Model for Context Sensitive Inference Rules. Meeting of the Association for Computational Linguistics. 1331–1340.15 indexed citations
14.
Adler, Meni, Jonathan Berant, & Ido Dagan. (2012). Entailment-based Text Exploration with Application to the Health-care Domain. Meeting of the Association for Computational Linguistics. 79–84.10 indexed citations
15.
Berant, Jonathan, Ido Dagan, Meni Adler, & Jacob Goldberger. (2012). Efficient Tree-based Approximation for Entailment Graph Learning. Meeting of the Association for Computational Linguistics. 1. 117–125.15 indexed citations
16.
Berant, Jonathan, et al.. (2012). Learning Verb Inference Rules from Linguistically-Motivated Evidence. Empirical Methods in Natural Language Processing. 194–204.14 indexed citations
17.
Berant, Jonathan, Ido Dagan, & Jacob Goldberger. (2011). Global Learning of Typed Entailment Rules. Meeting of the Association for Computational Linguistics. 610–619.80 indexed citations
18.
Mirkin, Shachar, Jonathan Berant, Ido Dagan, & Eyal Shnarch. (2010). Recognising Entailment within Discourse. International Conference on Computational Linguistics. 770–778.6 indexed citations
19.
Mirkin, Shachar, Roy Bar-Haim, Ido Dagan, et al.. (2009). Addressing Discourse and Document Structure in the RTE Search Task.. Theory and applications of categories.11 indexed citations
20.
Bar-Haim, Roy, Ido Dagan, Shachar Mirkin, et al.. (2008). Efficient Semantic Deduction and Approximate Matching over Compact Parse Forests.. Theory and applications of categories.23 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.