A Structure Based Computer Grammar to Understand Compound-Complex, Multiple-Compound and Multiple-Complex English Sentences

Abstract

This research paper presents the design of a structure based computer grammar for compound-complex, multiple-compound and multiple-complex sentences of English language. This gives us a versatile method for describing the language which is more interesting and powerful way of representing the grammar. At first, the related works are analyzed to demonstrate the need of this computer grammar. To begin the design, the syntactic construct of these sentences have been explored thoroughly along with the formal properties of a set of grammatical transformation that can derive a new sentences with given structural formalism, The syntactic constructs of these sentences have been presented through suitable examples. The structural representation of these sentences has been designed in the next section of this paper. Finally computer grammar has been designed for all the structural representations (SRs) of these sentences. A little work is available in the literature concerning to the sentences under consideration in this paper. Hence, there is a need to design an efficient and versatile computer grammar for these sentences. The work accomplished in this paper contributes to the Natural Language Understanding phase under the broader area of Natural Language Processing. The present work is under the category of mathematical logic and formal languages. This computer grammar can be used for any European language with some modifications as applicable to the language. This computer grammar can be used in many applications to make them more versatile such as speech recognition and synthesis, text processing software packages, further strengthening the automation level of various industries, computer aided instructions (CAI), Industrial and Domestic robots and etc.