Feature grammars for semantic analysis
Camilla B. Schwind · Computational Intelligence · 1990
In this paper, we present a formalism called feature grammar and its application to several problems of semantic analysis. Our extension concerns the structure of the feature value sets, which can be complex, and the definition of unification, which is dependent on this structure. Moreover, we introduce generation rules for feature symbols in order to determine well‐formed symbols, which form the alphabet of a formal language for natural language analysis.