Table-driven parsing of natural language with constraint-based grammars
Lee, Kang-Hyuk
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/22566
Description
Title
Table-driven parsing of natural language with constraint-based grammars
Author(s)
Lee, Kang-Hyuk
Issue Date
1993
Doctoral Committee Chair(s)
Morgan, Jerry L.
Department of Study
Linguistics
Discipline
Linguistics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Language, Linguistics
Language
eng
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
