Cascaded Finite-State Chunk Parsing for Hindi Language

The Cascaded Finite-state Chunk Parsing for Hindi Language (CFC) is a deterministic bottom-up version based on an LR parser that employs a best-first search. It uses finite-state cascade as a sequence of strata. Each stratum is defined by a category and a set of regular-expression patterns for recognizing phrases. Phrases at one level are built on phrases at the previous level. The final chunk structure is a multi-level sequence to span the entire text as single parse tree. Our research is presented with a design, implementation steps and result analysis. Though, we present a case study for an Indian language i.e. Hindi, it is language independent approach and extendible for further scope.