A computational model for resolving pronominal anaphora in Turkish using Hobbs' Naïve Algorithm
Küçük Resim Yok
Tarih
2005
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
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' Naïve Algorithm [4, 5, 6], which exploits only the surface syntax of sentences in a given text. COPYRIGHT © ENFORMATIKA.
Açıklama
WEC'05: 3rd World Enformatika Conference -- 27 April 2005 through 29 April 2005 -- Istanbul -- 66381
Anahtar Kelimeler
Anaphora Resolution; Naïve Algorithm; Pronoun Resolution; Syntax-Based Algorithms, Algorithms; Mathematical Models; Syntactics; Anaphora Resolution; Naïve Algorithm; Pronoun Resolution; Syntax-Based Algorithms; Computational Methods
Kaynak
Proceedings - WEC'05: 3rd World Enformatika Conference
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
5
