Coreference Resolution and Entity Linking
Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24
80 cards
Introduction
- What are mentions (referring expressions), referents, and coreference?Mentions are linguistic expressions like her or Victoria Chen; the referent is the discourse entity referred to. Two or more mentions that refer to the same discourse entity corefer.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 539
- Give three applications that need coreference resolution.A dialogue system resolving “I’ll take the second one” to a flight it listed; QA knowing who she is in “She was born in Warsaw”; MT from a pro-drop language like Spanish choosing “he says” vs “she says”.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 539
- What is a discourse model, and what does it mean for a referent to be evoked or accessed?A mental model built incrementally while interpreting a text, holding the entities referred to, their properties and relations. A first mention evokes a representation into the model; later mentions access it.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 539
- Define anaphora, anaphor, antecedent and singleton.Anaphora: reference to an entity previously introduced; the referring expression is an anaphor; the prior coreferring mention is its antecedent. A singleton is an entity mentioned only once.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 540
- What is coreference resolution, and what two subtasks does it comprise?Determining whether mentions corefer, producing coreference chains (clusters). Subtasks, often done jointly: (1) identify the mentions, (2) cluster them into chains/discourse entities.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 540
- Find the coreference chains in: “Victoria Chen, CFO of Megabucks Banking, saw her pay jump to $2.3 million, as the 38-year-old became the company’s president. It is widely known that she came to Megabucks from rival Lotsabucks.”
Mentions can nest: her is inside her pay, a different entity.1 {Victoria Chen, her, the 38-year-old, she} 2 {Megabucks Banking, the company, Megabucks} 3 {her pay} 4 {Lotsabucks} - Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 540
- What is entity linking (entity resolution), and what is wikification?Mapping a discourse entity to a real-world individual in an ontology (e.g. Washington: the state, the city, or George Washington). Wikification uses Wikipedia pages as the entity ids.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, pp. 540–541
- What is event coreference?Deciding whether two event mentions refer to the same event, e.g. buy and acquisition in two sentences about AMD and ATI. Event mentions are harder to detect since they can be verbal or nominal.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 541
- What is discourse deixis?An anaphor referring back to a discourse segment: after “According to Soleil, Beau just opened a restaurant”, that can be a speech act (“that turned out to be a lie”), a proposition (“that was false”) or a manner of description.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Introduction, p. 541
24.1 Coreference phenomena: linguistic background
- What are the four types of referring expressions?Indefinite NPs, definite NPs, pronouns (including demonstratives and zero anaphors), and names.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 542
- What do indefinite NPs typically do in discourse?Introduce entities new to the hearer: a beautiful goose, some walnuts, colloquial this beautiful cauliflower.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 542
- What makes the referent of a definite NP identifiable?Prior mention in the text (the white stallion), the hearer’s world knowledge (the New York Times), or uniqueness implied by the description (the car keys). Over half of newswire definite NPs are non-anaphoric.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 542
- What are cataphora and bound pronouns?Cataphora: the pronoun comes before its referent (“Even before she saw it, Dorothy had been thinking about the Emerald City”). Bound: the pronoun acts like a variable bound by a quantifier (“Every dancer brought her left arm forward”).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 542
- What is a zero anaphor?An anaphor with no lexical realization, possible in languages like Chinese, Japanese and Italian: “Giovanni andò a far visita a degli amici. Per via φ comprò del vino.” Zero anaphors complicate mention detection.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 543
- What are the information status categories of Prince (1981)?
type discourse hearer example brand new new new a fruit unused new old Marie Curie old (evoked) old old it after “a new restaurant” inferrable new new, but inferable the chef of a restaurant - Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, pp. 543–544
- What is a bridging inference?Inferring that a new entity belongs to the discourse model through world knowledge about other entities: “I went to a superb restaurant. The chef had just opened it.”; “Mix flour, butter and water. Knead the dough.”
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 544
- How does an entity’s salience (accessibility) affect the form of its mentions?Very accessible referents can be referred to with less material (pronouns need high salience). First mentions tend to be long (full name, title, appositive: Victoria Chen, CFO of Megabucks Banking); later ones shorter (Ms. Chen, the 38-year-old, she), though not monotonically.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 544
- Why can’t a car in “Janet doesn’t have a car” be referred back to?Under negation the NP doesn’t create a discourse referent (Karttunen 1969), so “*It is a Toyota” is bad.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 544
- Which four structures look like NPs but are not mentions in coreference tasks?Appositives (United, a unit of UAL,), predicative/attributive NPs (became the company’s president, jump to $2.3 million), expletive/pleonastic pronouns (it is raining, clefts, extraposition), and generics (“I love mangos. They are very tasty”, generic you).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 545
- Why can’t coreference systems enforce number agreement strictly?Semantically plural entities can be it or they (“IBM announced… They have been working on it”), and singular they refers to individuals.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, pp. 545–546
- What exception to person agreement does quotation cause?In “‘I voted for Nader because he was most aligned with my values,’ she said”, I, my and she corefer.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 546
- What do binding theory constraints say about reflexive and non-reflexive pronouns?Reflexives corefer with the subject of the most immediate clause (“Janet bought herself…”, herself = Janet); non-reflexives cannot (“Janet bought her…”, her ≠ Janet).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 546
- How do recency and grammatical role affect pronoun resolution?Recent entities are more salient; subjects are more salient than objects, which are more salient than obliques: “Billy Bones went to the bar with Jim Hawkins. He called for rum.” He = Billy; swap the subject and he = Jim.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 546
- How does verb semantics bias pronoun interpretation in “John telephoned/criticized Bill. He lost the laptop”?With telephoned, he = John; with criticized, he = Bill. Implicit causality: the implicit cause of criticizing is its object, of telephoning its subject, and the implicit cause is more salient.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 547
- How do selectional restrictions help in “I ate the soup in my new bowl after cooking it for hours”?Verbs restrict their arguments: food, not a bowl, is what one eats and cooks for hours, so it = the soup.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.1, p. 547
24.2 Coreference tasks and datasets
- What must an end-to-end coreference system deal with on raw text?Detecting mentions, pronominal anaphora (her → Victoria Chen), filtering non-referential pronouns (pleonastic it), definite NPs (the 38-year-old, the company) and name variants (Megabucks = Megabucks Banking).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.2, p. 547
- Why are scores much higher on corpora that don’t annotate singletons?Singletons are the majority of mentions in running text (60–70% of entities) and are hard to tell from non-referential NPs.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.2, p. 548
- What is gold mention detection in coreference evaluation?The system is given human-labeled mention boundaries and only has to cluster them.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.2, p. 548
- What are the main characteristics of OntoNotes coreference annotation?English and Chinese (about a million words each, many genres) plus Arabic newswire; the CoNLL-2012 shared task is based on it. No singletons; generics and pleonastic pronouns unmarked; appositives included inside the mention; prenominal modifiers are mentions only if proper nouns (UN in UN policy, not wheat in wheat fields).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.2, p. 548
- Name coreference corpora that mark richer phenomena than OntoNotes.ISNotes (information status, bridging), LitBank (literary novels, with singletons), AnCora-CO (Spanish and Catalan, with discourse deixis), ARRAU (all NPs including singletons; dialogue and fiction; bridging, discourse deixis, generics, ambiguity).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.2, p. 548
24.3 Mention detection
- How do mention detection algorithms usually propose candidates?Very liberally, favoring recall and filtering later: all NPs, possessive pronouns and named entities from parsers and NER, or (span-based systems) all n-gram spans up to about 10 words.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.3, p. 548
- How do rule-based systems detect pleonastic it?Patterns with dictionaries of modal adjectives and cognitive verbs (Lappin and Leass):
It is Modaladjective that S It is Modaladjective (for NP) to VP It is Cogv-ed that S It seems/appears/means/follows (that) S- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.3, p. 549
- Give the common rule-based first-pass mention detector for OntoNotes (Lee et al. 2013).(1) Take all NPs, possessive pronouns and named entities. (2) Remove numeric quantities, mentions embedded in larger mentions, adjectival nation forms and stop words. (3) Remove pleonastic it by regex patterns.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.3, p. 549
- What learned components help mention detection?Referentiality classifiers, anaphoricity classifiers (is this NP an anaphor?) and discourse-new classifiers (is it new and a potential antecedent?), using features like head word, context, definiteness, animacy, length and position.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.3, p. 549
- Why does hard filtering by an anaphoricity classifier work poorly, and what is used instead?A high threshold loses recall; a low one admits pleonastic mentions and hurts precision. Modern systems do mention detection, anaphoricity and coreference jointly in one end-to-end model.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.3, p. 550
- How did Bergsma et al. use web n-grams to detect non-anaphoric it?Turn the context into a pattern (make * in advance, make * in Hollywood) and see what words fill the wildcard: non-anaphoric (idiomatic) contexts mostly allow only it, anaphoric ones allow many NPs (make them in advance).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.3, p. 550
24.4 Architectures for coreference algorithms
- Along which two dimensions does Ng (2010) categorize coreference architectures?Entity-based (representing discourse entities) vs mention-based (considering mentions independently), and whether ranking models directly compare candidate antecedents.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 551
- What is the mention-pair architecture?A binary classifier given a candidate anaphor and a candidate antecedent decides coreferring or not, e.g. \(p(coref \mid \text{Victoria Chen}, \text{she})\) should be high and \(p(coref \mid \text{Megabucks Banking}, \text{she})\) low.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 551
- How are training pairs selected for the mention-pair model (Soon et al. 2001)?For each anaphor: one positive pair with its closest antecedent, and a negative pair for each mention in between. For the company: positive (the company, Megabucks Banking); negatives (the company, her), (the company, her pay), (the company, the 38-year-old).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, pp. 551–552
- What are closest-first and best-first clustering?After pairwise classification: closest-first runs right to left from mention \(i-1\) and links the first antecedent with probability > .5; best-first links the most probable antecedent. Then take the transitive closure.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 552
- What are the two main problems of the mention-pair model?It doesn’t compare candidate antecedents with each other, and it ignores the discourse model: each decision is local to a pair, without other mentions of the same entity.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 552
- What is the mention-ranking architecture?For mention \(i\), a softmax over all prior mentions plus a dummy \(\epsilon\) (no antecedent: discourse-new or non-anaphoric), jointly learning anaphoricity and coreference.
One softmax over all candidates; any gold antecedent counts - Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 552
- Why is training trickier for mention-ranking than for mention-pair models?The best antecedent is latent: the gold clustering gives a whole set of legal antecedents. Heuristics pick one (e.g. the closest), or the loss sums the probability of all correct antecedents.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 553
- What are entity-based coreference models?They link a mention to a previous discourse entity (cluster) rather than a mention, using cluster features (size, shape like P-Pr-D for proper–pronoun–definite, aggregated pair probabilities) or learned cluster representations. Gains have been small, so mention ranking is more common.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.4, p. 553
24.5 Classifiers using hand-built features
- Why are feature-based coreference classifiers still useful?They are lightweight when compute or data are scarce, and their features help error analysis even for neural systems.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.5, pp. 553–554
- What feature classes do feature-based coreference classifiers use?Features of the anaphor, of the candidate antecedent, and of the pair; entity-based models add features of the antecedent’s cluster and of the relation between the anaphor and the cluster’s mentions.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.5, p. 554
- Give example features for the pair (Victoria Chen, she).
head words Victoria / she attributes Sg-F-A-3-PER for both length 2 / 1 mention type P / Pr entity shape P-Pr-D sentence distance 1 i-within-i F exact string / head match F - Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.5, p. 554
- Which hand-built features are particularly useful for coreference?Exact string match, entity headword agreement, mention distance; for pronouns exact attribute match and i-within-i; for nominals and names word inclusion and cosine.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.5, p. 554
- Why are feature conjunctions important in feature-based coreference?Moving from individual features to conjunctions gained about 4 F1 points; conjunctions can be hand-designed, all pairs, or learned by decision trees or random forests.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.5, p. 555
- Which hand-built features still help neural coreference models?Not shallow ones like string match or mention type (contextual embeddings cover them), but mention length, distance between mentions, and genre.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.5, p. 555
24.6 A neural mention-ranking algorithm
- Outline the e2e-coref algorithm (Lee et al. 2017).Consider all spans up to about 10 words; score each as a mention; prune; for each remaining span \(i\), choose an antecedent \(y_i \in \{1, \ldots, i-1, \epsilon\}\) with \(P(y_i) = \frac{\exp s(i, y_i)}{\sum_{y'} \exp s(i, y')}\), where \(s(i, j) = m(i) + m(j) + c(i, j)\).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.6, p. 555
- Why is \(s(i, \epsilon)\) fixed to 0 in e2e-coref?So if any real antecedent scores positive the model picks the highest-scoring one, and if all are negative it abstains (no antecedent).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.6, p. 555
- How is a span represented in e2e-coref?\(g_i = [h_{START(i)}, h_{END(i)}, h_{ATT(i)}]\): the encoder outputs (e.g. BERT) of the first and last tokens plus an attention-weighted sum over the span’s tokens that learns to find the head word.
Attention weights favor the head (Service) - Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.6, pp. 555–556
- How are the mention score \(m(i)\) and antecedent score \(c(i, j)\) computed?By feedforward networks: \(m(i) = w_m \cdot FFN_m(g_i)\), \(c(i, j) = w_c \cdot FFN_c([g_i, g_j, g_i \circ g_j])\), where \(\circ\) is elementwise multiplication (a similarity feature). \(m\) also prunes spans at inference.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.6, p. 556
- What loss does e2e-coref train with?Since the antecedent is latent, maximize the total probability of all gold antecedents before \(i\): \(L = \sum_i -\log \sum_{\hat{y} \in Y(i) \cap GOLD(i)} P(\hat{y})\) (with \(GOLD(i) = \epsilon\) if \(i\) is in no gold cluster).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.6, pp. 557–558
24.7 Entity linking
- What are the two stages of entity linking?Mention detection and mention disambiguation.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 558
- What does the TAGME linker precompute from Wikipedia?A catalog of entities (pages) indexed for search, in-link counts in(e), and an anchor dictionary: for each page, its title and the anchor texts of links pointing to it, with each anchor’s frequency, link count and \(linkprob(a) = link(a)/freq(a)\).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 558
- How does TAGME detect mentions?Look up every token sequence up to 6 words in the anchor dictionary, then prune, e.g. substrings with low linkprob (Ada Lovelace kept, Lovelace pruned, born not an anchor at all).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 559
- What is the prior probability factor in TAGME disambiguation, and when does it fail?\(p(e \mid a) = \frac{count(a \to e)}{link(a)}\). In “What Chinese Dynasty came before the Yuan?” it picks the most common sense, the currency, missing Yuan dynasty.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 559
- How does TAGME measure relatedness between two Wikipedia entities?By shared in-links: \(rel(A, B) = \frac{\log\max(|in(A)|, |in(B)|) - \log|in(A) \cap in(B)|}{\log|W| - \log\min(|in(A)|, |in(B)|)}\).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 559
- How does TAGME combine relatedness and prior?Each other anchor \(b\) votes for \(a \to X\) with \(\frac{1}{|E(b)|}\sum_{Y \in E(b)} rel(X, Y)p(Y \mid b)\); sum the votes, take the entities within \(\epsilon\) of the best relatedness, and choose the one with the highest prior. Finally prune pairs whose average of coherence and linkprob is below a threshold.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 560
- How do bi-encoder entity linkers work?Encode the candidate mention span and the entity separately and score them by dot product, so entity embeddings for the whole knowledge base can be precomputed and cached.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 560
- How does ELQ detect mention spans?Encode the question with BERT, then \(p([i, j]) = \sigma\big(s_{start}(i) + s_{end}(j) + \sum_{t=i}^{j} s_{mention}(t)\big)\), each score a learned vector dotted with token encodings.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, pp. 560–561
- How does ELQ link spans to entities?Entity embedding: BERT[CLS] over the page title and first 128 tokens,
[CLS] t(e) [ENT] d(e) [SEP]. Span embedding: the average of its token encodings. Score by dot product, softmax over entities.- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, p. 561
- How is ELQ trained?Fully supervised on questions with linked entity spans (e.g. WebQSP-EL, GraphQ-EL), jointly optimizing a binary cross-entropy mention detection loss and \(-\log p(e_g \mid [i, j])\) for the gold entity.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.7, pp. 561–562
24.8 Evaluation of coreference resolution
- Name the common coreference evaluation metrics.Link-based MUC and BLANC, mention-based B³, entity-based CEAF, and link-based entity-aware LEA. CoNLL F1 averages MUC, B³ and CEAF-e; use the reference implementations.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.8, p. 562
- How is the MUC F-measure computed, and what are its biases?From coreference links common to hypothesis and reference: precision = common links / hypothesis links, recall = common links / reference links. It favors systems producing large chains and ignores singletons.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.8, p. 562
- How is B³ computed? Work it for reference {a, b, c}, {d, e} and hypothesis {a, b}, {c, d, e}.Per mention: precision \(|H \cap R| / |H|\), recall \(|H \cap R| / |R|\), then a weighted average (here uniform).
mention P R a, b 2/2 2/3 c 1/3 1/3 d, e 2/3 2/2 average 11/15 ≈ .73 11/15 ≈ .73 - Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.8, pp. 562–563
- Why might named-entity tasks need alternative coreference metrics?A chain with all the right pronouns but no name, or the wrong name, is useless for IE; metrics can weight mentions by informativeness or require at least one name variant (NEC F1).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.8, p. 563
24.9 Winograd Schema problems
- What is Winograd’s classic example of hard coreference?“The city council denied the demonstrators a permit because they feared/advocated violence.” They is the council with feared and the demonstrators with advocated, requiring causal reasoning and world knowledge.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.9, p. 563
- What are the characteristics of Winograd Schema problems?Two parties; a pronoun that prefers one but could grammatically refer to either; a question asking which; changing one word flips the answer (“The trophy didn’t fit into the suitcase because it was too large/small”).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.9, pp. 563–564
- What happened to the Winograd Schema Challenge with pretrained language models?A large share of the problems became solvable by fine-tuned pretrained LMs, which encode much world knowledge, so harder datasets were proposed (e.g. KnowRef).
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.9, p. 564
24.10 Gender bias in coreference
- How does WinoBias test gender bias in coreference?Sentences with a stereotypically male and a stereotypically female occupation and a pronoun that grammar and gender can’t disambiguate: “The secretary called the physician and told him/her about a new patient.” Biased systems are more accurate on pro-stereotypical cases.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.10, pp. 564–565
- How did Zhao et al. reduce coreference gender bias?Gender-swap all entities in OntoNotes to create a second dataset, train on original plus swapped, and use debiased embeddings (later, retrain ELMo with augmentation); WinoBias bias disappeared without hurting OntoNotes accuracy.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.10, p. 565
- What is GAP?A gender-balanced corpus of Wikipedia sentences with an ambiguous gendered pronoun and two same-gender names, for Gendered Pronoun Resolution; systems do worse on feminine pronouns.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, §24.10, p. 565
Historical notes
- Who founded the discourse-model view of coreference?Karttunen (1969) formulated the discourse model; Bonnie Webber’s 1978 dissertation explored how entities are represented in it and how they license later reference.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Historical notes, p. 566
- How does the simplified Hobbs algorithm search for a pronoun’s antecedent?Through NPs: (i) the current sentence right to left from the pronoun, (ii) the previous sentence left to right, (iii) two sentences back left to right, (iv) the current sentence left to right after the pronoun (cataphora). Pick the first NP agreeing in number, gender and person.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Historical notes, pp. 566–567
- How did the MUC competitions shape coreference research?They focused on identity coreference only (ignoring bridging, metonymy, part–whole) and pushed the field toward supervised learning and the MUC metric.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Historical notes, p. 567
- How can coreference and entity linking help each other?Coreference supplies more surface forms for linking; linking adds encyclopedic knowledge to coreference, e.g. that Donald Tsang is a president helps resolve the President.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Historical notes, p. 568
- What coreference relations go beyond identity?Metonymy (Washington for the US) and refocused referents, e.g. “in France the president is elected for seven years, while in the United States he is elected for four”: different individuals.
- Jurafsky & Martin, Speech and Language Processing, 3rd ed. draft, ch. 24, Historical notes, p. 568
Source
- Daniel Jurafsky and James H. Martin. Speech and Language Processing. 3rd edition (draft). https://web.stanford.edu/~jurafsky/slp3/