@concordance-wiki/inference 0.1.0 → 0.3.0

package/README.md

@@ -1,8 +1,73 @@
-# @concordance-wiki/inference
+<p align="center">
+  <img src="https://raw.githubusercontent.com/concordance-wiki/concordance/main/brand/concordance-mark.svg" width="72" alt="Concordance">
+</p>
 
-Link production, confidence combination, relation typing, bounded neighbourhood, term candidates.
+<h1 align="center">@concordance-wiki/inference</h1>
 
-Today: explicit links (`explicitLinks`): every markdown link written in a note that resolves to another note gives a link at the `explicit_link` confidence of the profile, with the file, the line, the link text and the anchor as provenance; a link to a non-markdown file gives a `documents` link from the resource to the note; a missing target is `E-LINK-BROKEN`; a target in another source, written `<source>:<path>` or as a relative path climbing into a sibling source, resolves when `inference.cross_source_links` allows it and is `W-LINK-CROSS-SOURCE` otherwise. Links from one note to the same target are merged with every provenance kept; a link between two notes is `related` until the relation typing step names it. Bounded neighbourhood (`accumulateCooccurrences`, `neighbourhoodOptions`): two entities named in the same paragraph are neighbours, counted per paragraph; every node keeps its K best neighbours by count then by identifier (`inference.neighbours.k`, 50 by default), its row trimmed whenever it grows past 2K so that the full matrix is never held, and a paragraph naming more than 200 entities pairs only the first 200. `cooccurrenceLinks` turns every pair into one `related` link at the `cooccurrence` confidence with the number of shared paragraphs as provenance; `neighbourhoodToModel` writes the `neighbours` block of `model.json`. Confidence combination (`combineLinks`, `combineOptions`): one link per source, target, relation and attributes, at `1 − Π(1 − cᵢ)` over its methods (`combineConfidences`, clamped to [0, 1] and rounded to four decimals), the glossary occurrences of a group counting as one method at the base of the first plus `per_occurrence` per additional occurrence up to `cap` (`glossaryConfidence`); every provenance is kept in canonical order, an exact duplicate once, and the function is pure and idempotent. Displayed neighbourhood (`displayedNeighbourhood`, `displayOptions`): the one-hop neighbours of every entity through the links of the model in either direction, typed entities and noteless keyword pages alike, each flagged by its `kind`, carrying the largest confidence and the relation of the most confident link between the two nodes, its `direction` seen from the entity and its `rank`, the position of its type in the `display.neighbours_order` the profile declares for the entity's type (types not listed, keyword pages included, share the rank after the last one); sorted by rank, then by decreasing confidence, then by identifier, and truncated after that to `site.neighbourhood.size` (6 by default, never more than `MAX_DISPLAYED_NEIGHBOURS`, 12), so that the nodes shown are the best of the priority order; a type without a declaration sorts by confidence alone; an entity without any neighbour has an empty list. `displayedNeighbourhoodToModel` writes the `displayed_neighbourhood` block of `model.json`, precomputed at build so that the browser never computes it. Confidence combination (`combineLinks`, `combineOptions`): one link per source, target, relation and attributes, at `1 − Π(1 − cᵢ)` over its methods (`combineConfidences`, clamped to [0, 1] and rounded to four decimals), the glossary occurrences of a group counting as one method at the base of the strongest plus `per_occurrence` per additional occurrence up to `cap` (`glossaryConfidence`); every provenance is kept in canonical order, an exact duplicate once, and the function is pure and idempotent. Displayed neighbourhood (`displayedNeighbourhood`, `displayOptions`): the one-hop neighbours of every entity through the links of the model in either direction, typed entities and noteless keyword pages alike, each flagged by its `kind`, carrying the largest confidence and the relation of the most confident link between the two nodes and its `direction` seen from the entity; sorted by decreasing confidence then by identifier and truncated to `site.neighbourhood.size` (6 by default, never more than `MAX_DISPLAYED_NEIGHBOURS`, 12); an entity without any neighbour has an empty list. `displayedNeighbourhoodToModel` writes the `displayed_neighbourhood` block of `model.json`, precomputed at build so that the browser never computes it.
+<p align="center"><strong>Decides which pages are linked, how surely, and on what evidence.</strong></p>
+
+<p align="center">
+  <a href="https://www.npmjs.com/package/@concordance-wiki/inference"><img alt="npm" src="https://img.shields.io/npm/v/@concordance-wiki/inference?style=flat-square"></a>
+  <a href="https://github.com/concordance-wiki/concordance/blob/main/LICENSE"><img alt="Licence" src="https://img.shields.io/badge/licence-GPL--3.0--or--later-16181B?style=flat-square"></a>
+  <a href="https://github.com/concordance-wiki/concordance/actions/workflows/ci.yml"><img alt="CI" src="https://img.shields.io/github/actions/workflow/status/concordance-wiki/concordance/ci.yml?branch=main&label=ci&style=flat-square"></a>
+</p>
+
+<p align="center">
+  <a href="https://github.com/concordance-wiki/concordance/blob/main/docs/guides/getting-started.md">Getting started</a> ·
+  <a href="https://github.com/concordance-wiki/concordance/blob/main/docs/guides/configuration.md">Configuration</a> ·
+  <a href="https://github.com/concordance-wiki/concordance/blob/main/docs/guides/architecture.md">Architecture</a> ·
+  <a href="https://github.com/concordance-wiki/concordance/blob/main/packages/inference/CHANGELOG.md">Changelog</a>
+</p>
+
+---
+
+## Why
+
+Concordance shows, on every page, the pages related to it, and every link says where it comes from: written links always beat inferred ones. You install [`@concordance-wiki/concordance`](https://www.npmjs.com/package/@concordance-wiki/concordance) for that. This package is the part of it that produces the links: from the links people wrote, the references in the frontmatter, the mentions of a title in a section or a paragraph and the terms that keep appearing together; it combines their confidences, names the relation from the meta-model, keeps the neighbourhood a page shows, and recognises the documents that are twins of a note. Install it alone to build on the engine.
+
+## Quick start
+
+```bash
+npm install @concordance-wiki/inference
+```
+
+Two producers saw the same link; the build keeps one, at the combined confidence, with both provenances:
+
+```ts
+import { combineConfidences, combineLinks, combineOptions } from "@concordance-wiki/inference";
+import { loadDefaultProfile } from "@concordance-wiki/profile";
+
+combineConfidences([0.6, 0.5]); // 0.8, that is 1 − (1 − 0.6) × (1 − 0.5)
+const links = [
+  { from: "specs/link-broken", to: "glossary/finding", relation: "related", confidence: 0.6, provenance: [{ method: "section_mention", confidence: 0.6, path: "checks/link-broken.md", line: 12 }] },
+  { from: "specs/link-broken", to: "glossary/finding", relation: "related", confidence: 0.5, provenance: [{ method: "explicit_link", confidence: 0.5, path: "checks/link-broken.md", line: 3 }] },
+];
+combineLinks(links, combineOptions(loadDefaultProfile())); // one link at 0.8, its two provenances in canonical order
+```
+
+## What you get
+
+- **Four producers**: `explicitLinks`, `frontmatterLinks`, `mentionLinks`, `cooccurrenceLinks`, from the written links, the reference attributes of the frontmatter, the occurrences of a title or alias, and the entities named in the same paragraph.
+- **One link, every proof**: `combineLinks` keeps one link per source, target and relation, at `1 − Π(1 − cᵢ)`, with every provenance so the page can show why.
+- **A relation with a name**: `typeRelations` and `relationLabel` read it from the meta-model (mapped section, typed attribute, single relation of a type pair, else `related`), with `E-META-REL` and `I-REL-AMBIGUOUS` when the notes disagree with it.
+- **The neighbourhood, precomputed**: the bounded neighbours of every node and the ones a page displays, decided at build so the site needs no server.
+- **Twin resources**: `resolveDuplicateResources` scores a document and a note that describe the same thing, MinHash and LSH on the text, and applies the decisions of the lock file.
+- **Contracts matched to notes**: `attachOperations` joins every hand-written `endpoint` note to the operation imported from the contract of its API.
+- **References resolved**: `indexEntities` and `resolveReference` read a frontmatter value by identifier, path or exact title.
+
+## Documentation
+
+- [Writing notes](https://github.com/concordance-wiki/concordance/blob/main/docs/guides/writing-notes.md)
+- [Configuration reference](https://github.com/concordance-wiki/concordance/blob/main/docs/guides/configuration.md), the `inference` block
+- [Architecture](https://github.com/concordance-wiki/concordance/blob/main/docs/guides/architecture.md)
+- [Home page](https://concordance-wiki.github.io/concordance/), the [demo wiki](https://concordance-wiki.github.io/demo-wiki/) and the [changelog](https://github.com/concordance-wiki/concordance/blob/main/packages/inference/CHANGELOG.md)
+
+Part of [Concordance](https://github.com/concordance-wiki/concordance), GNU GPL v3 or later.
+
+<details>
+<summary>Inside the package</summary>
+
+Explicit links (`explicitLinks`): every markdown link written in a note that resolves to another note gives a link at the `explicit_link` confidence of the profile, with the file, the line, the link text and the anchor as provenance; a link to a non-markdown file gives a `documents` link from the resource to the note; a missing target is `E-LINK-BROKEN`; a target in another source, written `<source>:<path>` or as a relative path climbing into a sibling source, resolves when `inference.cross_source_links` allows it and is `W-LINK-CROSS-SOURCE` otherwise. Links from one note to the same target are merged with every provenance kept; a link between two notes is `related` until the relation typing step names it. Bounded neighbourhood (`accumulateCooccurrences`, `neighbourhoodOptions`): two entities named in the same paragraph are neighbours, counted per paragraph; every node keeps its K best neighbours by count then by identifier (`inference.neighbours.k`, 50 by default), its row trimmed whenever it grows past 2K so that the full matrix is never held, and a paragraph naming more than 200 entities pairs only the first 200. `cooccurrenceLinks` turns every pair into one `related` link at the `cooccurrence` confidence with the number of shared paragraphs as provenance; `neighbourhoodToModel` writes the `neighbours` block of `model.json`. Confidence combination (`combineLinks`, `combineOptions`): one link per source, target, relation and attributes, at `1 − Π(1 − cᵢ)` over its methods (`combineConfidences`, clamped to [0, 1] and rounded to four decimals), the glossary occurrences of a group counting as one method at the base of the strongest plus `per_occurrence` per additional occurrence up to `cap` (`glossaryConfidence`); every provenance is kept in canonical order, an exact duplicate once, and the function is pure and idempotent. Displayed neighbourhood (`displayedNeighbourhood`, `displayOptions`): the one-hop neighbours of every entity through the links of the model in either direction, typed entities and noteless keyword pages alike, each flagged by its `kind`, carrying the largest confidence and the relation of the most confident link between the two nodes, its `direction` seen from the entity and its `rank`, the position of its type in the `display.neighbours_order` the profile declares for the entity's type (types not listed, keyword pages included, share the rank after the last one); sorted by rank, then by decreasing confidence, then by identifier, and truncated after that to `site.neighbourhood.size` (6 by default, never more than `MAX_DISPLAYED_NEIGHBOURS`, 12), so that the nodes shown are the best of the priority order; a type without a declaration sorts by confidence alone; an entity without any neighbour has an empty list. `displayedNeighbourhoodToModel` writes the `displayed_neighbourhood` block of `model.json`, precomputed at build so that the browser never computes it.
 
 Frontmatter references (`frontmatterLinks`): every reference-typed attribute of the profile that carries a relation (`reads`, `writes`, `rules`, `roles`, `consumers`, `affects`, `broader`, `business_object`, ...) turns each of its values into a link of that relation at the `frontmatter_ref` confidence, with the attributes the profile declares (`accesses` in `read` mode for `reads`), reversed when the attribute is `inverse`, and the file, line 1 and the attribute name as provenance. A value is resolved by identifier (full, or relative to the source of the note), then by source-relative path, then by exact title (`resolveReference` over an `indexEntities` index); a value that matches nothing, a title shared by several notes or a value that is not a string is `W-REF-UNRESOLVED` and gives no link; a note of a type the attribute does not accept gives its link, which the relation typing step drops with `E-META-REL` when the matrix forbids the relation. Several values naming the same target are merged with every provenance kept.
 
@@ -12,4 +77,4 @@ Mentions (`mentionLinks`): every occurrence of a note's title or alias read in a
 
 Operation notes (`attachOperations`): every hand-written `endpoint` note is matched to an operation imported from the contract of its API, on the `operation_id` of its frontmatter, then on its `method` and `path` (or `port` and title for a SOAP operation), then on its title in comparison form with spaces and punctuation removed, against the operation title or identifier; the note names its API through the reference attribute of the profile (`api`), through a link already recorded with the API note, or is a candidate for every API of its source that has imported operations. A note stops at the first rung that matches, and an operation matched at a stronger rung is no longer offered to the weaker ones. A matched pair merges into the note, which keeps its identifier, markdown and frontmatter, takes the contract attributes it does not set, the operation's aliases and summary when it has none, lists the contract as a representation `{ kind: "contract", path, operation }` next to its own file (after any twin resources already merged) and names the rung in `grouped_by`; the imported operation disappears and every link that named it, the `exposes` link of the API first of all, now names the note. A note matching several operations, or an operation claimed by several notes, yields `W-OPERATION-AMBIGUOUS` naming every candidate and attaches nothing; a note that names an API with an imported contract and matches none of its operations yields `W-OPERATION-UNMATCHED`, saying that the operation left the contract or that the note is ahead of it, while a note that names no API is left alone. The step is pure and deterministic and returns sorted entities, links and findings; in the pipeline it runs after the sources step, which imports the contracts, and before the mention scan, so that the merged note is the one the dictionary and the sections link.
 
-Part of [Concordance](../../README.md).
+</details>

package/dist/domains/attach.d.ts

@@ -0,0 +1,8 @@
+import type { EmergentDomains, EmergentDomainsInput, EmergentDomainsOptions } from "./types.js";
+/**
+ * The pivots of the graph and the attachable notes within `radius` of one, each attached to
+ * its closest pivot; at equal distance the pivot of highest degree wins, then the first in
+ * code-unit order. The same graph gives the same result whatever the order of its nodes and edges.
+ */
+export declare function proposeEmergentDomains(input: EmergentDomainsInput, options: EmergentDomainsOptions): EmergentDomains;
+//# sourceMappingURL=attach.d.ts.map

package/dist/domains/attach.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"attach.d.ts","sourceRoot":"","sources":["../../src/domains/attach.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAEV,eAAe,EACf,oBAAoB,EACpB,sBAAsB,EACvB,MAAM,YAAY,CAAC;AAEpB;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,oBAAoB,EAC3B,OAAO,EAAE,sBAAsB,GAC9B,eAAe,CAsBjB"}

package/dist/domains/attach.js

@@ -0,0 +1,32 @@
+import { byCodeUnit } from "../neighbourhood/order.js";
+import { buildGraph, distancesFrom } from "./graph.js";
+import { selectPivots } from "./pivots.js";
+/**
+ * The pivots of the graph and the attachable notes within `radius` of one, each attached to
+ * its closest pivot; at equal distance the pivot of highest degree wins, then the first in
+ * code-unit order. The same graph gives the same result whatever the order of its nodes and edges.
+ */
+export function proposeEmergentDomains(input, options) {
+    const graph = buildGraph(input.nodes, input.edges);
+    const candidates = new Set(input.nodes.filter((node) => node.candidate).map((node) => node.id));
+    const pivots = selectPivots(candidates, graph, options.minNeighbours, options.maxNeighbours);
+    const closest = new Map();
+    // Pivots are visited best first, so a later pivot only wins a note at a strictly shorter distance.
+    for (const pivot of pivots) {
+        for (const [id, distance] of distancesFrom(graph, pivot.id, options.radius)) {
+            const current = closest.get(id);
+            if (current === undefined || distance < current.distance) {
+                closest.set(id, { id, pivot: pivot.id, distance });
+            }
+        }
+    }
+    const attachments = input.nodes
+        .filter((node) => node.attachable)
+        .flatMap((node) => {
+        const attachment = closest.get(node.id);
+        return attachment === undefined ? [] : [attachment];
+    })
+        .sort((a, b) => byCodeUnit(a.id, b.id));
+    return { pivots, attachments };
+}
+//# sourceMappingURL=attach.js.map

package/dist/domains/attach.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"attach.js","sourceRoot":"","sources":["../../src/domains/attach.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAQ3C;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAA2B,EAC3B,OAA+B;IAE/B,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAChG,MAAM,MAAM,GAAG,YAAY,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;IAC7F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC9C,mGAAmG;IACnG,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5E,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACzD,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK;SAC5B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC;SACjC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAChB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,OAAO,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACtD,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACjC,CAAC"}

package/dist/domains/graph.d.ts

@@ -0,0 +1,7 @@
+import type { DomainEdge, DomainNode } from "./types.js";
+/** Every node with its distinct neighbours in identifier order; an edge naming an unknown node or joining a node to itself is dropped. */
+export type DomainGraph = ReadonlyMap<string, readonly string[]>;
+export declare function buildGraph(nodes: readonly DomainNode[], edges: readonly DomainEdge[]): DomainGraph;
+/** The distance from `start` to every node within `radius`, the start at zero. */
+export declare function distancesFrom(graph: DomainGraph, start: string, radius: number): Map<string, number>;
+//# sourceMappingURL=graph.d.ts.map

package/dist/domains/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/domains/graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAEzD,0IAA0I;AAC1I,MAAM,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;AAEjE,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,KAAK,EAAE,SAAS,UAAU,EAAE,GAC3B,WAAW,CAab;AAED,kFAAkF;AAClF,wBAAgB,aAAa,CAC3B,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,GACb,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAerB"}

package/dist/domains/graph.js

@@ -0,0 +1,37 @@
+import { byCodeUnit } from "../neighbourhood/order.js";
+export function buildGraph(nodes, edges) {
+    const adjacency = new Map();
+    for (const node of nodes)
+        adjacency.set(node.id, new Set());
+    for (const { a, b } of edges) {
+        const ofA = adjacency.get(a);
+        const ofB = adjacency.get(b);
+        if (ofA === undefined || ofB === undefined || a === b)
+            continue;
+        ofA.add(b);
+        ofB.add(a);
+    }
+    const graph = new Map();
+    for (const [id, neighbours] of adjacency)
+        graph.set(id, [...neighbours].sort(byCodeUnit));
+    return graph;
+}
+/** The distance from `start` to every node within `radius`, the start at zero. */
+export function distancesFrom(graph, start, radius) {
+    const distances = new Map([[start, 0]]);
+    let frontier = [start];
+    for (let distance = 1; distance <= radius; distance += 1) {
+        const next = [];
+        for (const id of frontier) {
+            for (const neighbour of graph.get(id) ?? []) {
+                if (distances.has(neighbour))
+                    continue;
+                distances.set(neighbour, distance);
+                next.push(neighbour);
+            }
+        }
+        frontier = next;
+    }
+    return distances;
+}
+//# sourceMappingURL=graph.js.map

package/dist/domains/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/domains/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAMvD,MAAM,UAAU,UAAU,CACxB,KAA4B,EAC5B,KAA4B;IAE5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC5D,KAAK,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAChE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACb,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;IACnD,KAAK,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,IAAI,SAAS;QAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1F,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,aAAa,CAC3B,KAAkB,EAClB,KAAa,EACb,MAAc;IAEd,MAAM,SAAS,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC;IACvB,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAS;gBACvC,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/domains/options.d.ts

@@ -0,0 +1,5 @@
+import type { InferenceConfig } from "@concordance-wiki/core";
+import type { EmergentDomainsOptions } from "./types.js";
+/** `inference.domains` of the configuration; undefined while the key is absent, and the step does not run. */
+export declare function emergentDomainsOptions(inference?: InferenceConfig): EmergentDomainsOptions | undefined;
+//# sourceMappingURL=options.d.ts.map

package/dist/domains/options.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"options.d.ts","sourceRoot":"","sources":["../../src/domains/options.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAE9D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAEzD,8GAA8G;AAC9G,wBAAgB,sBAAsB,CACpC,SAAS,CAAC,EAAE,eAAe,GAC1B,sBAAsB,GAAG,SAAS,CASpC"}

package/dist/domains/options.js

@@ -0,0 +1,13 @@
+/** `inference.domains` of the configuration; undefined while the key is absent, and the step does not run. */
+export function emergentDomainsOptions(inference) {
+    const domains = inference?.domains;
+    if (domains === undefined)
+        return undefined;
+    return {
+        minNeighbours: domains.min_neighbours,
+        ...(domains.max_neighbours === undefined ? {} : { maxNeighbours: domains.max_neighbours }),
+        radius: domains.radius,
+        assign: domains.assign ?? false,
+    };
+}
+//# sourceMappingURL=options.js.map

package/dist/domains/options.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"options.js","sourceRoot":"","sources":["../../src/domains/options.ts"],"names":[],"mappings":"AAIA,8GAA8G;AAC9G,MAAM,UAAU,sBAAsB,CACpC,SAA2B;IAE3B,MAAM,OAAO,GAAG,SAAS,EAAE,OAAO,CAAC;IACnC,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC5C,OAAO;QACL,aAAa,EAAE,OAAO,CAAC,cAAc;QACrC,GAAG,CAAC,OAAO,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1F,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK;KAChC,CAAC;AACJ,CAAC"}

package/dist/domains/pivots.d.ts

@@ -0,0 +1,7 @@
+import type { DomainGraph } from "./graph.js";
+import type { Pivot } from "./types.js";
+/** Largest degree first, then the lower identifier. */
+export declare function comparePivots(a: Pivot, b: Pivot): number;
+/** The candidates whose degree reaches `minNeighbours` without exceeding `maxNeighbours`, best first: a hub the whole corpus cites names no domain. */
+export declare function selectPivots(candidates: ReadonlySet<string>, graph: DomainGraph, minNeighbours: number, maxNeighbours?: number): Pivot[];
+//# sourceMappingURL=pivots.d.ts.map

package/dist/domains/pivots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pivots.d.ts","sourceRoot":"","sources":["../../src/domains/pivots.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,uDAAuD;AACvD,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAExD;AAED,uJAAuJ;AACvJ,wBAAgB,YAAY,CAC1B,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,EAC/B,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,MAAM,EACrB,aAAa,SAA2B,GACvC,KAAK,EAAE,CAYT"}

package/dist/domains/pivots.js

@@ -0,0 +1,18 @@
+import { byCodeUnit } from "../neighbourhood/order.js";
+/** Largest degree first, then the lower identifier. */
+export function comparePivots(a, b) {
+    return b.degree - a.degree || byCodeUnit(a.id, b.id);
+}
+/** The candidates whose degree reaches `minNeighbours` without exceeding `maxNeighbours`, best first: a hub the whole corpus cites names no domain. */
+export function selectPivots(candidates, graph, minNeighbours, maxNeighbours = Number.POSITIVE_INFINITY) {
+    const pivots = [];
+    for (const [id, neighbours] of graph) {
+        if (candidates.has(id) &&
+            neighbours.length >= minNeighbours &&
+            neighbours.length <= maxNeighbours) {
+            pivots.push({ id, degree: neighbours.length });
+        }
+    }
+    return pivots.sort(comparePivots);
+}
+//# sourceMappingURL=pivots.js.map

package/dist/domains/pivots.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pivots.js","sourceRoot":"","sources":["../../src/domains/pivots.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAIvD,uDAAuD;AACvD,MAAM,UAAU,aAAa,CAAC,CAAQ,EAAE,CAAQ;IAC9C,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AACvD,CAAC;AAED,uJAAuJ;AACvJ,MAAM,UAAU,YAAY,CAC1B,UAA+B,EAC/B,KAAkB,EAClB,aAAqB,EACrB,aAAa,GAAG,MAAM,CAAC,iBAAiB;IAExC,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC;QACrC,IACE,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,UAAU,CAAC,MAAM,IAAI,aAAa;YAClC,UAAU,CAAC,MAAM,IAAI,aAAa,EAClC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;AACpC,CAAC"}

package/dist/domains/types.d.ts

@@ -0,0 +1,45 @@
+/** One entity as the proposal reads it: whether it may become a pivot and whether it may be filed. */
+export interface DomainNode {
+    id: string;
+    /** True for a term with a note of its own that is neither a stopword nor a rejected term. */
+    candidate: boolean;
+    /** True for a note no declaration files, the only ones a proposal attaches. */
+    attachable: boolean;
+}
+/** An undirected edge of the neighbourhood graph: a typed link or a co-occurrence. */
+export interface DomainEdge {
+    a: string;
+    b: string;
+}
+export interface EmergentDomainsInput {
+    nodes: readonly DomainNode[];
+    edges: readonly DomainEdge[];
+}
+export interface EmergentDomainsOptions {
+    /** Degree from which a candidate becomes a pivot. */
+    minNeighbours: number;
+    /** Degree above which a term is a hub, never a pivot; undefined for no bound. */
+    maxNeighbours?: number;
+    /** Distance, in edges, within which a note belongs to a pivot. */
+    radius: number;
+    /** Whether the pipeline files the attached notes; the walk itself never reads it. */
+    assign: boolean;
+}
+export interface Pivot {
+    id: string;
+    /** Distinct neighbours in the graph. */
+    degree: number;
+}
+/** A note attached to its closest pivot. */
+export interface Attachment {
+    id: string;
+    pivot: string;
+    distance: number;
+}
+export interface EmergentDomains {
+    /** By degree, largest first, then by identifier. */
+    pivots: Pivot[];
+    /** By note identifier. */
+    attachments: Attachment[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/domains/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/domains/types.ts"],"names":[],"mappings":"AAAA,sGAAsG;AACtG,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,6FAA6F;IAC7F,SAAS,EAAE,OAAO,CAAC;IACnB,+EAA+E;IAC/E,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,sFAAsF;AACtF,MAAM,WAAW,UAAU;IACzB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;IAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,sBAAsB;IACrC,qDAAqD;IACrD,aAAa,EAAE,MAAM,CAAC;IACtB,iFAAiF;IACjF,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,kEAAkE;IAClE,MAAM,EAAE,MAAM,CAAC;IACf,qFAAqF;IACrF,MAAM,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,WAAW,KAAK;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,wCAAwC;IACxC,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,4CAA4C;AAC5C,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,eAAe;IAC9B,oDAAoD;IACpD,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,0BAA0B;IAC1B,WAAW,EAAE,UAAU,EAAE,CAAC;CAC3B"}

package/dist/domains/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/domains/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/domains/types.ts"],"names":[],"mappings":""}

package/dist/index.d.ts

@@ -23,4 +23,9 @@ export { mentionLinks, type MentionLinksInput, type MentionLinksResult, type Men
 export { foldHeading, mappedSection, type MappedSection } from "./mentions/sections.js";
 export { FALLBACK_RELATION, RELATION_ORIGIN, relationLabel, typeRelations, type RelationLabelOptions, type TypedEntity, type TypeRelationsInput, type TypeRelationsResult, } from "./relations/index.js";
 export { attachOperations, CONTRACT_REPRESENTATION, importedOperations, MATCH_RUNGS, matchOperations, mergeOperation, OPERATION_AMBIGUOUS, OPERATION_UNMATCHED, operationNotes, redirectLinks, type Ambiguity, type AttachOperationsInput, type AttachOperationsResult, type ImportedOperation, type MatchResult, type MatchRung, type OperationMatch, type OperationNote, } from "./operations/index.js";
+export { proposeEmergentDomains } from "./domains/attach.js";
+export { buildGraph, distancesFrom, type DomainGraph } from "./domains/graph.js";
+export { emergentDomainsOptions } from "./domains/options.js";
+export { comparePivots, selectPivots } from "./domains/pivots.js";
+export type { Attachment, DomainEdge, DomainNode, EmergentDomains, EmergentDomainsInput, EmergentDomainsOptions, Pivot, } from "./domains/types.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AACjF,YAAY,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AACnE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAClE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,6BAA6B,EAAE,MAAM,wBAAwB,CAAC;AACvE,YAAY,EACV,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,sBAAsB,EACtB,2BAA2B,EAC3B,kBAAkB,EAClB,aAAa,GACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,yBAAyB,GAC1B,MAAM,yBAAyB,CAAC;AACjC,YAAY,EACV,cAAc,EACd,cAAc,EACd,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,aAAa,EACb,uBAAuB,EACvB,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,cAAc,GACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACpE,YAAY,EACV,kBAAkB,EAClB,mBAAmB,EACnB,cAAc,EACd,cAAc,GACf,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AACpE,YAAY,EACV,SAAS,EACT,aAAa,EACb,oBAAoB,EACpB,cAAc,GACf,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,gBAAgB,EAChB,KAAK,qBAAqB,EAC1B,KAAK,sBAAsB,GAC5B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,KAAK,WAAW,EAChB,KAAK,mBAAmB,EACxB,KAAK,cAAc,GACpB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,YAAY,EACZ,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,GACvB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,KAAK,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACxF,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,aAAa,EACb,KAAK,oBAAoB,EACzB,KAAK,WAAW,EAChB,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,GACzB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,cAAc,EACd,mBAAmB,EACnB,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,KAAK,SAAS,EACd,KAAK,qBAAqB,EAC1B,KAAK,sBAAsB,EAC3B,KAAK,iBAAiB,EACtB,KAAK,WAAW,EAChB,KAAK,SAAS,EACd,KAAK,cAAc,EACnB,KAAK,aAAa,GACnB,MAAM,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AACjF,YAAY,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AACnE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAClE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,6BAA6B,EAAE,MAAM,wBAAwB,CAAC;AACvE,YAAY,EACV,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,sBAAsB,EACtB,2BAA2B,EAC3B,kBAAkB,EAClB,aAAa,GACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,yBAAyB,GAC1B,MAAM,yBAAyB,CAAC;AACjC,YAAY,EACV,cAAc,EACd,cAAc,EACd,aAAa,EACb,aAAa,EACb,gBAAgB,EAChB,aAAa,EACb,uBAAuB,EACvB,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,cAAc,GACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACpE,YAAY,EACV,kBAAkB,EAClB,mBAAmB,EACnB,cAAc,EACd,cAAc,GACf,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AACpE,YAAY,EACV,SAAS,EACT,aAAa,EACb,oBAAoB,EACpB,cAAc,GACf,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,gBAAgB,EAChB,KAAK,qBAAqB,EAC1B,KAAK,sBAAsB,GAC5B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,aAAa,EACb,gBAAgB,EAChB,KAAK,WAAW,EAChB,KAAK,mBAAmB,EACxB,KAAK,cAAc,GACpB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,YAAY,EACZ,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,GACvB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,KAAK,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACxF,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,aAAa,EACb,KAAK,oBAAoB,EACzB,KAAK,WAAW,EAChB,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,GACzB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,cAAc,EACd,mBAAmB,EACnB,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,KAAK,SAAS,EACd,KAAK,qBAAqB,EAC1B,KAAK,sBAAsB,EAC3B,KAAK,iBAAiB,EACtB,KAAK,WAAW,EAChB,KAAK,SAAS,EACd,KAAK,cAAc,EACnB,KAAK,aAAa,GACnB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjF,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAClE,YAAY,EACV,UAAU,EACV,UAAU,EACV,UAAU,EACV,eAAe,EACf,oBAAoB,EACpB,sBAAsB,EACtB,KAAK,GACN,MAAM,oBAAoB,CAAC"}

package/dist/index.js

@@ -16,4 +16,8 @@ export { mentionLinks, } from "./mentions/links.js";
 export { foldHeading, mappedSection } from "./mentions/sections.js";
 export { FALLBACK_RELATION, RELATION_ORIGIN, relationLabel, typeRelations, } from "./relations/index.js";
 export { attachOperations, CONTRACT_REPRESENTATION, importedOperations, MATCH_RUNGS, matchOperations, mergeOperation, OPERATION_AMBIGUOUS, OPERATION_UNMATCHED, operationNotes, redirectLinks, } from "./operations/index.js";
+export { proposeEmergentDomains } from "./domains/attach.js";
+export { buildGraph, distancesFrom } from "./domains/graph.js";
+export { emergentDomainsOptions } from "./domains/options.js";
+export { comparePivots, selectPivots } from "./domains/pivots.js";
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAEjF,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAElE,OAAO,EAAE,wBAAwB,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,6BAA6B,EAAE,MAAM,wBAAwB,CAAC;AAUvE,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,yBAAyB,GAC1B,MAAM,yBAAyB,CAAC;AAcjC,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAQhE,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAOpE,OAAO,EACL,gBAAgB,GAGjB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,aAAa,EACb,gBAAgB,GAIjB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,YAAY,GAIb,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,aAAa,EAAsB,MAAM,wBAAwB,CAAC;AACxF,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,aAAa,GAKd,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,cAAc,EACd,mBAAmB,EACnB,mBAAmB,EACnB,cAAc,EACd,aAAa,GASd,MAAM,uBAAuB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAEjF,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAElE,OAAO,EAAE,wBAAwB,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,6BAA6B,EAAE,MAAM,wBAAwB,CAAC;AAUvE,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC/E,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,yBAAyB,GAC1B,MAAM,yBAAyB,CAAC;AAcjC,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAQhE,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAOpE,OAAO,EACL,gBAAgB,GAGjB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,aAAa,EACb,gBAAgB,GAIjB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,YAAY,GAIb,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,aAAa,EAAsB,MAAM,wBAAwB,CAAC;AACxF,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,aAAa,EACb,aAAa,GAKd,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,cAAc,EACd,mBAAmB,EACnB,mBAAmB,EACnB,cAAc,EACd,aAAa,GASd,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,aAAa,EAAoB,MAAM,oBAAoB,CAAC;AACjF,OAAO,EAAE,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@concordance-wiki/inference",
-  "version": "0.1.0",
+  "version": "0.3.0",
   "description": "Link production, confidence combination, relation typing, bounded neighbourhood, term candidates.",
   "license": "GPL-3.0-or-later",
   "repository": {
@@ -29,18 +29,18 @@
     "README.md",
     "LICENSE"
   ],
-  "scripts": {
-    "typecheck": "tsc -b tsconfig.json"
-  },
   "dependencies": {
-    "@concordance-wiki/core": "workspace:*",
-    "@concordance-wiki/ingest": "workspace:*",
-    "@concordance-wiki/profile": "workspace:*"
+    "@concordance-wiki/core": "0.3.0",
+    "@concordance-wiki/ingest": "0.3.0",
+    "@concordance-wiki/profile": "0.3.0"
   },
   "devDependencies": {
-    "@concordance-wiki/nlp": "workspace:*",
-    "@concordance-wiki/plugin-contract-openapi": "workspace:*",
-    "@concordance-wiki/plugin-contract-wsdl": "workspace:*",
-    "@concordance-wiki/typing": "workspace:*"
+    "@concordance-wiki/nlp": "0.3.0",
+    "@concordance-wiki/plugin-contract-openapi": "0.3.0",
+    "@concordance-wiki/plugin-contract-wsdl": "0.3.0",
+    "@concordance-wiki/typing": "0.3.0"
+  },
+  "scripts": {
+    "typecheck": "tsc -b tsconfig.json"
   }
-}
+}