Anaphora Resolution Algorithms With Category: English and Korean
Lee, Yong-Hun
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/82619
Description
Title
Anaphora Resolution Algorithms With Category: English and Korean
Author(s)
Lee, Yong-Hun
Issue Date
2003
Doctoral Committee Chair(s)
Morgan, Jerry L.
Department of Study
Linguistics
Discipline
Linguistics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Language, Linguistics
Language
eng
Abstract
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.
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.
