Finite-State Morphological Parsing Using Register Vector Grammars

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.

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

2015

Author dc:creator

• Kovach, Edward Glenn

Contributors dc:contributor

• Morgan, Jerry

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI9904513

OAI identifier oai:identifier

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