PAPranav Anand

Pranav Anand

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pranav Anand has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • The Domain of Formal Matching in Sluicing

    by Pranav Anand, Daniel Hardt, James McCloskey

    This article is concerned with the role of syntax in the licensing of sluicing in English. It amends and provides new support for a proposal made by Rudin (2019) in which syntax plays a crucial but circumscribed role: crucial in that antecedents are required; circumscribed in that matching with an antecedent holds only with respect to a proper subpart of the elided clause—its argumental core.


  • Open Access

    Pragmatic representations and online comprehension: Lessons from direct discourse and causal adjuncts

    by John Duff, Pranav Anand, Adrian Brasoveanu, Amanda Rysling

    Studies on the reading of appositive relative clauses (ARCs) have found that ARCs seem to exhibit less influence in later parsing and decision-making than similar constructions (Dillon et al. 2014, 2017), a pattern we call discounting. Existing accounts often link discounting to the status of ARCs as independent segments in systems of pragmatic representation. This would predict discounting for other constructions as well. In this study, we test that prediction by investigating the reading of direct discourse speech reports and causal adjuncts in English. Diagnostics supplied by the theoretical literature show that these constructions contribute the same independent segments as ARCs in two different systems of pragmatic organization: direct discourse reports contribute an independent speech act, and causal adjuncts contribute their own discourse units. Nevertheless, in a series of five experiments, we find no evidence of ARC-like discounting for either. We conclude that discounting should not be linked to either of these pragmatic representations, and discuss the outlook for other approaches to the phenomenon.


  • Open Access

    How to theorize about subjective language: a lesson from ‘de re’

    by Pranav Anand, Natasha Korotkova

    Subjective language has attracted substantial attention in the recent literature in formal semantics and philosophy of language (see overviews in MacFarlane in Assessment sensitivity: relative truth and its applications, Oxford University Press, Oxford, 2014; van Wijnbergen-Huitink, in Meier, and van Wijnbergen-Huitink (eds) Subjective meaning: alternatives to relativism, De Gruyter, Berlin, pp 1–19, 2016; Lasersohn in Subjectivity and perspective in truth-theoretic semantics, Oxford University Press, Oxford, 2017; Vardomskaya in Sources of subjectivity, Ph.D. thesis, University of Chicago, IL, 2018; Zakkou in Faultless disagreement: a defense of contextualism in the realm of personal taste, Vittorio Klostermann, Frankfurt a. M., 2019b). Most current theories argue thatSubjective Predicates(SPs), which express matters of opinion, semantically differ from ordinary predicates, which express matters of fact. We will call this view “SP exceptionalism”. This paper addresses SP exceptionalism by scrutinizing the behavior of SPs in attitude reports, which, as we will argue, significantly constrains the space of analytical options and rules out some of the existing theories. As first noticed by Stephenson (Linguist Philos 30(4):487–525, 2007a; Towards a theory of subjective meaning, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 2007b), the most prominent reading of embedded SPs is one where they talk about the attitude holder’s subjective judgment. As is remarked sometimes (Sæbø in Linguist Philos 32(4):327–352, 2009; Pearson in J Semant 30(1):103–154, 2013a), this reading is not the only one: embedded SPs may also talk about someone else’s, non-local, judgment. We concentrate specifically on such cases and show that non-local judgment is possible if and only if SPs are used within a DP that is outside main predicate position and that entire DP is readde re. We demonstrate that the behavior of SPs in attitude reports does not differ from that of ordinary predicates: it follows from general constraints on intersective modification and intensional quantification (Farkas in Szabolcsi (ed) Ways of scope taking, Springer, Dordrecht, pp 183–215, 1997; Musan in On the temporal interpretation of noun phrases, Garland, New York, 1997; Percus in Nat Lang Semant 8(3):173–229, 2000; Keshet in Good intensions: paving two roads to a theory of the de re/de dicto distinction, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 2008). We argue that this unexceptional behavior of SPs in fact has unexpected consequences for SP exceptionalism. Precisely because SPs have been argued to be semantically different from ordinary predicates, not all theories correctly predict these less-studied data: some overgenerate (e.g. Stephenson 2007a, b; Stojanovic in Linguist Philos 30(6):691–706, 2007; Sæbø 2009) and some undergenerate (e.g. McCready in McNally, and Puig-Waldmüller (ed) Proceedings of Sinn und Bedeutung, vol 11, pp 433–447, 2007; Pearson 2013a). Out of the currently available theories, only relativist accounts (Lasersohn in Linguist Philos 28(6):643–686, 2005; MacFarlane 2014; Bylinina in J Semant 34(2), 291–331, 2017; Coppock in Linguist Philos 41(2):125–164, 2018) predict the right interpretation, and only that interpretation. We thus present a novel empirical argument for relativism, and, more generally, formulate a constraint that has to be taken into consideration by any view that advocates SP exceptionalism.


  • Open Access

    Bio-inspired Structure Identification in Language Embeddings

    by Hongwei, Henry Zhou, Oskar Elek, Pranav Anand, Angus G. Forbes

    Word embeddings are a popular way to improve downstream performances in contemporary language modeling. However, the underlying geometric structure of the embedding space is not well understood. We present a series of explorations using bio-inspired methodology to traverse and visualize word embeddings, demonstrating evidence of discernible structure. Moreover, our model also produces word similarity rankings that are plausible yet very different from common similarity metrics, mainly cosine similarity and Euclidean distance. We show that our bio-inspired model can be used to investigate how different word embedding techniques result in different semantic outputs, which can emphasize or obscure particular interpretations in textual data.


  • Open Access

    Linguistic Reflexes of Well-Being and Happiness in Echo

    by Jiaqi Wu, Marilyn Walker, Pranav Anand, Steve Whittaker

    Different theories posit different sources for feelings of well-being and happiness. Appraisal theory grounds our emotional responses in our goals and desires and their fulfillment, or lack of fulfillment. Self Determination theory posits that the basis for well-being rests on our assessment of our competence, autonomy, and social connection. And surveys that measure happiness empirically note that people require their basic needs to be met for food and shelter, but beyond that tend to be happiest when socializing, eating or having sex. We analyze a corpus of private microblogs from a well-being application called ECHO, where users label each written post about daily events with a happiness score between 1 and 9. Our goal is to ground the linguistic descriptions of events that users experience in theories of well-being and happiness, and then examine the extent to which different theoretical accounts can explain the variance in the happiness scores. We show that recurrent event types, such as OBLIGATION and INCOMPETENCE, which affect people's feelings of well-being are not captured in current lexical or semantic resources.

  • Open Access

    Argument Strength is in the Eye of the Beholder: Audience Effects in Persuasion

    by Stephanie M. Lukin, Pranav Anand, Marilyn Walker, Steve Whittaker

    Americans spend about a third of their time online, with many participating in online conversations on social and political issues. We hypothesize that social media arguments on such issues may be more engaging and persuasive than traditional media summaries, and that particular types of people may be more or less convinced by particular styles of argument, e.g. emotional arguments may resonate with some personalities while factual arguments resonate with others. We report a set of experiments testing at large scale how audience variables interact with argument style to affect the persuasiveness of an argument, an under-researched topic within natural language processing. We show that belief change is affected by personality factors, with conscientious, open and agreeable people being more convinced by emotional arguments.


  • Open Access

    Modelling Protagonist Goals and Desires in First-Person Narrative

    by Elahe Rahimtoroghi, Jiaqi Wu, Ruimin Wang, Pranav Anand, Marilyn A Walker

    Many genres of natural language text are narratively structured, a testament to our predilection for organizing our experiences as narratives. There is broad consensus that understanding a narrative requires identifying and tracking the goals and desires of the characters and their narrative outcomes. However, to date, there has been limited work on computational models for this problem. We introduce a new dataset, DesireDB, which includes gold-standard labels for identifying statements of desire, textual evidence for desire fulfillment, and annotations for whether the stated desire is fulfilled given the evidence in the narrative context. We report experiments on tracking desire fulfillment using different methods, and show that LSTM Skip-Thought model achieves F-measure of 0.7 on our corpus.

  • On the hardness of recognizing triangular line graphs

    by Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee


  • Open Access

    On the hardness of recognizing triangular line graphs

    by Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee

    Given a graph G, its triangular line graph is the graph T(G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G as well as being within a common triangle. Graphs with a representation as the triangular line graph of some graph G are triangular line graphs, which have been studied under many names including anti-Gallai graphs, 2-in-3 graphs, and link graphs. While closely related to line graphs, triangular line graphs have been difficult to understand and characterize. Van Bang Le asked if recognizing triangular line graphs has an efficient algorithm or is computationally complex. We answer this question by proving that the complexity of recognizing triangular line graphs is NP-complete via a reduction from 3-SAT.