1989•Computational IntelligenceRequires access

Expressing unrestricted grammars by extended definite clause grammars1

Erik Knudsen

Abstract

A definition of extended definite clause grammars and their relationship to unrestricted grammars are presented. A method for translating extended definite clause grammars describing unrestricted grammars into executable prolog programs is given. Three different parsing techniques are presented, and for each a complete presentation of how to incorporate unrestricted grammars in the actual formalism is done. Extended definite clause grammar is a powerful formalism usable for specifying grammars in natural language processing systems.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Definite clause grammar, Tree-adjoining grammar, L-attributed grammar, Phrase structure grammar, Indexed grammar, Context-sensitive grammar, Computer science, Parsing expression grammar