Types in functional unification grammars

Research output: Contribution to journalConference articlepeer-review

9 Scopus citations

Abstract

Functional Unification Grammars (FUGs) are popular for natural language applications because the formalism uses very few primitives and is uniform and expressive. In our work on text generation, we have found that it also has annoying limitations: it is not suited for the expression of simple, yet very common, taxonomic relations and it does not allow the specification of completeness conditions. We have implemented an extension of traditional functional unification. This extension addresses these limitations while preserving the desirable properties of FUGs. It is based on the notions of typed features and typed constituents. We show the advantages of this extension in the context of a grammar used for text generation.

Original languageEnglish
Pages (from-to)157-164
Number of pages8
JournalProceedings of the Annual Meeting of the Association for Computational Linguistics
Volume1990-June
StatePublished - 1 Jan 1990
Externally publishedYes
Event28th Annual Meeting of the Association for Computational Linguistics, ACL 1990 - Pittsburgh, United States
Duration: 6 Jun 19909 Jun 1990

ASJC Scopus subject areas

  • Computer Science Applications
  • Linguistics and Language
  • Language and Linguistics

Fingerprint

Dive into the research topics of 'Types in functional unification grammars'. Together they form a unique fingerprint.

Cite this