Evaluation of Computational Grammar Formalisms for Indian Languages

TL;DR

This paper analyzes various computational grammar formalisms to determine the most suitable approach for natural language parsing in Indian languages, addressing a key challenge in NLP for these languages.

Contribution

It provides an evaluation of different grammar formalisms specifically for Indian languages, aiding in selecting appropriate models for NLP applications.

Findings

Probabilistic parsers improve parsing speed and accuracy.

Analysis identifies the most effective formalism for Indian languages.

Guidelines for choosing grammar formalisms in Indian NLP are proposed.

Abstract

Natural Language Parsing has been the most prominent research area since the genesis of Natural Language Processing. Probabilistic Parsers are being developed to make the process of parser development much easier, accurate and fast. In Indian context, identification of which Computational Grammar Formalism is to be used is still a question which needs to be answered. In this paper we focus on this problem and try to analyze different formalisms for Indian languages.