Formal syntax methods for natural language
Information Processing Letters
Two-level grammars for automatic interpretation
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Transition network grammars for natural language analysis
Communications of the ACM
Formal Specifications of Programming Language: A Panoramic Primer
Formal Specifications of Programming Language: A Panoramic Primer
Two-level grammar: data flow English for functional and logic programming
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
| Hi-index | 0.00 |
The two-level grammar is investigated as a notation for giving formal specification of the context-free and context-sensitive aspects of natural language syntax. In this paper, a large class of English declarative sentences, including post-noun-modification by relative clauses, is formalized using a two-level grammar. The principal advantages of two-level grammar are: 1) it is very easy to understand and may be used to give a formal description using a structured form of natural language; 2) it is formal with many well-known mathematical properties; and 3) it is directly implementable by interpretation. The significance of the latter fact is that once we have written a two-level grammar for natural language syntax, we can derive a parser automatically without writing any additional specialized computer programs. Because of the ease with which two-level grammars may express logic and their Turing computability we expect that they will also be very suitable for future extensions to semantics and knowledge representation.