A PROLOG Implementation of Lexical Functional Grammar

Abstract

Lexical functional grammar (LFG) is an attempt to solve problems that arise in transformational grammar and ATN-formalisms (Bresnan, 1982). Another powerful formalism for describing natural languages follows from a method for expressing grammars in logic, due to Colmerauer (1970) and Kowalski (1974) called definite clause grammars(DCG) (Warren, Pereira, 1980). Both formalisms are a natural extension of context free grammars (CFG). The aim of this paper is to show -how LFG can be translated into DCG -that the procedural semantics of PROLOG provides an efficient tool for LFG-implementations in that it allows the construction of function structures (f-structures) directly during the parsing process. i.e. it is not necessary to have a separate component which first derives a set of functional equations from the parse tree, and secondly generates a f-structure by solving these equations.

Cite

Text

Reyle and Frey. "A PROLOG Implementation of Lexical Functional Grammar." International Joint Conference on Artificial Intelligence, 1983.

Markdown

[Reyle and Frey. "A PROLOG Implementation of Lexical Functional Grammar." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/reyle1983ijcai-prolog/)

BibTeX

@inproceedings{reyle1983ijcai-prolog,
  title     = {{A PROLOG Implementation of Lexical Functional Grammar}},
  author    = {Reyle, Uwe and Frey, Werner},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1983},
  pages     = {693-695},
  url       = {https://mlanthology.org/ijcai/1983/reyle1983ijcai-prolog/}
}