搜索结果: 1-15 共查到“知识库 应用语言学 resolution”相关记录20条 . 查询时间(0.031 秒)
We describe a structure learning system for unrestricted coreference resolution that explores two key modeling techniques: latent coreference trees and automatic entropy-guided feature induction. The ...
A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution
Hypergraph Partitioning Approach Coreference Resolution
2015/9/11
This work is focused on research in machine learning for coreference resolution. Coreference resolution is a natural language processing task that consists of determining the expressions in a discours...
Deterministic Coreference Resolution Based on Entity-Centric,Precision-Ranked Rules
Coreference Resolution Entity-Centric Precision-Ranked Rules
2015/9/11
We propose a new deterministic approach to coreference resolution that combines the global information and precise features of modern machine-learning models with the transparency and modularity of de...
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...
A Corpus-Based Evaluation of Centering and Pronoun Resolution
Pronoun Resolution Centering
2015/8/26
In this paper we compare pronoun resolution algorithms and introduce a centering algorithm (LefRight Centering) that adheres to the constraints and rules of centering theory and is an alternative
to ...
Design and Enhanced Evaluation of a Robust Anaphor Resolution Algorithm
Resolution Algorithm Design
2015/8/26
Syntactic coindexing restrictions are by now known to be of central importance to practical
anaphor resolution approaches. Since, in particular due to structural ambiguity, the assumption
of the ava...
A Machine Learning Approach to Coreference Resolution of Noun Phrases
Noun Phrases Coreference Resolution
2015/8/26
In this paper, we present a learning approach to coreference resolution of noun phrases in unrestricted text. The approach learns from a small, annotated corpus and the task includes resolving
not ju...
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 ...
The Uncommon Denominator: A Proposal for Consistent Reporting of Pronoun Resolution Results
Uncommon Denominator Pronoun Resolution Results
2015/8/26
Pronoun resolution studies compute performance inconsistently and describe results incompletely. We propose a new reporting standard that improves the exposition of individual results
and the possibi...
This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A varian...
An important aspect of the interpretation of multimodal messages is the ability to identify when
the same object in the world is the referent of symbols in different modalities. To understand the
ca...
Stanford’s Multi-Pass Sieve Coreference Resolution System at the CoNLL-2011 Shared Task
Stanford Coreference Resolution System CoNLL-2011 Shared Task
2015/6/10
This paper details the coreference resolution system submitted by Stanford at the CoNLL- 2011 shared task. Our system is a collection of deterministic coreference resolution models that incorporate le...