Triple
T9655124
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Paul Postal |
E233428
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Edge-Based Clausal Syntax
Edge-Based Clausal Syntax is a theoretical linguistics work by Paul Postal that develops a clause structure framework organized around hierarchical edge positions rather than traditional phrase-structure configurations.
|
E812447
|
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: Edge-Based Clausal Syntax | Statement: [Paul Postal, notableWork, Edge-Based Clausal Syntax]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Edge-Based Clausal Syntax Context triple: [Paul Postal, notableWork, Edge-Based Clausal Syntax]
-
A.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
B.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
C.
Practical Aspects of Declarative Languages
Practical Aspects of Declarative Languages is an academic conference focused on the practical implementation, application, and evaluation of declarative programming languages and related technologies.
-
D.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
E.
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.
- 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: Edge-Based Clausal Syntax Triple: [Paul Postal, notableWork, Edge-Based Clausal Syntax]
Generated description
Edge-Based Clausal Syntax is a theoretical linguistics work by Paul Postal that develops a clause structure framework organized around hierarchical edge positions rather than traditional phrase-structure configurations.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Edge-Based Clausal Syntax Target entity description: Edge-Based Clausal Syntax is a theoretical linguistics work by Paul Postal that develops a clause structure framework organized around hierarchical edge positions rather than traditional phrase-structure configurations.
-
A.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
B.
Z3: An Efficient SMT Solver
Z3: An Efficient SMT Solver is a high-performance satisfiability modulo theories (SMT) solver widely used in program verification, formal methods, and automated reasoning.
-
C.
Practical Aspects of Declarative Languages
Practical Aspects of Declarative Languages is an academic conference focused on the practical implementation, application, and evaluation of declarative programming languages and related technologies.
-
D.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
E.
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.
- 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_69ca848c1ba88190b84b410cd14627fc |
completed | March 30, 2026, 2:11 p.m. |
| NER | Named-entity recognition | batch_69cd9bdbdd948190a4545a5df0f7af77 |
completed | April 1, 2026, 10:27 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d18270dee481909c8d2de1fafdaf5b |
completed | April 4, 2026, 9:28 p.m. |
| NEDg | Description generation | batch_69d18324756c819089eb7edc107ed8b2 |
completed | April 4, 2026, 9:31 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1856b88908190a787765e1d8f001f |
completed | April 4, 2026, 9:40 p.m. |
Created at: March 30, 2026, 8:13 p.m.