A symmetrical approach to parsing and generation

  • Authors:
  • Marc Dymetman;Pierre Isabelle;Francois Perrault

  • Affiliations:
  • CCRIT, Communications Canada. Chomedey. Laval, Québec, Canada;CCRIT, Communications Canada. Chomedey. Laval, Québec, Canada;CCRIT, Communications Canada. Laval, Québec, Canada

  • Venue:
  • COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lexical Grammars are a class of unification grammars which share a fixed rule component, for which there exists a simple left-recursion elimination transformation. The parsing and generation programs are seen as two dual non-left-recursive versions of the original grammar, and are implemented through a standard top-down Prolog interpreter. Formal criteria for termination are given as conditions on lexical entries: during parsing as well as during generation the processing of a lexical entry consumes some amount of a guide; the guide used for parsing is a list of words remaining to be analyzed, while the guide for generation is a list of the semantics of constituents waiting to be generated.