IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Table-driven parsing of natural language with constraint-based grammars

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/22566

Files in this item

File Description Format
PDF 9314899.pdf (4MB) Restricted to U of Illinois (no description provided) PDF
Title: Table-driven parsing of natural language with constraint-based grammars
Author(s): Lee, Kang-Hyuk
Doctoral Committee Chair(s): Morgan, Jerry
Department / Program: Linguistics
Discipline: Linguistics
Degree Granting Institution: University of Illinois at Urbana-Champaign
Degree: Ph.D.
Genre: Dissertation
Subject(s): Language, Linguistics
Abstract: In this dissertation, it is shown how efficient natural language parsing with constraint-based grammars can be achieved. In so doing, a variant of the LR-parsing algorithm is developed that deals with grammars using feature-based categories. It is shown that constraint-based grammars bring about the problems of potential nontermination and unnecessary nondeterminism with the LR parsing method, which do not arise from grammars using monadic categories. To achieve a terminating and deterministic algorithm, an extended method for constructing parsing tables is developed. The extended LR method is unable to handle schematic rules as in HPSG and CUG, however. To remedy this problem, a rule inference algorithm is developed that instantiates underspecified rules into more specified ones containing enough information to construct sets of items and parsing tables. The implementation and evaluation of the extended LR parsing method is also discussed.The LR-based parsing method is further explored to find out whether it can be used to model human sentence processing. Traditional approaches to local ambiguity resolution are reviewed. It is shown how the reduce-first LR parser and combinatory categorial grammar can be used with a semantics-based local ambiguity resolution technique.Finally, prominent problems with the two-level model for morphological parsing are discussed. A two-level morphological processor augmented with feature-based CF word grammars is proposed which allows for more enriched morphosyntactic descriptions. It is shown how LR predictions manifested in the parsing table can used to optimize the dictionary lookup process.
Issue Date: 1993
Type: Text
Language: English
URI: http://hdl.handle.net/2142/22566
Rights Information: Copyright 1993 Lee, Kang-Hyuk
Date Available in IDEALS: 2011-05-07
Identifier in Online Catalog: AAI9314899
OCLC Identifier: (UMI)AAI9314899
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 1
  • Downloads this Month: 0
  • Downloads Today: 0

Browse

My Account

Information

Access Key