Challenge: Morphologically rich languages benefit from joint processing of morphology and syntax, as compared to pipeline architectures.
Approach: They propose a graph-based model for joint morphological parsing and dependency parser in Sanskrit using the Energy based model framework.
Outcome: The proposed model outperforms standalone morphological parsers in morphology and syntax parsing, and in dependency parser.

Similar Papers

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.
A Truly Joint Neural Architecture for Segmentation and Parsing (2024.eacl-long)

Copied to clipboard

Challenge: Contemporary multilingual dependency parsers can parse a diverse set of languages, but performance is lower for Morphologically Rich Languages.
Approach: They propose a joint neural architecture where a lattice-based representation is provided to an arc-factored model and solves the morphological segmentation and syntactic parsing tasks at once.
Outcome: The proposed architecture is language-agnostic and language-based to improve on Hebrew . it shows that the proposed model can parse morphological segmentation and syntactic parsing tasks at once.
Free as in Free Word Order: An Energy Based Model for Word Segmentation and Morphological Tagging in Sanskrit (D18-1)

Copied to clipboard

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.
A Graph-based Model for Joint Chinese Word Segmentation and Dependency Parsing (2020.tacl-1)

Copied to clipboard

Challenge: Chinese word segmentation and dependency parsing suffer from error propagation . a graph-based model can integrate both tasks, but it suffers from performance limitations .
Approach: They propose a graph-based model to integrate Chinese word segmentation and dependency parsing . their model achieves better performance than previous joint models .
Outcome: The proposed model achieves better performance than previous joint models and state-of-the-art results in both Chinese word segmentation and dependency parsing.
SHR++: An Interface for Morpho-syntactic Annotation of Sanskrit Corpora (2020.lrec-1)

Copied to clipboard

Challenge: SHR++ is designed to generate annotations for word segmentation, morphological parsing and dependency analysis tasks in Sanskrit.
Approach: They propose a web-based annotation framework, SHR++, for morpho-syntactic annotation of corpora in Sanskrit.
Outcome: The proposed framework reduces the time spent on the annotation tasks by 20.15 %.
MRL Parsing Without Tears: The Case of Hebrew (2024.findings-acl)

Copied to clipboard

Challenge: a new approach to parsing morphologically rich languages (MRLs) is needed to overcome the deficiencies of current approaches.
Approach: They propose a "flipped pipeline" where multiple layers are predicted independently on whole-token basis and then synthesized.
Outcome: The proposed model achieves near-SOTA performance on Hebrew NLP tasks.
Simpler but More Accurate Semantic Dependency Parsing (P18-2)

Copied to clipboard

Challenge: Syntactic dependency parsing is the most popular method for automatically extracting low-level relationships between words in a sentence.
Approach: They extend a syntactic dependency parser to train on and generate graph-structured representations that capture between-word relationships that are more closely related to the meaning of a sentence.
Outcome: The proposed system beats the current state-of-the-art system by 0.6% and linguistically richer representations push the margin even higher.
A Semi-Autoregressive Graph Generative Model for Dependency Graph Parsing (2023.findings-acl)

Copied to clipboard

Challenge: Existing parsers that capture dependency graphs are lacking in capturing explicit dependencies . graph-based parsing is a popular choice for capturing dependency relationships between words .
Approach: They propose a semi-autoregressive dependency parser that generates dependency graphs by adding nodes and edge groups autoregressively while pouring out all group elements in parallel.
Outcome: The proposed method outperforms baselines on Enhanced Universal Dependencies of multiple languages.
SanskritShala: A Neural Sanskrit NLP Toolkit with Web-Based Interface for Pedagogical and Annotation Purposes (2023.acl-demo)

Copied to clipboard

Challenge: SanskritShala is a neural-based Sanskrit NLP toolkit that is available as a web-based application .
Approach: They propose a neural Sanskrit NLP toolkit that facilitates linguistic analyses for word segmentation, morphological tagging, dependency parsing, and compound type identification.
Outcome: The proposed toolkit reports state-of-the-art performance on benchmark datasets . it is built with easy-to-use interactive data annotation features .
Typology-Aware Multilingual Morphosyntactic Parsing with Joint Abstract Node Modeling (2026.acl-long)

Copied to clipboard

Challenge: UniDive 2025 Morphosyntactic Parsing (MSP) shared task unifies dependency structure, morphological features, and unrealized arguments.
Approach: They propose a multilingual, typology-aware joint system that integrates word-type prediction, content-only parsing, morphological tagging, and an abstract-node component within a single architecture.
Outcome: The proposed model outperforms the leading submission by 3.23 percentage points in MSLAS, 3.35 in LAS, and 1.78 in FEATS macro F1.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations