This paper presents a software who's goal is to ease automatic analysis of natural language by solving two analysis problems:
— resolution of syntactic ambiguities;
— identification of fixed forms.
In order to fulfil this goal, it appears that using negative rules make this system really powerful and easy to use, as long as sentences are represented by a graph structure.
There are three main points to this paper:
— the graph structure of the sentence;
— the use of negative rules;
— the identification of fixed forms based upon a new categorization of those forms.
It's important to stress the industrial dimension of this work: actually, two systems are already using in software, namely a translating system for concept and a grammatical corrector for newspapers.
Proposal of an Algorithm to Generate VDM++ Specification Based on its Grammar by Using Word Lists Extracted from the Natural Language Specification