Assemble annotated data
Collect or create documents with mention spans and cluster IDs (OntoNotes, GAP, or domain-labelled examples), and include noisy, long documents to test robustness.
Resolve referring expressions. Cluster mentions into entities.
Coreference resolution groups textual mentions that refer to the same real-world entity (for example, linking “Mary”, “she” and “the engineer”). Key difficulties include long-distance dependencies, nested mentions, pronouns with ambiguous antecedents, and domain-specific mention forms (contracts, meeting notes). Evaluation usually reports mention-level precision/recall and an aggregate score such as CoNLL F1.
Learning concept · Not a validated service
Coreference resolution groups textual mentions that refer to the same real-world entity (for example, linking “Mary”, “she” and “the engineer”). Key difficulties include long-distance dependencies, nested mentions, pronouns with ambiguous antecedents, and domain-specific mention forms (contracts, meeting notes). Evaluation usually reports mention-level precision/recall and an aggregate score such as CoNLL F1.
A proposed application: extract and link entities across legal contracts or customer-support threads so analysts can review consolidated entity histories. For critical domains a human reviewer should verify outputs before decisions are made; this extension is not implemented in the supplied starter.
Collect or create documents with mention spans and cluster IDs (OntoNotes, GAP, or domain-labelled examples), and include noisy, long documents to test robustness.
Start with a mention-pair or span-ranking baseline using transformer embeddings and a small span-scoring network; keep preprocessing deterministic for reproducibility.
Report mention detection precision/recall, B3 and CoNLL F1, and inspect typical failure cases such as pronoun ambiguity and nested mentions.
Present clusters with example mentions and a correction interface so human annotators can merge/split clusters for iterative improvement.
The supplied starter performs a small text binary-classification demo: it splits six short sentences with integer labels, fits a TF-IDF (unigram+bigram) + LogisticRegression pipeline, prints a sklearn classification report on the tiny test split, and shows one sample prediction. It does not implement mention detection, span scoring, mention linking, or any coreference-specific algorithm or dataset.
model = Pipeline(
steps=[
("tfidf", TfidfVectorizer(ngram_range=(1, 2), min_df=1)),
("classifier", LogisticRegression(max_iter=1000)),
]
)
model.fit(X_train, y_train)
predictions = model.predict(X_test)
The starter dataset contains six short, unrelated sentences with binary labels and the code trains a TF-IDF + logistic-regression classifier. This is a generic text classification baseline and does not implement coreference tasks (span extraction, mention linking, cluster formation) nor use any coreference-labelled data; results therefore do not validate a coreference model.
Proposed extension: replace the starter data with a small annotated corpus (mention spans and cluster IDs), implement a span-based transformer baseline that scores candidate spans and links them into clusters, and expose results through a simple web interface for human review and correction.
This is a potential application pathway, not a delivered product. The supplied starter does not implement this service or validate it with real users.
Networkers Home runs this topic inside its AI Engineer Course, with placement support and hands-on labs.