Experiences in building of context-free grammar tree

Abstract

One of the main research areas in current intelligent systems is the development of natural language interfaces for applications. The processing of sentences is controlled by grammar of the language. From the viewpoint of efficiency, the most widely used grammar in computer linguistics is the CFG (context-free grammar) formalism. The paper provides an overview of the structure of CFG and it presents an algorithm for automatic grammar tree construction.