2026-09-19T23:19:05Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/82674 2023-07-11 col_2142_5131 col_2142_13736 com_2142_5130 com_2142_8975 com_2142_8903

Morgan, Jerry Kovach, Edward Glenn 2015-09-25T20:51:01Z 2015-09-25T20:51:01Z 10000-01-01 1998 1998 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. Made available in DSpace on 2015-09-25T20:51:01Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9904513.pdf: 10091542 bytes, checksum: b430dd99d1861e83e7e2cffaf4e5ec61 (MD5) Previous issue date: 1998 Embargo set by: Seth Robbins for item 83955 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 206 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998. http://hdl.handle.net/2142/82674 (MiAaPQ)AAI9904513 eng Computer Science Finite-State Morphological Parsing Using Register Vector Grammars text Linguistics Linguistics University of Illinois at Urbana-Champaign Dissertation Ph.D.