Dhineshkumar Ramasubbu
Author directory2026
PACEShop: Evaluating Personalized, Actionable, Compositional, and Evidence-grounded Shopping Assistants
Weimin Lyu | Chen Luo | Guangrui Li | Yaochen Xie | Dhineshkumar Ramasubbu | Arief Koesdwiady | Wanqiu Long | Hansu Gu | Yutong Chen | Zheshen Wang | Dakuo Wang | Yi Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Weimin Lyu | Chen Luo | Guangrui Li | Yaochen Xie | Dhineshkumar Ramasubbu | Arief Koesdwiady | Wanqiu Long | Hansu Gu | Yutong Chen | Zheshen Wang | Dakuo Wang | Yi Liu
Findings of the Association for Computational Linguistics: EMNLP 2026
Shopping assistants are shifting from ranked product lists toward structured decision support, where systems must synthesize shopper context, product evidence, and next-step guidance into a coherent recommendation experience. This changes the unit of evaluation: a fluent response can still fail by ignoring shopper context, contradicting itself across components, or leaving defects too vague to localize. Existing personalization, grounding, and LLM-as-a-judge benchmarks cover pieces of this problem, but they do not define a joint evaluation target for structured shopping-assistant responses. We formulate this missing evaluation target as PACE: Personalized, Actionable, Compositional, and Evidence-grounded evaluation. We instantiate PACE with two artifacts: PACEShop, a benchmark dataset that makes the target measurable through 22,625 controlled records with structured personas, auditable evidence pools, GOOD/BAD labels, and gold defect family and location annotations; and PACEJudge, a training-free judging protocol that makes the target reportable through a structured output contract. Our experiments show that generic judges can recognize broad quality but fail to recover the diagnostic fields required for PACE; PACEShop makes these failures verifiable, and PACEJudge improves persona-source, cross-component, grounding, and family/location closure without retraining, showing that realistic shopping-assistant evaluation requires a task-matched output contract rather than only a stronger backbone or scalar prompt.
2020
Hindi History Note Generation with Unsupervised Extractive Summarization
Aayush Shah | Dhineshkumar Ramasubbu | Dhruv Mathew | Meet Chetan Gadoya
Proceedings of the 1st Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 10th International Joint Conference on Natural Language Processing: Student Research Workshop
Aayush Shah | Dhineshkumar Ramasubbu | Dhruv Mathew | Meet Chetan Gadoya
Proceedings of the 1st Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 10th International Joint Conference on Natural Language Processing: Student Research Workshop
In this work, the task of extractive single document summarization applied to an education setting to generate summaries of chapters from grade 10 Hindi history textbooks is undertaken. Unsupervised approaches to extract summaries are employed and evaluated. TextRank, LexRank, Luhn and KLSum are used to extract summaries. When evaluated intrinsically, Luhn and TextRank summaries have the highest ROUGE scores. When evaluated extrinsically, the effective measure of a summary in answering exam questions, TextRank summaries performs the best.