--- title: "Srinivas Bangalore — author profile and papers" description: "Srinivas Bangalore: 2 papers on Elamur Research (1999–2000), h-index 32 — affiliations, topics, co-authors and who cites them in our library." canonical: "https://research.elamur.ai/free/en/authors/srinivas-bangalore/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/srinivas-bangalore/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Srinivas Bangalore # Srinivas Bangalore Srinivas Bangalore has 2 papers in our library, in 1999–2000; often with [Aravind Joshi](https://md.research.elamur.ai/free/en/authors/aravind-joshi/), [Owen Rambow](https://md.research.elamur.ai/free/en/authors/owen-rambow/). 2 papers in our library · 1999–2000 [OpenAlex](https://openalex.org/A5111475783) · [**h-index 32**](https://openalex.org/authors/A5111475783) · [172 works](https://openalex.org/works?filter=author.id:A5111475783) · [3,713 citations](https://openalex.org/works?filter=author.id:A5111475783&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/srinivas-bangalore/#papers) · [🔗 261 citations in our library](https://md.research.elamur.ai/free/en/authors/srinivas-bangalore/cited-by/) · [⭐ Paper Star rank #2543](https://md.research.elamur.ai/free/en/paper-stars/page/26/#star-2543) 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=Srinivas+Bangalore) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Srinivas+Bangalore) · [dblp](https://dblp.org/search?q=Srinivas+Bangalore) · [ACL Anthology](https://aclanthology.org/search/?q=Srinivas+Bangalore) ## Affiliations [🏢**AT&T** Bedminster · United States 1998–2016 · 103 papers](https://md.research.elamur.ai/free/en/companies/at-t/) · [🎓**University of Copenhagen** Copenhagen · Denmark 2020–2021 · 2 papers](https://md.research.elamur.ai/free/en/universities/university-of-copenhagen/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 2 more institutions on single bylines are not listed. ## Concepts, shelves and topics Of its works in our library: the number of works on each and its rating among them. 📚 Shelves 4[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/) ## Works by year ### 2000s [**2000** 1 paper](https://md.research.elamur.ai/free/en/papers/bangalore-2000-exploiting-probabilistic-hierarchical-model-generation/) ### 1990s [**1999** 1 paper](https://md.research.elamur.ai/free/en/papers/bangalore-1999-supertagging-approach-almost-parsing/) ## Papers The most cited first (OpenAlex and our library). 1. **[Supertagging: An Approach to Almost Parsing](https://md.research.elamur.ai/free/en/papers/bangalore-1999-supertagging-approach-almost-parsing/)** *(1999 · 567 citations)* Bangalore and Joshi tackle robust parsing. Their aim is to keep the precision of linguistically rich lexical descriptions while gaining the coverage of statistical methods. In Lexicalized Tree-Adjoining Grammar (LTAG), each word maps to elementary trees called supertags . A supertag holds exactly the elements the… 2. **[Exploiting a Probabilistic Hierarchical Model for Generation](https://md.research.elamur.ai/free/en/papers/bangalore-2000-exploiting-probabilistic-hierarchical-model-generation/)** *(2000 · 238 citations)* Bangalore and Rambow ask whether a statistical sentence generator does better when it uses explicit syntactic trees and a grammar, not only an n-gram model over strings. Earlier stochastic generators, such as Langkilde and Knight's Nitrogen, use no tree representation. The authors built Fergus, which has three stages: ## Co-authors here 2 co-authors with a page, the most papers together first. - [Aravind Joshi](https://md.research.elamur.ai/free/en/authors/aravind-joshi/) - [Owen Rambow](https://md.research.elamur.ai/free/en/authors/owen-rambow/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Computational Linguistics](https://md.research.elamur.ai/free/en/venues/cl/): [1999](https://md.research.elamur.ai/free/en/venues/cl/1999/) - [International Conference on Computational Linguistics…](https://md.research.elamur.ai/free/en/venues/coling/): [2000](https://md.research.elamur.ai/free/en/venues/coling/2000/) ## Cited by Papers of our library cite their works 261 times (of the 141,840 papers whose bibliographies we read); [32 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/srinivas-bangalore/cited-by/). Updated 24 October 2026