A Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs' Naive Algorithm

Basit Öğe Kaydı
dc.contributor.authorTuefeki, Pinar
dc.contributor.authorKilicaslan, Yilmaz
dc.date.accessioned2024-06-12T10:51:36Z
dc.date.available2024-06-12T10:51:36Z
dc.date.issued2005
dc.departmentTrakya Üniversitesien_US
dc.descriptionConference of the World-Academy-of-Science-Engineering-and-Technology -- APR 27-29, 2005 -- Rome, ITALYen_US
dc.description.abstractIn 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.en_US
dc.identifier.endpage17en_US
dc.identifier.issn1307-6884
dc.identifier.startpage13en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14551/18416
dc.identifier.volume5en_US
dc.identifier.wosWOS:000261051400004en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherWorld Acad Sci, Eng & Tech-Waseten_US
dc.relation.ispartofProceedings Of World Academy Of Science, Engineering And Technology, Vol 5en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAnaphora Resolutionen_US
dc.subjectPronoun Resolutionen_US
dc.subjectSyntax-Based Algorithmsen_US
dc.subjectNaive Algorithmen_US
dc.titleA Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs' Naive Algorithmen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu