POS-AUGMENTED STATISTICAL PARSINGFRAMEWORK USING TREE-ADJOININGGRAMMAR FOR NATURAL LANGUAGEPROCESSING

This paper presents a novel probabilistic parsing framework for Tree-Adjoining Grammar (TAG) that integrates part-of-speech (POS) information to enhance syntactic disambiguation and improve parsing accuracy. While TAG remains a linguistically expressive formalism for modelling complex syntactic phenomena such as long-distance dependencies and recursive structures, conventional statistical TAG parser predominantly relies on lexical information, limiting their ability to resolve structural ambiguities inherent in Natural Languages (NL). To address this limitation, we extend the probabilistic TAGformalism by conditioning derivation decisions jointly on lexical anchors and their associated POS tags. Our model supports both generative and discriminative formulations, incorporating POS-based feature representations into the derivation scoring mechanism. The training process is adapted to align POS-tagged lexical items with elementary tree structures, allowing the parser to learn syntactic patterns with greater accuracy and robustness. Empirical evaluations across multiple languages demonstrate that POS- augmented approach yields significant gains in parsing accuracy, particularly in the presence of syntactic ambiguity. The POS-Augmented Statistical Parser was evaluated on a dataset of 12,000 sentences, resulting a 30% reduction in parsing time compared to the conventional TAG Parser. The integration of POS not only enhances parsing speed but also provides structural advantages. In contrast, Tree Adjoining Grammar (TAG) often struggles to fully capture the complexity of linguistic phenomena, especially in crosslinguistic transfer between English and Indian languages. The proposed framework of ers a scalable and linguistically informed enhancement to TAG-based systems, bridging symbolic grammatical representations with data-driven statistical learning. This POS-augmented approach of ers a lightweight yet ef ective extension to existing TAG-based systems, enhancing their linguistic expressiveness and robustness for Natural Language Processing (NLP) applications.

Authors

Institutions

Publication Details

Published
2025-08-16
DOI
https://doi.org/10.5121/csit.2025.151505
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

POS-AUGMENTED STATISTICAL PARSINGFRAMEWORK USING TREE-ADJOININGGRAMMAR FOR NATURAL LANGUAGEPROCESSING

Lenali Singh, Jahnavi Bodhankar, Pavan Kurariya, Prashant Chaudhary
Natural Language Processing Techniques
article

POS-AUGMENTED STATISTICAL PARSINGFRAMEWORK USING TREE-ADJOININGGRAMMAR FOR NATURAL LANGUAGEPROCESSING

Lenali Singh, Jahnavi Bodhankar, Pavan Kurariya, Prashant Chaudhary
article en

Abstract

This paper presents a novel probabilistic parsing framework for Tree-Adjoining Grammar (TAG) that integrates part-of-speech (POS) information to enhance syntactic disambiguation and improve parsing accuracy. While TAG remains a linguistically expressive formalism for modelling complex syntactic phenomena such as long-distance dependencies and recursive structures, conventional statistical TAG parser predominantly relies on lexical information, limiting their ability to resolve structural ambiguities inherent in Natural Languages (NL). To address this limitation, we extend the probabilistic TAGformalism by conditioning derivation decisions jointly on lexical anchors and their associated POS tags. Our model supports both generative and discriminative formulations, incorporating POS-based feature representations into the derivation scoring mechanism. The training process is adapted to align POS-tagged lexical items with elementary tree structures, allowing the parser to learn syntactic patterns with greater accuracy and robustness. Empirical evaluations across multiple languages demonstrate that POS- augmented approach yields significant gains in parsing accuracy, particularly in the presence of syntactic ambiguity. The POS-Augmented Statistical Parser was evaluated on a dataset of 12,000 sentences, resulting a 30% reduction in parsing time compared to the conventional TAG Parser. The integration of POS not only enhances parsing speed but also provides structural advantages. In contrast, Tree Adjoining Grammar (TAG) often struggles to fully capture the complexity of linguistic phenomena, especially in crosslinguistic transfer between English and Indian languages. The proposed framework of ers a scalable and linguistically informed enhancement to TAG-based systems, bridging symbolic grammatical representations with data-driven statistical learning. This POS-augmented approach of ers a lightweight yet ef ective extension to existing TAG-based systems, enhancing their linguistic expressiveness and robustness for Natural Language Processing (NLP) applications.

Centre for Development of Advanced Computing (IN)
Openalex Percentile: Top 89%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

POS-AUGMENTED STATISTICAL PARSINGFRAMEWORK USING TREE-ADJOININGGRAMMAR FOR NATURAL LANGUAGEPROCESSING — Lenali Singh, Jahnavi Bodhankar, et al. · (2025) | TGRS Research Map | TGRS