Finite-State Morphological Parsing Using Register Vector Grammars
Kovach, Edward Glenn
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/82674
Description
Title
Finite-State Morphological Parsing Using Register Vector Grammars
Author(s)
Kovach, Edward Glenn
Issue Date
1998
Doctoral Committee Chair(s)
Morgan, Jerry
Department of Study
Linguistics
Discipline
Linguistics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
Although the RVGMP can parse some data which Kimmo cannot parse, the RVGMP is slower on average than Kimmo. Poor program design is responsible for this slow time. A revised program design, based in part on a new design for RVG, is proposed. Since the redesigned RVGs have doubled their parsing speed, similar time gains are expected with the new implementation of the RVGMP. With these time gains, the RVGMP would parse all the data more quickly than Kimmo.
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.
