Javascript must be enabled to continue!
Parsing Bangla Grammar Using Context Free Grammar
View through CrossRef
Parsing plays a very prominent role in computational linguistics. Parsing a Bangla sentence is a primary need in Bangla language processing. This chapter describes the Context Free Grammar (CFG) for parsing Bangla language, and hence, a Bangla parser is proposed based on the Bangla grammar. This approach is very simple to apply in Bangla sentences, and the method is well accepted for parsing grammar. This chapter introduces a parser for Bangla language, which is, by nature, a predictive parser, and the parse table is constructed for recognizing Bangla grammar. Parse table is an important tool to recognize syntactical mistakes of Bangla sentences when there is no entry for a terminal in the parse table. If a natural language can be successfully parsed then grammar checking of this language becomes possible. The parsing scheme in this chapter works based on a top-down parsing method. CFG suffers from a major problem called left recursion. The technique of left factoring is applied to avoid the problem.
Title: Parsing Bangla Grammar Using Context Free Grammar
Description:
Parsing plays a very prominent role in computational linguistics.
Parsing a Bangla sentence is a primary need in Bangla language processing.
This chapter describes the Context Free Grammar (CFG) for parsing Bangla language, and hence, a Bangla parser is proposed based on the Bangla grammar.
This approach is very simple to apply in Bangla sentences, and the method is well accepted for parsing grammar.
This chapter introduces a parser for Bangla language, which is, by nature, a predictive parser, and the parse table is constructed for recognizing Bangla grammar.
Parse table is an important tool to recognize syntactical mistakes of Bangla sentences when there is no entry for a terminal in the parse table.
If a natural language can be successfully parsed then grammar checking of this language becomes possible.
The parsing scheme in this chapter works based on a top-down parsing method.
CFG suffers from a major problem called left recursion.
The technique of left factoring is applied to avoid the problem.
Related Results
Parsing Bangla Grammar Using Context Free Grammar
Parsing Bangla Grammar Using Context Free Grammar
Parsing plays a very prominent role in computational linguistics. Parsing a Bangla sentence is a primary need in Bangla language processing. This chapter describes the Context Free...
Hierarchical Clause Annotation: Building a Clause-Level Corpus for Semantic Parsing with Complex Sentences
Hierarchical Clause Annotation: Building a Clause-Level Corpus for Semantic Parsing with Complex Sentences
Most natural-language-processing (NLP) tasks suffer performance degradation when encountering long complex sentences, such as semantic parsing, syntactic parsing, machine translati...
Semantic Graphical Dependence Parsing Model in Improving English Teaching Abilities
Semantic Graphical Dependence Parsing Model in Improving English Teaching Abilities
It is a very difficult problem to achieve high-order functionality for graphical dependency parsing without growing decoding difficulties. To solve this problem, this article offer...
Semantics and algorithms for data-dependent grammars
Semantics and algorithms for data-dependent grammars
We present the design and theory of a new parsing engine, YAKKER, capable of satisfying the many needs of modern programmers and modern data processing applications. In particular,...
Hierarchical Clause Annotation: Building a Clause-Level Corpus for Semantic Parsing with Complex Sentences
Hierarchical Clause Annotation: Building a Clause-Level Corpus for Semantic Parsing with Complex Sentences
Most natural language processing (NLP) tasks suffer performance degradation when encountering long complex sentences, such as semantic parsing, syntactic parsing, machine translati...
An Investigation of Bias in Bangla Text Classification Models
An Investigation of Bias in Bangla Text Classification Models
Abstract
The rapid growth of natural language processing (NLP) applications has highlighted concerns about fairness and bias in text classification models. Despite signific...
Improving partial parsing based on error-pattern analysis for a Korean grammar-checker
Improving partial parsing based on error-pattern analysis for a Korean grammar-checker
The main aim of this work is to make improvements to Mirine 2.2, a Korean grammar-checker that takes Korean language properties into account and to develop a system that satisfies ...
Evolutionary Grammatical Inference
Evolutionary Grammatical Inference
Grammatical Inference (also known as grammar induction) is the problem of learning a grammar for a language from a set of examples. In a broad sense, some data is presented to the ...

