论文信息 - Experiences in building of context-free grammar tree

Experiences in building of context-free grammar tree

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.

L. Kovacs | P. Barabas | P. Barabas | László Kovács

[1] Igor Mel’čuk. Towards a Linguistic ‘Meaning⇔Text’ Model , 1973 .

[2] Patrick Murphy,et al. What Is Statistics , 2014 .

[3] John A. Barnden,et al. Semantic Networks , 1998, Encyclopedia of Social Network Analysis and Mining.

[4] Robert F. Simmons,et al. Syntactic dependence and the computer generation of coherent discourse , 1963, Mech. Transl. Comput. Linguistics.

[5] Ralph Debusmann,et al. Extensible dependency grammar: a modular grammar formalism based on multigraph description , 2006 .

[6] Charles J. Fillmore,et al. THE CASE FOR CASE. , 1967 .

[7] Katsuhiko Nakamura,et al. Incremental learning of context free grammars based on bottom-up parsing and search , 2005, Pattern Recognit..