Michael Strube

13 paper cards in Mova's library · 1999–2022

Michael Strube wrote 13 of the papers Mova reads, in 1999–2022, most of them on Coreference resolution, Discourse analysis, Speech act theory; often with Nafise Sadat Moosavi, Massimo Poesio, Vincent Ng.

OpenAlex · ORCID · h-index 74 · 20807 citations · 485 works — openalex, 2026-10-18

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: Google Scholar · Semantic Scholar · dblp · ACL Anthology · ORCID

Topics: Coreference resolution 12 · Discourse analysis 3 · Speech act theory 1

Ideas Mova took (1)

From the ideas ledger: an idea tried, kept or queued, or measured with no gain, and what it gave.

measured, no gain — Implement the discourse-deixis baseline as a sieve in coref/src/sieve.rs (the disabled demonstratives slot is the place): this/that (and it as subject of happened, was true, means) not followed by a noun → the preceding clause, as an event mention with a… (The CODI-CRAC 2022 Shared Task on Anaphora, Bridging, and… · deixis sieve (event «it», bare this/that → previous clause, as an added clause mention): 17 of 141 right on GUM dev, −0.76/−0.09 CoNLL gold; in coref, off by…)

Papers

The CODI-CRAC 2022 Shared Task on Anaphora, Bridging, and Discourse Deixis in Dialogue (2022)
The second edition of a shared task on anaphora in dialogue, with three tasks: identity anaphora (including split antecedents and singletons), bridging reference, and discourse deixis (a pronoun such as that or this referring to an event, fact or utterance).
The CODI-CRAC 2021 Shared Task on Anaphora, Bridging, and Discourse Deixis in Dialogue (2021)
The shared task asks systems to find anaphoric relations in conversation, a genre that OntoNotes-style corpora barely cover.
Using Automatically Extracted Minimum Spans to Disentangle Coreference Evaluation from Boundary Detection (2019)
Scoring coreference by maximum spans mixes coreference errors with boundary errors such as PP attachment: «an extensive presence» and «an extensive presence, of course in this country» count as different mentions, and the system is penalised as if it had linked the wrong thing.
Unrestricted Bridging Resolution (2018)
The article presents ISNotes (50 Wall Street Journal texts, OntoNotes part) annotated for fine-grained information status — new, old, mediated subtypes (world knowledge, syntactic, comparative, function, aggregate) and bridging — with 663 bridging anaphors, and a two-stage system for bridging with no restriction on…
Using Linguistic Features to Improve the Generalization Capability of Neural Coreference Resolvers (2018)
Neural coreference resolvers that win on CoNLL-2012 lose their ranking on WikiCoref, which uses the same guidelines.
Lexical Features in Coreference Resolution: To be Used With Caution (2017)
Learned coreference resolvers owe much of their gain over rule systems to lexical features (surface words or embeddings of heads, first/last words, context).
Which Coreference Evaluation Metric Do You Trust? A Proposal for a Link-based Entity Aware Metric (2016)
The paper shows a flaw shared by B³, CEAF and BLANC, the «mention identification effect»: because they count common mentions rather than links, a system gains recall and precision merely by putting gold mentions into its output, even when those mentions are linked wrongly; experiments on CoNLL outputs that add…
Scoring Coreference Partitions of Predicted Mentions: A Reference Implementation (2014) measured
Coreference metrics such as MUC, B-cubed and CEAF were originally defined for gold mentions, and different research groups adapted them to predicted mentions in incompatible ways, often by adding or removing mentions artificially so that the key and response partitions line up.
Recall Error Analysis for Coreference Resolution (2014)
The paper proposes a link-based framework for analysing coreference errors and uses it for a recall error analysis of four English systems, two deterministic and two learning-based.
Global Inference for Bridging Anaphora Resolution (2013)
The paper addresses antecedent selection for bridging anaphora with no limits on anaphor or relation types.
Tree Linearization in English: Improving Language Model Based Approaches (2009)
The paper compares two ways of turning a dependency tree into a word string in English. The standard method ("overgenerate and rank") makes all permutations allowed by a few hard constraints and picks the one a trigram language model prefers. The second method keeps the trigram model for the order inside phrases, and…
Dialogue Acts, Synchronizing Units, and Anaphora Resolution (2000)
Not read: this card is written from what is reliably known about the paper, and every idea is marked to check against the text.
Resolving Discourse Deictic Anaphora in Dialogues (1999)
The paper addresses anaphora in spoken dialogue, using five Switchboard telephone conversations (three for testing).

Co-authors (18)

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/authors/michael-strube/