Parsing and generation of unification grammars

In this dissertation, it is shown that declarative, feature-based, unification grammars can be used for efficiently both parsing and generation. It is also shown that radically different algorithms are not needed for these two modes of processing. Given this similarity between parsing and generation, it will be easier to maintain consistency between input and output in interactive natural language interfaces. A Prolog implementation of the unification-based parser and DAG unifier is provided. The DAG unifier includes extension to handle disjunction and negation.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Linguistics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Gerdemann, Dale Douglas

Contributors dc:contributor

• Hinrichs, Erhard

• Language, Linguistics
• Computer Science

Statement dc:rights

• Copyright 1991 Gerdemann, Dale Douglas

Language dc:language

eng

Identifier

AAI9136597
(UMI)AAI9136597

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/20955