Poetry to Prose Conversion in Sanskrit as a Linearisation Task: A Case for Low-Resource Languages (P19-1)
Copied to clipboard
| Challenge: | Obtaining the proper word ordering, called as the prose ordering, from a verse is often considered a task which requires linguistic expertise. |
| Approach: | They propose a word ordering (linearisation) task that ignores the word arrangement at the verse side. |
| Outcome: | The proposed model outperforms current models in word ordering for the translation task in Sanskrit. |
Similar Papers
Chandomitra: Towards Generating Structured Sanskrit Poetry from Natural Language Inputs (2026.eacl-long)
Copied to clipboard
Manoj Balaji Jagadeeshan, Samarth Bhatia, Pretam Ray, Harshul Raj Surana, Akhil Rajeev P, Priya Mishra, Annarao Kulkarni, Ganesh Ramakrishnan, Prathosh Ap, Pawan Goyal
| Challenge: | Large language models are capable of creative generation tasks but prominently for high-resource languages. |
| Approach: | They propose to use large language models for structured poetry generation in Sanskrit . their constrained decoding method achieves 99.86% syntactic accuracy . |
| Outcome: | The proposed model outperforms the existing model in generating metrically valid Sanskrit poetry. |
Building a Word Segmenter for Sanskrit Overnight (L18-1)
Copied to clipboard
| Challenge: | Sanskrit word segmentation is challenging due to the issue of Sandhi . digitisation efforts have made the manuscripts available in the public domain . |
| Approach: | They propose a deep sequence to sequence model that takes only the sandhied string as input and predicts the unsandhized string. |
| Outcome: | The proposed model improves on the current state of the art by 16.79% . the system can be trained "overnight" and be used for production . |
On the Role of Pre-trained Language Models in Word Ordering: A Case Study with BART (2022.coling-1)
Copied to clipboard
| Challenge: | Existing work uses linear models and neural networks for word ordering, yet pre-trained language models have not been studied in word ordering. |
| Approach: | They propose a constrained language generation task using unordered words as input. |
| Outcome: | The proposed model is able to perform better than existing models and proves to be reliable. |
Addressing word-order Divergence in Multilingual Neural Machine Translation for extremely Low Resource Languages (N19-1)
Copied to clipboard
| Challenge: | Existing studies show that transfer learning works best when the languages are related. |
| Approach: | They propose to pre-order assisting language sentences to match the word order of the source language and train the parent model. |
| Outcome: | The proposed model can improve translation quality in low-resource scenarios by pre-ordering the assisting language sentences to match the word order of the source language and training the parent model. |
Free as in Free Word Order: An Energy Based Model for Word Segmentation and Morphological Tagging in Sanskrit (D18-1)
Copied to clipboard
Amrith Krishna, Bishal Santra, Sasi Prasanth Bandaru, Gaurav Sahu, Vishnu Dutt Sharma, Pavankumar Satuluri, Pawan Goyal
| Challenge: | a structured prediction framework is proposed to solve word segmentation and morphological tagging tasks in a free word order language. |
| Approach: | They propose a structured prediction framework that jointly solves word segmentation and morphological tagging tasks in Sanskrit. |
| Outcome: | The proposed model outperforms the state of the art with an F-Score of 96.92 (percentage improvement of 7.06%) while using less than one tenth of the task-specific training data. |
Translate First Reorder Later: Leveraging Monotonicity in Semantic Parsing (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing approaches that model alignments between sentences fail at compositional generalization tasks, resulting in a resurgence of such approaches. |
| Approach: | They propose a two-step approach that first translates input sentences monotonically and then reorders them to obtain the correct output. |
| Outcome: | The proposed approach improves compositional generalization over existing models and other approaches that exploit gold alignment annotations. |
One Model is All You Need: ByT5-Sanskrit, a Unified Model for Sanskrit NLP Tasks (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Morphologically rich languages are notoriously challenging to process for downstream NLP applications. |
| Approach: | They propose a pretrained model for NLP applications involving the morphologically rich language Sanskrit that outperforms previous models by a considerable margin. |
| Outcome: | The proposed model outperforms tokenized models on established Sanskrit word segmentation tasks and matches the current best lexicon-based model. |
TransLIST: A Transformer-Based Linguistically Informed Sanskrit Tokenizer (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to SWS fail when encountering out-of-vocabulary tokens . lexicon driven approaches fail when dealing with out- of-vocal tokens, authors say . |
| Approach: | They propose a novel lexicon-driven shallow parser that takes into account sandhi phenomenon . they propose linguistically informed Sanskrit tokenizer module that encodes character input . |
| Outcome: | The proposed system outperforms the current state-of-the-art system by 7.2 points absolute gain on the benchmark datasets. |
Samayik: A Benchmark and Dataset for English-Sanskrit Translation (2024.lrec-main)
Copied to clipboard
Ayush Maheshwari, Ashim Gupta, Amrith Krishna, Atul Kumar Singh, Ganesh Ramakrishnan, Anil Kumar Gourishetty, Jitin Singla
| Challenge: | Existing Sanskrit corpora focus on poetry and offer limited coverage of contemporary written materials. |
| Approach: | They release a dataset of 53,000 parallel English-Sanskrit sentences . they use spoken content that covers contemporary world affairs and interpretations . |
| Outcome: | a new dataset of 53,000 parallel English-Sanskrit sentences is released . the dataset outperforms existing models trained on older classical-era poetry datasets . |
Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations (P19-2)
Copied to clipboard
| Challenge: | Neural models at the sentence level often need to model the interaction between words . however, there is no guarantee that the standard ordering of words is computationally efficient or optimal . |
| Approach: | They propose to use a dependency parse as a proxy for inter-word dependencies in a sentence to simplify the sentence with combinatorial objectives imposed on the sentence-parse pair. |
| Outcome: | The proposed model improves classification accuracy and reduces classification error by 2.0% over the previous state of the art. |