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

Tüfekçi P.Kiliçaslan Y.2024-06-122024-06-1220059759845849https://hdl.handle.net/20.500.14551/17773WEC'05: 3rd World Enformatika Conference -- 27 April 2005 through 29 April 2005 -- Istanbul -- 66381In 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.eninfo:eu-repo/semantics/closedAccessAnaphora Resolution; Naïve Algorithm; Pronoun Resolution; Syntax-Based AlgorithmsAlgorithms; Mathematical Models; Syntactics; Anaphora Resolution; Naïve Algorithm; Pronoun Resolution; Syntax-Based Algorithms; Computational MethodsA computational model for resolving pronominal anaphora in Turkish using Hobbs' Naïve AlgorithmConference Object513172-s2.0-30844440752N/A