Anaphora Resolution Algorithms With Category: English and Korean

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.

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

• Lee, Yong-Hun

Contributors dc:contributor

• Morgan, Jerry L.

• Language, Linguistics

Language dc:language

eng

Identifier

(MiAaPQ)AAI3086115

OAI identifier oai:identifier

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