搜索结果: 1-5 共查到“计算语言学 Anaphora Resolution”相关记录5条 . 查询时间(0.156 秒)
A Twin-Candidate Model for Learning-Based Anaphora Resolution
Computing language Twin-Candidate
2015/9/6
The traditional single-candidate learning model for anaphora resolution considers the antecedent
candidates of an anaphor in isolation, and thus cannot effectively capture the preference relationship...
Comparing Knowledge Sources for Nominal Anaphora Resolution
Comparing Knowledge Sources Nominal Anaphora Resolution
2015/8/31
We compare two ways of obtaining lexical knowledge for antecedent selection in other-anaphora and definite noun phrase coreference. Specifically, we compare an algorithm that relies on links encoded i...
Implementing the Binding and Accommodation Theory for Anaphora Resolution and Presupposition Projection
Accommodation Theory Anaphora Resolution Presupposition Projection
2015/8/28
Computational aspects of Van der Sandt’s binding and accommodation theory (BAT) for presupposition projection and anaphora resolution are presented and discussed in this article. BAT is reformulated t...
Introduction to the Special Issue on Computational Anaphora Resolution
Computational Anaphora Resolution Special Issue
2015/8/26
Anaphora accounts for cohesion in texts and is a phenomenon under active study
in formal and computational linguistics alike. The correct interpretation of anaphora
is vital for natural language pro...
This paper presents an algorithm for identifying noun phrase antecedents of third person personal
pronouns, demonstrative pronouns, reflexive pronouns, and omitted pronouns (zero pronouns)
in ...