Transition network grammars for natural language analysis
Communications of the ACM
Introduction to Languages and the Theory of Computation
Introduction to Languages and the Theory of Computation
Affix Grammars for Natural Languages
Proceedings on Attribute Grammars, Applications and Systems
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Hi-index | 0.00 |
In this paper we are contributing to the Natural Language Understanding phase of the broader area Natural Language Processing. This paper presents the design of computer grammar that is capable of understanding simple and compound sentences of English language efficiently. To begin the design, various possible syntactic structures of the simple and compound English sentences have been explored thoroughly. Various kinds of simple and compound sentences along with the use of different tenses as well as voices have been considered in the design. Then structural representation (SRs) of these sentences have been prepared that is discussed in the analysis section. Finally, all these SRs have been converted into computer grammar. This computer grammar can be used for any European Language with some modifications. We have also developed a test parser using some portion of the computer grammar discussed in this paper. This computer grammar can be used in many applications as elaborated in the conclusion.