A computational model for resolving pronominal anaphora in Turkish using Hobbs' Naïve Algorithm

Basit Öğe Kaydı
dc.authorscopusid11539603200
dc.authorscopusid24481295000
dc.contributor.authorTüfekçi P.
dc.contributor.authorKiliçaslan Y.
dc.date.accessioned2024-06-12T10:29:30Z
dc.date.available2024-06-12T10:29:30Z
dc.date.issued2005
dc.descriptionWEC'05: 3rd World Enformatika Conference -- 27 April 2005 through 29 April 2005 -- Istanbul -- 66381en_US
dc.description.abstractIn 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.en_US
dc.identifier.endpage17en_US
dc.identifier.isbn9759845849
dc.identifier.scopus2-s2.0-30844440752en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage13en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14551/17773
dc.identifier.volume5en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofProceedings - WEC'05: 3rd World Enformatika Conferenceen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAnaphora Resolution; Naïve Algorithm; Pronoun Resolution; Syntax-Based Algorithmsen_US
dc.subjectAlgorithms; Mathematical Models; Syntactics; Anaphora Resolution; Naïve Algorithm; Pronoun Resolution; Syntax-Based Algorithms; Computational Methodsen_US
dc.titleA computational model for resolving pronominal anaphora in Turkish using Hobbs' Naïve Algorithmen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu