Interface: LearnedSimilarityDto
@kortexya/reasoninglayer / LearnedSimilarityDto
Interface: LearnedSimilarityDto
Section titled “Interface: LearnedSimilarityDto”Defined in: src/types/sorts.ts:1181
A learned similarity between two sorts.
Properties
Section titled “Properties”createdAt
Section titled “createdAt”createdAt:
string
Defined in: src/types/sorts.ts:1193
When the similarity was created (ISO 8601).
crispMeet?
Section titled “crispMeet?”
optionalcrispMeet?:string|null
Defined in: src/types/sorts.ts:1215
The name of the GLB sort, when the pair already meets crisply.
Remarks
Section titled “Remarks”Approving is then redundant for routing: the common subsort meets at
degree 1 and erases the graded degree. null when the meet is bottom.
degree
Section titled “degree”degree:
number
Defined in: src/types/sorts.ts:1187
Similarity degree (0.0-1.0).
meetIsBottom
Section titled “meetIsBottom”meetIsBottom:
boolean
Defined in: src/types/sorts.ts:1207
Whether the two sorts have NO crisp meet other than bottom in the caller’s lattice.
Remarks
Section titled “Remarks”Reviewer-facing evidence. That is exactly where a declared similarity does work (it routes the pair through a third sort), and exactly where approving asserts a graded interchangeability that soft unification will act on. The engine never filters on it: the lattice cannot tell deliberately disjoint siblings from similarity-worthy ones.
provenance
Section titled “provenance”provenance:
LearnedSimilarityProvenanceDto
Defined in: src/types/sorts.ts:1191
Provenance information.
sort1Id
Section titled “sort1Id”sort1Id:
string
Defined in: src/types/sorts.ts:1183
First sort ID (UUID).
sort2Id
Section titled “sort2Id”sort2Id:
string
Defined in: src/types/sorts.ts:1185
Second sort ID (UUID).
status
Section titled “status”status:
LearnedSimilarityStatusDto
Defined in: src/types/sorts.ts:1189
Status of the similarity.
updatedAt
Section titled “updatedAt”updatedAt:
string
Defined in: src/types/sorts.ts:1195
When the similarity was last updated (ISO 8601).