A Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs' Naive Algorithm
Küçük Resim Yok
Tarih
2005
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
World Acad Sci, Eng & Tech-Waset
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this paper we present a computational model for pronominal anaphora resolution in Turkish. The model is based on Hobbs' Naive Algorithm [4, 5, 6], which exploits only the surface syntax of sentences in a given text.
Açıklama
Conference of the World-Academy-of-Science-Engineering-and-Technology -- APR 27-29, 2005 -- Rome, ITALY
Anahtar Kelimeler
Anaphora Resolution, Pronoun Resolution, Syntax-Based Algorithms, Naive Algorithm
Kaynak
Proceedings Of World Academy Of Science, Engineering And Technology, Vol 5
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
5
