Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks

@article{Pereira1980DefiniteCG,
  title={Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks},
  author={Fernando C Pereira and David H. D. Warren},
  journal={Artif. Intell.},
  year={1980},
  volume={13},
  pages={231-278}
}
View via Publisher
cgi.di.uoa.gr
1,046 Citations
Highly Influential Citations
63
Background Citations
197
Methods Citations
163
Results Citations
2

Figures from this paper

1,046 Citations

A Practical Implementation of DCGs

The main objective of the DCG implementation is to provide an automatic error handling mechanism, and the system accepts DCGs in their standard form, but the implementation most notably circumvents the problems 1 and 3.

A Practical Implementation of DCGs (Abstract)

The main objective of the DCG implementation is to provide an automatic error handling mechanism, and the system accepts DCGs in their standard form, but the implementation most notably circumvents the problems 1 and 3.

A PROLOG Implementation of Lexical Functional Grammar

The aim of this paper is to show how LFG can be translated into DCG and that the procedural semantics of PROLOG provides an efficient tool for LFG-implementations in that it allows the construction of function structures directly during the parsing process.

Definite Clause Grammars with Parse Trees: Extension for Prolog

A parser for the Prolog programming language itself is presented based only on the grammars given in the ISO Prolog standard which produces corresponding parse trees.

Squibs and Discussions Dependency Unification Grammar for PROLOG

A framework for automatic translation of DUG rules to Horn clauses that makes DUGs as easy to implement as classic DCGs is added, based on Hellwig's Dependency Unification Grammar (DUG) (Hellwig 1986).

A Parser Generator for Unification Grammar Formalism with Gap-Handling Facility/spl dagger/

  • Hsin-Hsi Chen
  • Computer Science
    TENCON '91. Region 10 International Conference on EC3-Energy, Computer, Communication and Control Systems
  • 1991
This paper introduces island constraints into PATR-like formalisms to handle gapping in the natural language sentences automatically and shows that a tandem-processing model can be obtained by a slight change to the original generator.

A Study in Grammar Design

  • E. Konig
  • Computer Science, Linguistics
  • 1994
This paper provides a set of criteria and guidelines for grammar design, which are illustrated by an implemented grammar fragment (for German) including semantic composition rules, which focus on the semantic representation formalism of Underspeciied Discourse Representation Structures (UDRS's).

Extending Definite Clause Grammars with Scoping Constructs

Under this approach, filler-gap dependencies can be accounted for in terms of the operational semantics underlying hereditary Harrop formulas, in a way reminiscent of the treatment of such phenomena in Generalized Phrase Structure Grammar (GPSG).

Towards a Programming Language Based on the Notion of Two-Level Grammar

Reversible logic grammars for natural language parsing and generation

An alogorithm for automated inversion of a unification parser into an efficient unification generator, using the collections of minimal sets of essential arguments for predicates is presented.
...

References

SHOWING 1-10 OF 60 REFERENCES

Transition network grammars for natural language analysis

The use of augmented transition network grammars for the analysis of natural language sentences is described, and structure-building actions associated with the arcs of the grammar network allow for a powerful selectivity which can rule out meaningless analyses and take advantage of semantic information to guide the parsing.

Prolog - the language and its implementation compared with Lisp

It is argued that pattern matching is a better method for expressing operations on structured data than conventional selectors and constructors - both for the user and for the implementor.

Augmenting ATNS

An optimizing compiler for ATN networks which translates them into LISP functions and an interactive program which allows one to easily extend and modify an ATN grammar.

Revised report on the algorithm language ALGOL 60

a survey of the basic coustituents arid fcuturcs of the language is given, and the formal notation, by which the syntactic structure is defined, is esplaincd. The sccnnd chapter lists all the basic…

A Machine-Oriented Logic Based on the Resolution Principle

The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.

Ttle sharing of structure in theorem proving programs

The concept of the value of an expression in a binding environment which is used to standardize clauses apart and share the structure of parents in representing the resolvent in resolution programs is introduced.

Extraposition Grammars

An extension of definite clause grammars, and are similarly defined in terms of logic clauses, which makes it easy to describe left extraposition of constituents, an important feature of natural language syntax.

Logic programming and compiler writing

  • D. Warren
  • Computer Science
    Softw. Pract. Exp.
  • 1980
The concept of ‘logic programming’, and its practical application in the programming language Prolog, are explained from first principles, and one sizable Prolog program which implements a simple compiler is described.

Logic for problem solving

This book investigates the application of logic to problem-solving and computer programming. It assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficult…

Logic-based program system for predicting drug interactions.

...