2026-09-22T19:23:15Z https://www.ideals.illinois.edu/oai-pmh

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

Morgan, Jerry L. Lee, Yong-Hun 2015-09-25T20:50:41Z 2015-09-25T20:50:41Z 10000-01-01 2003 2003 In sum, this dissertation develops faster and more efficient computational algorithms for anaphora resolution, in which category combinatorics determines the actions. In those algorithms, various kinds of anaphoric expressions are resolved similarly. Through the analyses and their implementations, I hope this research can give us more opportunity to understand characteristics of anaphoric phenomena, which is one of the important phenomena that natural languages demonstrate. Made available in DSpace on 2015-09-25T20:50:41Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3086115.pdf: 16840561 bytes, checksum: 828aa67c9d4e35e7e2c2033719ca5f09 (MD5) Previous issue date: 2003 Embargo set by: Seth Robbins for item 83900 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 410 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003. http://hdl.handle.net/2142/82619 (MiAaPQ)AAI3086115 eng Language, Linguistics Anaphora Resolution Algorithms With Category: English and Korean text Linguistics Linguistics University of Illinois at Urbana-Champaign Dissertation Ph.D.