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...
Jezik i gramatološki prinos Lanosovićeve slavonske gramatike u kontekstu standardizacije hrvatskoga jezika
Jezik i gramatološki prinos Lanosovićeve slavonske gramatike u kontekstu standardizacije hrvatskoga jezika
The primary task of this paper was to present, describe and analyze all three editions of Fr. Marijan Lanosović’s grammar as comprehensively and systematically as possible. The gra...
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...
Transformer-based Text Classification on Unified Bangla Multi-class Emotion Corpus
Transformer-based Text Classification on Unified Bangla Multi-class Emotion Corpus
Abstract
Due to its importance in studying people’s thoughts on various Web 2.0 services, emotion classification is a critical undertaking. Most existing research is focuse...
Bangla Linguistics and Abul Mansur Ahmad
Bangla Linguistics and Abul Mansur Ahmad
There was a time when it was a matter of great debate whether Urdu or Bangla was the mother tongue of the Bengali Muslim. In the field of Bengali Language and Literature another de...
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...

