Neelesh Bodas | |
|---|---|
| Occupations | Software engineer, Sanskrit scholar |
| Known for | Creator of Ashtadhyayi.com, critique of Rishi Rajpopat's Cambridge thesis |
| Website | ashtadhyayi |
Neelesh Bodas is a software engineer, Sanskrit scholar, and digital humanities developer best known for creating Ashtadhyayi.com, a comprehensive digital platform for studying Pāṇini's Sanskrit grammar.[1] He is also recognized for his detailed scholarly critique of Dr. Rishi Rajpopat's 2022 Cambridge thesis regarding Pāṇinian rule conflict resolution.[2] He was also awarded Sanskrit Seva Vrati by CSU, SLBNSU and others combinedly for his contributions to Sanskrit.[3]
Bodas is the founder and lead developer of Ashtadhyayi.com, an online repository and search engine dedicated to the Aṣṭādhyāyī and its classical commentaries.[4][5] The platform digitizes foundational texts of traditional Sanskrit grammar, including the Sūtrapāṭha, Dhātupāṭha, Gaṇapāṭha, and Uṇādipāṭha, alongside classical commentaries such as the Kāśikāvṛtti, Siddhānta Kaumudī, and Mahābhāṣyam.[6]
The project relies heavily on rule-based programming and crowdsourced corrections, making it a widely used primary reference tool in Sanskrit computational linguistics and by students of Vyākaraṇa (grammar).[7] Bodas's technological stack and data curation for the site have also inspired and supported other digital Sanskrit initiatives.[1]
In addition to his software contributions, Bodas is a teacher of Pāṇinian grammar. He has conducted structured online courses on Sanskrit suffixes (Pratyaya) and syntax (Kāraka) in collaboration with institutions like Vyoma Samskrta Pathasala and the Sanskrit Department of Ramnarain Ruia Autonomous College.[8]
In December 2022, Bodas gained prominence in academic and linguistic circles following widespread media coverage of Dr. Rishi Rajpopat's Cambridge PhD thesis, In Pāṇini We Trust, which claimed to have solved a 2,500-year-old grammatical puzzle related to the metarule 1.4.2 (vipratiṣedhe paraṃ kāryam).[9][10][11]
Bodas authored one of the earliest and most detailed rule-by-rule refutations of the thesis. In his critique, he argued that Rajpopat's proposed algorithm resulted in counter-examples and required the unfeasible reinterpretation or reordering of traditional sūtras to function correctly. [6] His critical analysis, alongside the critiques published by Sanskrit computational linguist Peter M. Scharf, was cited in university linguistics courses (such as at Stanford University) as part of the academic counter-response to Rajpopat's algorithm.[11]
{{cite web}}: CS1 maint: numeric names: authors list (link)