A Deterministic Analyzer for the Interpretation of Natural Language Commands
暂无分享,去创建一个
This paper describes a system which translates a query in Italian language into a representation which can be immediately interpreted as a sequence of algebraic operations on a relational data base. The use of a lookshead buffer allows the system to operate deterministically. Different knowledge sources are used to cope with semantics (associated with the lexicon) and syntax (represented as pajt tern-action rules). These knowledge sources cooper ate during the query translation so that independent translation steps and intermediate representations of the command are avoided. Therefore the term "determinism" is used to mean that all the structures built during the process concur to build the final command representation.
[1] George E. Heidorn. Augmented phrase structure grammars , 1975, TINLAP '75.
[2] Leonardo Lesmo,et al. Computer-Aided Evaluation of Liver Functional Assessment , 1980 .
[3] Mitchell P. Marcus,et al. A theory of syntactic recognition for natural language , 1979 .