Argument Coreference Resolution is the computational task of linking disparate textual mentions—such as pronouns, definite descriptions, and nominal phrases—to a single, unified discourse entity within a legal text. Unlike general-domain coreference, legal argument resolution must disambiguate references to abstract entities like 'this precedent,' 'the aforementioned principle,' or 'that obligation,' which are critical for reconstructing a coherent reasoning chain. The process transforms a linear text into a connected semantic graph, enabling downstream tasks like argument graph construction and reasoning chain reconstruction to operate on precise, non-ambiguous referents.
Glossary
Argument Coreference Resolution

What is Argument Coreference Resolution?
Argument Coreference Resolution is the natural language processing task of identifying and clustering all textual mentions within a legal argument that refer to the same real-world entity, abstract concept, or previously stated claim.
This task is foundational for high-precision legal argument mining because it resolves the anaphoric links that bind a legal narrative together. A system must distinguish whether 'this argument' refers to a party's claim, a court's finding, or a statutory rule, often across sentence and paragraph boundaries. Effective resolution relies on integrating syntactic parsing with domain-specific legal embedding models to understand the semantic context of legal entities. By resolving these links, algorithms can accurately perform cross-document argument linking and citation sentiment analysis, ensuring that the rhetorical structure of a case is correctly mapped.
Key Characteristics
Argument Coreference Resolution is the task of linking multiple textual mentions within a legal argument that refer to the same real-world entity, concept, or prior claim. It is a critical prerequisite for building coherent argument graphs and reasoning chains from unstructured text.
Entity & Concept Grounding
Resolves references to the same real-world entity across a legal text. This includes named entities (e.g., 'Acme Corp.' and 'the Plaintiff'), nominal phrases (e.g., 'the contract' and 'the agreement dated March 1st'), and pronouns (e.g., 'it', 'they').
- Bridging Anaphora: Links a mention to a previously introduced entity that is not a direct coreferent but is contextually related (e.g., 'the court' -> 'the judge').
- Split Antecedents: Identifies when a plural pronoun refers to multiple distinct entities introduced separately (e.g., 'Smith and Jones' -> 'they').
Abstract Claim Linking
Connects mentions that refer to the same proposition or argumentative claim rather than a physical entity. This is unique to argument mining and essential for tracking reasoning.
- Discourse Deixis: Resolves references like 'this argument,' 'that reasoning,' or 'the foregoing' to the specific prior claim they point to.
- Propositional Anaphora: Links a pronoun or noun phrase to a previously stated proposition (e.g., 'The statute is unconstitutional. This renders the contract void.').
Cross-Document Identity Resolution
Extends coreference resolution across multiple legal filings in a single case docket. A claim made in a complaint must be linked to its rebuttal in a motion to dismiss and its final treatment in a judicial opinion.
- Canonical Entity Mapping: Aligns different naming conventions for the same party across documents (e.g., 'Defendant' in one brief vs. 'Respondent' in another).
- Argument Threading: Tracks the evolution of a specific legal argument as it is referenced, attacked, and refined across a sequence of filings.
Lexical & Semantic Variation
Handles the diverse ways the same concept is expressed in legal prose. Resolution systems must be robust to synonymy, hypernymy, and domain-specific jargon.
- Terminological Variation: Maps 'breach of contract' to 'contractual violation' and 'failure to perform.'
- Definite Descriptions: Resolves phrases like 'the aforementioned doctrine' or 'the disputed clause' to their specific antecedents using discourse context.
Cataphoric & Structural Resolution
Identifies references that point forward in the text (cataphora) and resolves references based on document structure rather than pure linguistics.
- Cataphora: Resolves a pronoun that precedes its referent (e.g., 'Although he denied it, the defendant later admitted...').
- Structural Salience: Uses the rhetorical role of a sentence (e.g., 'Issue Presented,' 'Holding') to weight the likelihood that a mention within it is the primary antecedent for subsequent references.
Zero Anaphora & Implicit Arguments
Detects and resolves implicit references where the argument or entity is not explicitly mentioned but is grammatically required. Common in pro-drop languages and terse legal writing.
- Null Subject Resolution: Identifies the implied subject of a verb (e.g., 'The contract was signed. [The parties] Agreed to the terms.').
- Implicit Predicate Coreference: Links an elided verb phrase to its antecedent (e.g., 'The plaintiff filed a motion, and the defendant did [file a motion] too.').
Frequently Asked Questions
Explore the mechanics of linking disparate textual mentions to the same underlying entities, concepts, and claims within complex legal reasoning.
Argument Coreference Resolution is the computational task of identifying and linking multiple textual mentions within a legal argument that refer to the same real-world entity, concept, or prior claim. Unlike general coreference resolution which links pronouns to nouns, this specialized task operates on the rhetorical level. It must determine that 'the plaintiff's central thesis,' 'this assertion,' and 'the aforementioned constitutional challenge' all point to the identical argument node in a reasoning graph. The process typically involves a two-stage pipeline: first, a mention detection module identifies spans that refer to argument components; second, a coreference linking module clusters these mentions using a combination of semantic similarity, syntactic distance, and discourse structure analysis. Modern systems employ span-based neural architectures with attention mechanisms that score candidate antecedent pairs, often fine-tuned on domain-specific legal corpora to understand the formal register of judicial writing.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Argument Coreference Resolution is a foundational discourse-level task. It relies on and enables several adjacent natural language processing capabilities that together reconstruct the full semantic fabric of a legal argument.
Entity Linking
The precursor task of mapping a named entity mention (e.g., 'the plaintiff') to a unique entry in a knowledge base. While coreference resolution groups all mentions of the same entity within a text, entity linking grounds those mentions to a real-world canonical identifier, such as a corporate registry ID or a specific statute URI.
Cross-Document Coreference
Extends the resolution task across a corpus of multiple filings. A 'contract' mentioned in a complaint must be linked to the same 'contract' referenced in a motion to dismiss. This is critical for cross-document argument linking and building a unified case timeline from disparate evidentiary documents.
Anaphora Resolution
The specific linguistic sub-task of resolving anaphoric pronouns ('he,' 'it,' 'this') to their antecedents. In legal text, this is complicated by long-distance dependencies where a pronoun in a conclusion refers to a party defined in a preamble. It is a strict subset of the broader coreference task.
Event Coreference
Focuses on clustering mentions of the same event rather than static entities. For example, 'the breach occurred on March 1st' and 'the subsequent failure to deliver' may refer to the same legally operative event. This is essential for reconstructing fact timelines and analyzing temporal obligations.
Discourse Deixis Resolution
Resolves references to abstract segments of the text itself, such as 'as stated above' or 'for the foregoing reasons.' This is not entity coreference but a parallel discourse navigation task that allows a model to trace the rhetorical structure of an argument back to specific prior claims or sections.
Zero Anaphora Resolution
Handles implicit arguments where a pronoun is syntactically omitted but semantically required, common in pro-drop legal languages. A sentence like 'Ø filed the motion' requires inferring the subject from a prior clause. This demands deep syntactic parsing beyond surface-form matching.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us