Triple
T17520695
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Support Vector Machine |
E426671
|
entity |
| Predicate | implementedIn |
P2539
|
FINISHED |
| Object | LIBLINEAR |
—
|
NE NERFINISHED |
How this triple was built (3 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: LIBLINEAR | Statement: [Support Vector Machine, implementedIn, LIBLINEAR]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: LIBLINEAR Context triple: [Support Vector Machine, implementedIn, LIBLINEAR]
-
A.
libsvm
libsvm is a widely used open-source library that implements Support Vector Machines for classification, regression, and related machine learning tasks.
-
B.
LinearClassifier
LinearClassifier is a TensorFlow Estimator that implements a linear model for classification tasks, typically using features combined with linear weights to predict discrete labels.
-
C.
LogisticRegression
LogisticRegression is a scikit-learn machine learning estimator that models the probability of class membership using a linear decision boundary with logistic (sigmoid) or related link functions.
-
D.
Svm
Svm is the station code used to identify Svanemøllen railway station in Copenhagen’s public transport system.
-
E.
scikit-learn
scikit-learn is a widely used open-source Python library that provides efficient tools for data mining, data analysis, and implementing a broad range of machine learning algorithms.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: LIBLINEAR Target entity description: LIBLINEAR is an open-source machine learning library specialized for large-scale linear classification and regression, particularly efficient for linear SVMs and logistic regression.
-
A.
libsvm
libsvm is a widely used open-source library that implements Support Vector Machines for classification, regression, and related machine learning tasks.
-
B.
LinearClassifier
LinearClassifier is a TensorFlow Estimator that implements a linear model for classification tasks, typically using features combined with linear weights to predict discrete labels.
-
C.
LogisticRegression
LogisticRegression is a scikit-learn machine learning estimator that models the probability of class membership using a linear decision boundary with logistic (sigmoid) or related link functions.
-
D.
Svm
Svm is the station code used to identify Svanemøllen railway station in Copenhagen’s public transport system.
-
E.
scikit-learn
scikit-learn is a widely used open-source Python library that provides efficient tools for data mining, data analysis, and implementing a broad range of machine learning algorithms.
- F. None of above. chosen
Provenance (2 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_69d889de677081909b22d2657b1f0292 |
completed | April 10, 2026, 5:25 a.m. |
| NER | Named-entity recognition | batch_69e452d23cf08190925510344fa36f57 |
completed | April 19, 2026, 3:58 a.m. |
Created at: April 10, 2026, 5:49 a.m.