About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Computers and Mathematics with Applications
Paper
Generating language from conceptual graphs
Abstract
Conceptual graphs are a semantic representation that has a direct mapping to natural language. This article presents a universal algorithm for scanning the graphs, together with a version of augmented phrase-structure grammar for specifying the syntax of particular languages. When combined with a specific grammar, the universal algorithm determines a mapping from graphs to language with several important properties: multiple surface structures may be generated from a common underlying structure, constraints on the mapping result from the connectivity of the graphs rather than ad hoc assumptions, and the graphs combined with phrase-structure rules enforce context-sensitive conditions. © 1983.