Natural Language Processing · free preview
Coreference Resolution and Entity Linking
Mentions, referents and non-referring expressions, mention-pair and span-ranking resolution algorithms, MUC and B3 evaluation, and linking names to knowledge base entries.
1. Coreference Resolution and Entity Linking
Coreference Resolution and Entity Linking
2. Pairwise, ranking and span-based resolution
Pairwise, ranking and span-based resolution
3. Scoring chains with MUC and B3
Scoring chains with MUC and B3
4. Linking names to the world
Linking names to the world
5. Which it is nothing at all
In It rained hard during the crossing, and the skipper logged it in the book, what should a mention detector do with the two occurrences of it?
6. The zero that means no antecedent
In the end-to-end span-ranking coreference model, the antecedent variable ranges over earlier spans plus a dummy whose score is fixed at 0. What does scoring at exactly 0 accomplish?
7. Counting candidate spans
An end-to-end coreference model considers every contiguous span in a -word document before length truncation. How many candidate spans are there?
8. One mention's B3 recall
For a given mention, the hypothesis chain containing it has mentions, of which also appear in the gold chain, and the gold chain has mentions. Compute the mention's B3 recall, rounding to three decimals.
9. Two metrics, two philosophies
A system splits one gold four-mention chain into two two-mention chains and leaves a gold singleton untouched. How do MUC and B3 respond?
Practice this interactively
Free account · instant grading · spaced review that schedules itself.
Start this course for free