--- title: "Poulomi Pal — author profile and papers · Text generation" description: "Poulomi Pal: 2 papers on Elamur Research (2020) — affiliations, topics, co-authors and who cites them in our library." canonical: "https://research.elamur.ai/free/en/authors/poulomi-pal/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/poulomi-pal/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Poulomi Pal # Poulomi Pal Poulomi Pal has 2 papers in our library, in 2020, most of them on [Text generation](https://md.research.elamur.ai/free/en/topics/text-generation/), [English](https://md.research.elamur.ai/free/en/topics/english/); often with [Tom Williams](https://md.research.elamur.ai/free/en/authors/tom-williams/). 2 papers in our library · 2020 No OpenAlex profile matched yet. [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/poulomi-pal/#papers) · 🔗 Cited 2 times in our library · [⭐ Paper Stars ranking: #6215](https://md.research.elamur.ai/free/en/paper-stars/page/63/#star-6215) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Poulomi+Pal) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Poulomi+Pal) · [dblp](https://dblp.org/search?q=Poulomi+Pal) · [ACL Anthology](https://aclanthology.org/search/?q=Poulomi+Pal) ## Concepts, shelves and topics Of its works in our library: the number of works on each and its rating among them. 📚 Shelves 6 The field of science this work belongs to (OpenAlex fields).[Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Arts and Humanities · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Language and Linguistics · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · [Psychology · 1 work](https://md.research.elamur.ai/free/en/shelves/psychology/) · [Social Psychology · 1 work](https://md.research.elamur.ai/free/en/shelves/psychology/social-psychology/) 🧭 Topics 2 Research subjects and languages the work is about.[English · 1 work](https://md.research.elamur.ai/free/en/topics/english/) · [Text generation · 1 work](https://md.research.elamur.ai/free/en/topics/text-generation/) ## Works by year ### 2020s [**2020** 2 papers Poulomi Pal's papers of 2020](https://md.research.elamur.ai/free/en/authors/poulomi-pal/year/2020/) ## Papers The most cited first (OpenAlex and our library). 1. **[Givenness Hierarchy Theoretic Cognitive Status Filtering](https://md.research.elamur.ai/free/en/papers/pal-2020-givenness-hierarchy-theoretic-cognitive-status/)** *(2020 · 2 citations)* Robots that talk need to pick referring forms such as "it", "this" or "that NP" the way people do. The Givenness Hierarchy (GH) ties each form to the cognitive status a referent has for the listener: in focus, activated, familiar, and so on. Earlier full-GH systems by Williams and colleagues served understanding.… 2. **[Toward Givenness Hierarchy Theoretic Natural Language Generation](https://md.research.elamur.ai/free/en/papers/pal-2020-toward-givenness-hierarchy-theoretic-natural/)** *(2020)* A robot that talks with people must choose between it, this N, that N and the N. The Givenness Hierarchy (GH) says that the form reflects the cognitive status a referent has in the hearer's mind: in focus, activated, familiar, uniquely identifiable, referential, type identifiable. Earlier work used GH data structures… ## Co-authors here 1 co-author with a page, the most papers together first. - [Tom Williams](https://md.research.elamur.ai/free/en/authors/tom-williams/) ×2 ## Cited by Papers of our library cite their works 2 times (of the 141,840 papers whose bibliographies we read). Updated 24 October 2026