Triple

T10763797
Position Surface form Disambiguated ID Type / Status
Subject PEP 634 E253900 entity
Predicate title P38 FINISHED
Object Structural Pattern Matching: Specification E253899 NE FINISHED

Named-entity recognition

Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's NE type shown above.

Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Structural Pattern Matching: Specification | Statement: [PEP 634, title, Structural Pattern Matching: Specification]

Disambiguation candidates (1 decision)

The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Structural Pattern Matching: Specification
Context triple: [PEP 634, title, Structural Pattern Matching: Specification]
  • A. Structural Pattern Matching chosen
    Structural Pattern Matching is a Python language feature, introduced via PEP 622, that enables powerful, declarative matching of complex data structures using a `match`/`case` syntax.
  • B. Analysis Patterns: Reusable Object Models
    Analysis Patterns: Reusable Object Models is a software engineering book by Martin Fowler that presents recurring object-oriented design solutions for modeling complex business domains.
  • C. Hindley–Milner type system
    The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
  • D. Domain-Specific Languages
    Domain-Specific Languages is a technical book by Martin Fowler that explores the design, implementation, and practical use of specialized programming languages tailored to specific problem domains.
  • E. Boyer–Moore theorem prover
    The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 batches)

Stage Batch ID Job type Status
creating batch_69d6aa5f54f4819082d0bbcb6f8797e6 elicitation completed
NER batch_69d731a504948190943f0e27c0d891ed ner completed
NED1 batch_69de2351db9c8190983ac834ea069fb4 ned_source_triple completed
Created at: April 8, 2026, 9:16 p.m.