DIAGRAM: a grammar for dialogues
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Natural Language Information Processing: A Computer Grammmar of English and Its Applications
Natural Language Information Processing: A Computer Grammmar of English and Its Applications
Understanding Natural Language
Understanding Natural Language
A Technique for Parsing Ambiguous Languages
GI - 4. Jahrestagung
Natürlichsprachliche Systeme - Eine Einführung in die sprachorientierte KI-Forschung
Künstliche Intelligenz, Frühjahrsschule
ACM SIGPLAN Notices
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
Approaches to text mining arguments from legal cases
Semantic Processing of Legal Texts
| Hi-index | 0.00 |
This paper presents an 'Acceptive Grammar' (Feldmann 83a) for a reasonable large subset of the natural language English. The grammar describes all decidable language properties, even context dependences and multiple accepting sequences, and needs no informal augments ! The rules of the Acceptive Grammar are given in form of SIMULA procedures and their graphical representations in form of easy readable SIMULA comments. The complete graphical representations of 'Basics of English' and 'Essentials of English' are listed in sections 3 and 4. The 'actual lexicon' of all entries which occur in the examples of this paper is listed in section 6. The examples are unabridged and show the input, which should be a CLAUSE (section 4) of natural English, and the output, which is a (possibly multiple) parse tree of the CLAUSE or an errordump.