Triple
T7690422
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Guglielmo Cinque |
E174229
|
entity |
| Predicate | hasNotableWork |
P4
|
FINISHED |
| Object |
Types of A-bar Dependencies
Types of A-bar Dependencies is a seminal linguistics monograph by Guglielmo Cinque that analyzes the structure and behavior of A-bar movement and related syntactic dependencies across languages.
|
E681822
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
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: Types of A-bar Dependencies | Statement: [Guglielmo Cinque, hasNotableWork, Types of A-bar Dependencies]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Types of A-bar Dependencies Context triple: [Guglielmo Cinque, hasNotableWork, Types of A-bar Dependencies]
-
A.
dependency grammar
Dependency grammar is a syntactic theory that analyzes sentence structure in terms of binary relations between words, focusing on how each word depends on a governing head rather than on phrase-structure constituents.
-
B.
Mathematical Structures of Language
Mathematical Structures of Language is a foundational work in mathematical linguistics that applies formal and algebraic methods to analyze the structure of natural languages.
-
C.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
-
D.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
E.
General and Rational Grammar
General and Rational Grammar is a 17th-century French linguistic treatise from the Port-Royal school that seeks to explain the universal, rational principles underlying all human languages.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Types of A-bar Dependencies Triple: [Guglielmo Cinque, hasNotableWork, Types of A-bar Dependencies]
Generated description
Types of A-bar Dependencies is a seminal linguistics monograph by Guglielmo Cinque that analyzes the structure and behavior of A-bar movement and related syntactic dependencies across languages.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Types of A-bar Dependencies Target entity description: Types of A-bar Dependencies is a seminal linguistics monograph by Guglielmo Cinque that analyzes the structure and behavior of A-bar movement and related syntactic dependencies across languages.
-
A.
dependency grammar
Dependency grammar is a syntactic theory that analyzes sentence structure in terms of binary relations between words, focusing on how each word depends on a governing head rather than on phrase-structure constituents.
-
B.
Mathematical Structures of Language
Mathematical Structures of Language is a foundational work in mathematical linguistics that applies formal and algebraic methods to analyze the structure of natural languages.
-
C.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
-
D.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
E.
General and Rational Grammar
General and Rational Grammar is a 17th-century French linguistic treatise from the Port-Royal school that seeks to explain the universal, rational principles underlying all human languages.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69c6995966348190939e6c37ba272c06 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c702421dec8190a74f8ade992ca811 |
completed | March 27, 2026, 10:18 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8a26686a08190acf66586f6c7592b |
completed | March 29, 2026, 3:54 a.m. |
| NEDg | Description generation | batch_69c8a34c93a081908ec3509c3abb3866 |
completed | March 29, 2026, 3:58 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c8a3b4e0a88190ad525c83bd03e09f |
completed | March 29, 2026, 3:59 a.m. |
Created at: March 27, 2026, 4:02 p.m.