An intelligent parser that automatically generates semantic rules during syntactic and semantic analysis

In this paper we propose a parser that performs syntactic and semantic analysis of assertions about software specification. These assertions are expressed in a restricted form of natural language (NL) related to space sciences. The parser corresponds to an applicative grammar that is built according to the structuralism theory. The grammar rules are defined in terms of Latin cases. The parser performs syntactic and semantic analysis simultaneously, as in Montague's grammar. However, different from Montague's ideas, here the linguist does not have to define as many lambda abstractions as syntactical categories. In fact, it has to define only lambda abstractions corresponding to the case and to the verb categories. Lambda abstractions corresponding to the other categories will be automatically generated during analysis. The process of parsing is guided by a heuristic method of artificial intelligence and it is executed according to some cohesion and coherence criterions.