Triple
T12516243
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | gzip |
E299197
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object |
LZ77
LZ77 is a foundational lossless data compression algorithm that uses a sliding window to replace repeated occurrences of data with references to a single copy.
|
E986998
|
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: LZ77 | Statement: [gzip, basedOn, LZ77]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: LZ77 Context triple: [gzip, basedOn, LZ77]
-
A.
Lloyd’s algorithm
Lloyd’s algorithm is an iterative clustering method that partitions data into k groups by repeatedly assigning points to the nearest cluster center and updating those centers to minimize within-cluster variance.
-
B.
Huffman
Huffman is a surname most commonly associated with the American computer scientist David A. Huffman, known for developing Huffman coding in information theory and data compression.
-
C.
LZIB
LZIB is the ICAO airport code for M. R. Štefánik Airport, the main international airport serving Bratislava, Slovakia.
-
D.
LZH
LZH is the IATA airport code for Liuzhou Bailian Airport, a commercial airport serving Liuzhou in Guangxi, China.
-
E.
Boyer–Moore string-search algorithm
The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
- 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: LZ77 Triple: [gzip, basedOn, LZ77]
Generated description
LZ77 is a foundational lossless data compression algorithm that uses a sliding window to replace repeated occurrences of data with references to a single copy.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: LZ77 Target entity description: LZ77 is a foundational lossless data compression algorithm that uses a sliding window to replace repeated occurrences of data with references to a single copy.
-
A.
Lloyd’s algorithm
Lloyd’s algorithm is an iterative clustering method that partitions data into k groups by repeatedly assigning points to the nearest cluster center and updating those centers to minimize within-cluster variance.
-
B.
Huffman
Huffman is a surname most commonly associated with the American computer scientist David A. Huffman, known for developing Huffman coding in information theory and data compression.
-
C.
LZIB
LZIB is the ICAO airport code for M. R. Štefánik Airport, the main international airport serving Bratislava, Slovakia.
-
D.
LZH
LZH is the IATA airport code for Liuzhou Bailian Airport, a commercial airport serving Liuzhou in Guangxi, China.
-
E.
Boyer–Moore string-search algorithm
The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
- 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_69d6ada5cdd48190860d9ce30aff69be |
completed | April 8, 2026, 7:33 p.m. |
| NER | Named-entity recognition | batch_69d9541f80148190976d1d912fe155d0 |
completed | April 10, 2026, 7:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f64bbd58b88190baeb99380babf64f |
completed | May 2, 2026, 7:08 p.m. |
| NEDg | Description generation | batch_69f64ce257348190b01179773992d414 |
completed | May 2, 2026, 7:13 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69f64da735f48190b051ce173c13e5b2 |
completed | May 2, 2026, 7:16 p.m. |
Created at: April 8, 2026, 9:57 p.m.