@kensio/pinyinjs 1.7.3 → 1.7.5

package/dist/decode/decode.js

@@ -1,10 +1,7 @@
-import { toCharacters } from "../script/characters.js";
 import { scoreReadings } from "./confidence.js";
-import { shiftHints } from "./hints.js";
-import { allEdges, buildLattice, cutPoints } from "./lattice.js";
+import { cutPoints } from "./lattice.js";
 import { isSettled, projectReadings, settledUnits, unitsOf, } from "./locking.js";
 import { READING_RULES } from "./reading-rules.js";
-import { applyEdgeRules } from "./rules.js";
 import { readingCost, shortestPath, spacingCost } from "./viterbi.js";
 /**
  * Decode the run's readings, scoring only where the readings are still open.
@@ -43,123 +40,7 @@ export function decodeReadings(lattice, projection) {
 export function decodeSpacing(lattice) {
     return shortestPath(lattice, 0, lattice.characters.length, spacingCost).map((edge) => edge.from);
 }
-/**
- * Gather the reading units into the words the boundaries make of them.
- *
- * Where the two decodes disagree the readings win, which is what "advisory"
- * means for the spacing decode: a boundary falling inside a reading unit is
- * dropped rather than allowed to break the unit up. 玩儿 read as `wánr` is one
- * syllable over two characters, and no spacing can be put between them.
- */
-function groupUnits(units, boundaries) {
-    const starts = new Set(units.map((unit) => unit.from));
-    const kept = new Set(boundaries.filter((at) => starts.has(at)));
-    const groups = [];
-    let held = [];
-    for (const unit of units) {
-        if (kept.has(unit.from) && held.length > 0) {
-            groups.push(held);
-            held = [];
-        }
-        held.push(unit);
-    }
-    if (held.length > 0) {
-        groups.push(held);
-    }
-    return groups;
-}
-/**
- * Assemble one word from the units the boundaries kept together.
- */
-function wordFrom(dictionary, lattice, group) {
-    const first = group[0];
-    const last = group.at(-1);
-    /* c8 ignore next 3 -- a group is only made by pushing a unit into it */
-    if (first === undefined || last === undefined) {
-        throw new Error("a word must cover at least one reading unit");
-    }
-    const text = lattice.characters.slice(first.from, last.to).join("");
-    const entry = dictionary.lookup(text);
-    return {
-        text,
-        reading: group.flatMap((unit) => [...unit.reading]),
-        isProperNoun: entry?.isProperNoun ?? false,
-        partOfSpeech: entry?.partOfSpeech ?? "",
-        isKnown: entry !== undefined,
-    };
-}
-/**
- * The lattice a run decodes over: stage 1 built, then stage 4 applied.
- *
- * The rules run between building and decoding rather than over the output,
- * which is the whole point of them — they change what the decode gets to choose
- * between, so everything downstream sees one lattice rather than a decode and
- * a list of corrections to it.
- */
-function ruledLattice(dictionary, run, rules, hints) {
-    return applyEdgeRules(buildLattice(dictionary, run, hints), dictionary, rules);
-}
-/**
- * Whether any reading in the lattice would hold the two sides of a join
- * together.
- *
- * A reading of one syllable per character can be cut anywhere; anything else —
- * 儿化, a character with no reading — is a single claim about its whole span,
- * so a claim spanning the join cannot be reported for the run alone. 1点儿事
- * is that case: 一点儿 is one `yìdiǎnr` over the 一 the context supplied and
- * the 点儿 the run did.
- */
-function isJoinedAt(lattice, at) {
-    return allEdges(lattice).some((edge) => edge.from < at &&
-        edge.to > at &&
-        edge.reading.length !== edge.to - edge.from);
-}
-/**
- * The lattice a run decodes over, with whatever context stands in front of it.
- *
- * The context is dropped where a reading would hold it to the run, leaving the
- * run decoded on its own, which is what it would have been before there was any
- * context to give.
- */
-function runLattice(dictionary, run, rules, before, hints) {
-    const alone = () => ({
-        lattice: ruledLattice(dictionary, run, rules, hints),
-        at: 0,
-    });
-    if (before === "") {
-        return alone();
-    }
-    const held = toCharacters(before).length;
-    // The context is decoded with the run, so every hint position moves along
-    // with it. Shifting a copy keeps the caller's positions relative to the run
-    // they were given for.
-    const lattice = ruledLattice(dictionary, before + run, rules, hints === undefined ? undefined : shiftHints(hints, held));
-    const at = held;
-    return isJoinedAt(lattice, at) ? alone() : { lattice, at };
-}
-/**
- * Cut a decode of the whole lattice down to the run at the end of it.
- *
- * Everything before `at` was context rather than run — 汉字 a caller put in
- * front so that the decode could see them — and is dropped once it has done its
- * work.
- */
-function runGroups({ lattice, at }, units) {
-    return groupUnits(units.filter((unit) => unit.from >= at), decodeSpacing(lattice).filter((from) => from >= at));
-}
-/**
- * Decode a Han run with the lattice: the recommended path.
- *
- * Stages 1 to 3 of ALGORITHM.md end to end — build every candidate reading,
- * lock the positions that cannot vary, score the rest — where the greedy
- * baseline commits to the longest match at each position and never revisits it.
- *
- * `before` is 汉字 standing in front of the run that the decode should see and
- * not report: the 汉字 a number written in digits would have been written with.
- * A run is decoded on its own without it, and a run reached that way has no idea
- * what preceded it — 个人 alone is the word `gèrén`, while the 两 of 2个人 makes
- * 两个 the word and leaves 人 to itself.
- */
+import { runGroups, runLattice, wordFrom } from "./run-lattice.js";
 export function decodeRun(dictionary, run, rules = READING_RULES, before = "", hints) {
     const held = runLattice(dictionary, run, rules, before, hints);
     const { lattice } = held;

package/dist/decode/decode.js.map

@@ -1 +1 @@
-{"version":3,"file":"decode.js","sourceRoot":"","sources":["../../src/decode/decode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAmB,MAAM,iBAAiB,CAAC;AACjE,OAAO,EAAsB,UAAU,EAAE,MAAM,YAAY,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAgB,MAAM,cAAc,CAAC;AAC/E,OAAO,EACL,SAAS,EACT,eAAe,EAGf,YAAY,EACZ,OAAO,GACR,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAiB,MAAM,YAAY,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAGtE;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAgB,EAChB,UAA6B;IAE7B,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,KAAK,GAAkB,EAAE,CAAC;IAEhC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM;QACR,CAAC;QACD,IAAI,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAClD,SAAS;QACX,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,OAAgB;IAC5C,OAAO,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,GAAG,CACzE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CACpB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CACjB,KAAsB,EACtB,UAA6B;IAE7B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,IAAI,GAAW,EAAE,CAAC;IAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,IAAI,GAAG,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,QAAQ,CACf,UAAsB,EACtB,OAAgB,EAChB,KAA6B;IAE7B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,wEAAwE;IACxE,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAEtC,OAAO;QACL,IAAI;QACJ,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QACnD,YAAY,EAAE,KAAK,EAAE,YAAY,IAAI,KAAK;QAC1C,YAAY,EAAE,KAAK,EAAE,YAAY,IAAI,EAAE;QACvC,OAAO,EAAE,KAAK,KAAK,SAAS;KAC7B,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CACnB,UAAsB,EACtB,GAAW,EACX,KAA0B,EAC1B,KAAgC;IAEhC,OAAO,cAAc,CACnB,YAAY,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,CAAC,EACpC,UAAU,EACV,KAAK,CACN,CAAC;AACJ,CAAC;AAUD;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,OAAgB,EAAE,EAAU;IAC9C,OAAO,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,CAC3B,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,IAAI,GAAG,EAAE;QACd,IAAI,CAAC,EAAE,GAAG,EAAE;QACZ,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAC9C,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CACjB,UAAsB,EACtB,GAAW,EACX,KAA0B,EAC1B,MAAc,EACd,KAAgC;IAEhC,MAAM,KAAK,GAAG,GAAe,EAAE,CAAC,CAAC;QAC/B,OAAO,EAAE,YAAY,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC;QACpD,EAAE,EAAE,CAAC;KACN,CAAC,CAAC;IACH,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;QAClB,OAAO,KAAK,EAAE,CAAC;IACjB,CAAC;IACD,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IACzC,0EAA0E;IAC1E,4EAA4E;IAC5E,uBAAuB;IACvB,MAAM,OAAO,GAAG,YAAY,CAC1B,UAAU,EACV,MAAM,GAAG,GAAG,EACZ,KAAK,EACL,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAC1D,CAAC;IACF,MAAM,EAAE,GAAG,IAAI,CAAC;IAChB,OAAO,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;AAC7D,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAChB,EAAE,OAAO,EAAE,EAAE,EAAc,EAC3B,KAAsB;IAEtB,OAAO,UAAU,CACf,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,EACvC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CACpD,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CACvB,UAAsB,EACtB,GAAW,EACX,KAAK,GAAwB,aAAa,EAC1C,MAAM,GAAG,EAAE,EACX,KAAqB;IAErB,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACzB,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IAChE,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAC1C,QAAQ,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC,CACrC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAsB,EACtB,GAAW,EACX,KAAK,GAAwB,aAAa,EAC1C,MAAM,GAAG,EAAE,EACX,KAAqB;IAErB,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACzB,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IAE/D,OAAO,SAAS,CAAa,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACxD,IAAI,EAAE,QAAQ,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC;QAC1C,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;YACtB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC,CAAC,CACJ;KACF,CAAC,CAAC,CAAC;AACN,CAAC"}
+{"version":3,"file":"decode.js","sourceRoot":"","sources":["../../src/decode/decode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAmB,MAAM,iBAAiB,CAAC;AAEjE,OAAO,EAAE,SAAS,EAAgB,MAAM,cAAc,CAAC;AACvD,OAAO,EACL,SAAS,EACT,eAAe,EAGf,YAAY,EACZ,OAAO,GACR,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAEnD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAGtE;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAgB,EAChB,UAA6B;IAE7B,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,KAAK,GAAkB,EAAE,CAAC;IAEhC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM;QACR,CAAC;QACD,IAAI,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAClD,SAAS;QACX,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,OAAgB;IAC5C,OAAO,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,GAAG,CACzE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CACpB,CAAC;AACJ,CAAC;AAED,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AACnE,MAAM,UAAU,SAAS,CACvB,UAAsB,EACtB,GAAW,EACX,KAAK,GAAwB,aAAa,EAC1C,MAAM,GAAG,EAAE,EACX,KAAqB;IAErB,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACzB,MAAM,KAAK,GAAG,cAAc,CAAC,OAAO,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IAChE,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAC1C,QAAQ,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC,CACrC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAsB,EACtB,GAAW,EACX,KAAK,GAAwB,aAAa,EAC1C,MAAM,GAAG,EAAE,EACX,KAAqB;IAErB,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACzB,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IAE/D,OAAO,SAAS,CAAa,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACxD,IAAI,EAAE,QAAQ,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC;QAC1C,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;YACtB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC,CAAC,CACJ;KACF,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/decode/decoders.d.ts

@@ -0,0 +1,32 @@
+/**
+ * The three decoders a conversion can be run with.
+ *
+ * Each takes a Han run and hands back words; only one of them has anything to
+ * say about how settled it was, so the other two are wrapped to report
+ * nothing rather than each caller having to allow for the difference.
+ */
+import type { Dictionary } from "../dictionary/dictionary.js";
+import type { ResolvedHints } from "./hints.js";
+import type { ScoredWord } from "./word.js";
+/**
+ * How a Han run is turned into words, with whatever the decoder can say about
+ * how settled they were.
+ */
+export type Decode = (dictionary: Dictionary, run: string, before: string, hints: ResolvedHints | undefined) => readonly ScoredWord[];
+/**
+ * The lattice decoder, reporting nothing about its own confidence.
+ */
+export declare const LATTICE: Decode;
+/**
+ * The lattice decoder, with what each reading was chosen over.
+ */
+export declare const SCORED: Decode;
+/**
+ * The greedy baseline, which has nothing to report either way.
+ *
+ * The context in front of a run goes unused: longest-match has no way to weigh
+ * one segmentation against another, which is the whole reason it is the
+ * baseline, and a 汉字 it cannot report would only be another thing to trim.
+ */
+export declare const GREEDY: Decode;
+//# sourceMappingURL=decoders.d.ts.map

package/dist/decode/decoders.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decoders.d.ts","sourceRoot":"","sources":["../../src/decode/decoders.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAG9D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,OAAO,KAAK,EAAe,UAAU,EAAE,MAAM,WAAW,CAAC;AAEzD;;;GAGG;AACH,MAAM,MAAM,MAAM,GAAG,CACnB,UAAU,EAAE,UAAU,EACtB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,aAAa,GAAG,SAAS,KAC7B,SAAS,UAAU,EAAE,CAAC;AAoB3B;;GAEG;AACH,eAAO,MAAM,OAAO,EAAE,MAErB,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,MAAM,EAAE,MAC2C,CAAC;AAEjE;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,EAAE,MAAiC,CAAC"}

package/dist/decode/decoders.js

@@ -0,0 +1,29 @@
+import { decodeRun, decodeRunScored } from "./decode.js";
+import { decodeGreedily } from "./greedy.js";
+import { READING_RULES } from "./reading-rules.js";
+/**
+ * A decoder that reports no confidence at all, which is every decoder but one.
+ */
+function unscored(decode) {
+    return (dictionary, run, before, hints) => decode(dictionary, run, before, hints).map((word) => ({
+        word,
+        confidence: [],
+    }));
+}
+/**
+ * The lattice decoder, reporting nothing about its own confidence.
+ */
+export const LATTICE = unscored((dictionary, run, before, hints) => decodeRun(dictionary, run, READING_RULES, before, hints));
+/**
+ * The lattice decoder, with what each reading was chosen over.
+ */
+export const SCORED = (dictionary, run, before, hints) => decodeRunScored(dictionary, run, READING_RULES, before, hints);
+/**
+ * The greedy baseline, which has nothing to report either way.
+ *
+ * The context in front of a run goes unused: longest-match has no way to weigh
+ * one segmentation against another, which is the whole reason it is the
+ * baseline, and a 汉字 it cannot report would only be another thing to trim.
+ */
+export const GREEDY = unscored(decodeGreedily);
+//# sourceMappingURL=decoders.js.map

package/dist/decode/decoders.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decoders.js","sourceRoot":"","sources":["../../src/decode/decoders.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAcnD;;GAEG;AACH,SAAS,QAAQ,CACf,MAK2B;IAE3B,OAAO,CAAC,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CACxC,MAAM,CAAC,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACpD,IAAI;QACJ,UAAU,EAAE,EAAE;KACf,CAAC,CAAC,CAAC;AACR,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,OAAO,GAAW,QAAQ,CAAC,CAAC,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CACzE,SAAS,CAAC,UAAU,EAAE,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,CAAC,CACzD,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAW,CAAC,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAC/D,eAAe,CAAC,UAAU,EAAE,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAEjE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,MAAM,GAAW,QAAQ,CAAC,cAAc,CAAC,CAAC"}

package/dist/decode/edge-context.d.ts

@@ -0,0 +1,38 @@
+/**
+ * What a rule can ask about the words around an edge.
+ *
+ * The lookups every edge rule shares: which word ends here, which starts here,
+ * and what part of speech the dictionary gives it.
+ */
+import type { EdgeContext } from "./rules.js";
+/**
+ * The word ending at a position, longest first, or undefined.
+ *
+ * What a rule needs when it asks about the word *before* an edge. The decode
+ * has not run yet, so there is no settled answer; the longest dictionary word
+ * ending here is the closest thing available, and it is what the decode will
+ * usually choose, since the reading charge prefers fewer words.
+ */
+export declare function wordEndingAt(context: EdgeContext, at: number, longest?: number): string | undefined;
+/**
+ * The word starting at a position, longest first, or undefined.
+ */
+export declare function wordStartingAt(context: EdgeContext, at: number, longest?: number): string | undefined;
+/**
+ * The part of speech the dictionary gives a word, or the empty string.
+ */
+export declare function tagOf(context: EdgeContext, word: string | undefined): string;
+/**
+ * What follows a 教 that is teaching where no object does: aspect and the
+ * complement marker, which only a verb takes.
+ *
+ * 他教了三年书, 他教过我英语, 她教书教得很快乐. Matched as characters rather
+ * than through their tags, because what the dictionary has starting at a 得 is
+ * as likely to be 得很 as the particle itself.
+ */
+export declare const ASPECT: Set<string>;
+/**
+ * The tag prefix jieba gives a particle, which nothing teaching can follow.
+ */
+export declare const PARTICLE_TAG = "u";
+//# sourceMappingURL=edge-context.d.ts.map

package/dist/decode/edge-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-context.d.ts","sourceRoot":"","sources":["../../src/decode/edge-context.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,WAAW,EACpB,EAAE,EAAE,MAAM,EACV,OAAO,SAAI,GACV,MAAM,GAAG,SAAS,CAYpB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,WAAW,EACpB,EAAE,EAAE,MAAM,EACV,OAAO,SAAI,GACV,MAAM,GAAG,SAAS,CAUpB;AAED;;GAEG;AACH,wBAAgB,KAAK,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAI5E;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,MAAM,aAA0C,CAAC;AAE9D;;GAEG;AACH,eAAO,MAAM,YAAY,MAAM,CAAC"}

package/dist/decode/edge-context.js

@@ -0,0 +1,57 @@
+/**
+ * The word ending at a position, longest first, or undefined.
+ *
+ * What a rule needs when it asks about the word *before* an edge. The decode
+ * has not run yet, so there is no settled answer; the longest dictionary word
+ * ending here is the closest thing available, and it is what the decode will
+ * usually choose, since the reading charge prefers fewer words.
+ */
+export function wordEndingAt(context, at, longest = 4) {
+    for (let length = longest; length > 0; length--) {
+        const from = at - length;
+        if (from < 0) {
+            continue;
+        }
+        const text = context.characters.slice(from, at).join("");
+        if (context.dictionary.lookup(text) !== undefined) {
+            return text;
+        }
+    }
+    return undefined;
+}
+/**
+ * The word starting at a position, longest first, or undefined.
+ */
+export function wordStartingAt(context, at, longest = 4) {
+    for (let length = longest; length > 0; length--) {
+        // Nothing starts at the end of a run, which is where a 得 closing a
+        // sentence asks from.
+        const text = context.characters.slice(at, at + length).join("");
+        if (text !== "" && context.dictionary.lookup(text) !== undefined) {
+            return text;
+        }
+    }
+    return undefined;
+}
+/**
+ * The part of speech the dictionary gives a word, or the empty string.
+ */
+export function tagOf(context, word) {
+    return word === undefined
+        ? ""
+        : (context.dictionary.lookup(word)?.partOfSpeech ?? "");
+}
+/**
+ * What follows a 教 that is teaching where no object does: aspect and the
+ * complement marker, which only a verb takes.
+ *
+ * 他教了三年书, 他教过我英语, 她教书教得很快乐. Matched as characters rather
+ * than through their tags, because what the dictionary has starting at a 得 is
+ * as likely to be 得很 as the particle itself.
+ */
+export const ASPECT = new Set(["了", "过", "過", "着", "著", "得"]);
+/**
+ * The tag prefix jieba gives a particle, which nothing teaching can follow.
+ */
+export const PARTICLE_TAG = "u";
+//# sourceMappingURL=edge-context.js.map

package/dist/decode/edge-context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-context.js","sourceRoot":"","sources":["../../src/decode/edge-context.ts"],"names":[],"mappings":"AAQA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAoB,EACpB,EAAU,EACV,OAAO,GAAG,CAAC;IAEX,KAAK,IAAI,MAAM,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,EAAE,GAAG,MAAM,CAAC;QACzB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzD,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAoB,EACpB,EAAU,EACV,OAAO,GAAG,CAAC;IAEX,KAAK,IAAI,MAAM,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;QAChD,mEAAmE;QACnE,sBAAsB;QACtB,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChE,IAAI,IAAI,KAAK,EAAE,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACjE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CAAC,OAAoB,EAAE,IAAwB;IAClE,OAAO,IAAI,KAAK,SAAS;QACvB,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,YAAY,IAAI,EAAE,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAE9D;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,GAAG,CAAC"}

package/dist/decode/hint-lattice.d.ts

@@ -0,0 +1,45 @@
+import { type Lattice } from "./lattice.js";
+import type { ResolvedHints } from "./hints.js";
+/**
+ * The same hints with every position moved along by an offset.
+ *
+ * Word hints match on what is written and so are carried over untouched; only
+ * the positional ones are counted from somewhere. Used where a run is decoded
+ * with context in front of it, which moves the run's own characters up the
+ * lattice by the length of that context.
+ */
+export declare function shiftHints(hints: ResolvedHints, by: number): ResolvedHints;
+/**
+ * The hints that fall inside a run, with their positions made relative to it.
+ *
+ * A caller counts positions from the start of the whole text, while a run is
+ * decoded on its own, so the positions have to be moved to where the run put
+ * them — and the ones naming a character in some other run dropped, rather than
+ * landing on whatever happens to sit at that index here.
+ */
+export declare function hintsWithin(hints: ResolvedHints, from: number, length: number): ResolvedHints;
+/**
+ * A caller's readings, put into a lattice that was built without them.
+ *
+ * Two kinds of hint with deliberately different reach, which is the whole of
+ * the semantics:
+ *
+ * A **word** hint is an assertion about the text it names, so it rewrites the
+ * edge spanning exactly those characters and supplies the single-character
+ * edges underneath it. It says nothing about a *longer* word that happens to
+ * contain it — a bare 长 hint leaves 校长 as `xiàozhǎng`, because the dictionary
+ * knowing 校长 is better evidence about that stretch than a caller's remark
+ * about one of its characters. That is what makes a corrections table safe to
+ * accumulate: entries do not reach into words nobody was thinking about.
+ *
+ * A **positional** hint is an assertion about one character of one text, and it
+ * is the escape hatch precisely because nothing outranks it: it rewrites every
+ * edge covering that position, the enclosing word included. Only a reading of
+ * one syllable per character can be rewritten this way; a 儿化 edge is a single
+ * claim about its whole span and there is no one syllable in it to replace.
+ *
+ * Nothing is invented that a caller did not write, and nothing is dropped: an
+ * edge whose reading no hint touches comes through as it was.
+ */
+export declare function applyHints(lattice: Lattice, hints: ResolvedHints): Lattice;
+//# sourceMappingURL=hint-lattice.d.ts.map

package/dist/decode/hint-lattice.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hint-lattice.d.ts","sourceRoot":"","sources":["../../src/decode/hint-lattice.ts"],"names":[],"mappings":"AAQA,OAAO,EACL,KAAK,OAAO,EAIb,MAAM,cAAc,CAAC;AACtB,OAAO,KAAK,EAAE,aAAa,EAAY,MAAM,YAAY,CAAC;AAE1D;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,EAAE,MAAM,GAAG,aAAa,CAK1E;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,aAAa,CAQf;AAeD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,aAAa,GAAG,OAAO,CAyF1E"}

package/dist/decode/hint-lattice.js

@@ -0,0 +1,140 @@
+import { READING_CHARGE, UNKNOWN_COST, } from "./lattice.js";
+/**
+ * The same hints with every position moved along by an offset.
+ *
+ * Word hints match on what is written and so are carried over untouched; only
+ * the positional ones are counted from somewhere. Used where a run is decoded
+ * with context in front of it, which moves the run's own characters up the
+ * lattice by the length of that context.
+ */
+export function shiftHints(hints, by) {
+    return {
+        words: hints.words,
+        at: new Map([...hints.at].map(([at, syllable]) => [at + by, syllable])),
+    };
+}
+/**
+ * The hints that fall inside a run, with their positions made relative to it.
+ *
+ * A caller counts positions from the start of the whole text, while a run is
+ * decoded on its own, so the positions have to be moved to where the run put
+ * them — and the ones naming a character in some other run dropped, rather than
+ * landing on whatever happens to sit at that index here.
+ */
+export function hintsWithin(hints, from, length) {
+    const at = new Map();
+    for (const [position, syllable] of hints.at) {
+        if (position >= from && position < from + length) {
+            at.set(position - from, syllable);
+        }
+    }
+    return { words: hints.words, at };
+}
+/**
+ * Whether a hint's characters are what stands at a position.
+ */
+function matchesAt(hint, characters, at) {
+    return hint.characters.every((character, index) => characters[at + index] === character);
+}
+/**
+ * A caller's readings, put into a lattice that was built without them.
+ *
+ * Two kinds of hint with deliberately different reach, which is the whole of
+ * the semantics:
+ *
+ * A **word** hint is an assertion about the text it names, so it rewrites the
+ * edge spanning exactly those characters and supplies the single-character
+ * edges underneath it. It says nothing about a *longer* word that happens to
+ * contain it — a bare 长 hint leaves 校长 as `xiàozhǎng`, because the dictionary
+ * knowing 校长 is better evidence about that stretch than a caller's remark
+ * about one of its characters. That is what makes a corrections table safe to
+ * accumulate: entries do not reach into words nobody was thinking about.
+ *
+ * A **positional** hint is an assertion about one character of one text, and it
+ * is the escape hatch precisely because nothing outranks it: it rewrites every
+ * edge covering that position, the enclosing word included. Only a reading of
+ * one syllable per character can be rewritten this way; a 儿化 edge is a single
+ * claim about its whole span and there is no one syllable in it to replace.
+ *
+ * Nothing is invented that a caller did not write, and nothing is dropped: an
+ * edge whose reading no hint touches comes through as it was.
+ */
+export function applyHints(lattice, hints) {
+    const { characters } = lattice;
+    /** The word hint covering a position, and how far into it that position is. */
+    const wordAt = (at) => {
+        for (const hint of hints.words) {
+            if (hint.reading.length !== hint.characters.length) {
+                continue;
+            }
+            for (let held = 0; held < hint.characters.length; held++) {
+                if (at - held >= 0 && matchesAt(hint, characters, at - held)) {
+                    return { hint, held };
+                }
+            }
+        }
+        return undefined;
+    };
+    const rewrite = (edge) => {
+        const span = edge.to - edge.from;
+        // A word hint naming exactly this stretch replaces its reading outright,
+        // which is the only way a hint can reach a word the dictionary already has
+        // an opinion about: 银行 asserted as `yín xíng` has to beat `yínháng`.
+        const exact = hints.words.find((hint) => hint.characters.length === span &&
+            matchesAt(hint, characters, edge.from));
+        let reading = exact === undefined ? edge.reading : exact.reading;
+        // Everything below needs one syllable per character to have a syllable to
+        // put anywhere.
+        if (reading.length === span) {
+            reading = reading.map((syllable, index) => {
+                const at = edge.from + index;
+                const positional = hints.at.get(at);
+                if (positional !== undefined) {
+                    return positional;
+                }
+                if (span > 1) {
+                    return syllable;
+                }
+                // Single-character edges also take what a longer word hint says about
+                // this position, so that the split path reads the same as the whole.
+                const found = wordAt(at);
+                return found?.hint.reading[found.held] ?? syllable;
+            });
+        }
+        return reading === edge.reading ? edge : { ...edge, reading };
+    };
+    return {
+        characters,
+        edges: lattice.edges.map((edges, at) => {
+            const rewritten = edges.map((edge) => rewrite(edge));
+            // A hint spanning characters no edge covers has nowhere to be written, so
+            // it brings its own edge: 玩儿 as `wánr` where the dictionary lacks it.
+            const spanning = hints.words.find((hint) => hint.reading.length !== hint.characters.length &&
+                matchesAt(hint, characters, at) &&
+                !rewritten.some((edge) => edge.to === at + hint.characters.length));
+            if (spanning === undefined) {
+                return rewritten;
+            }
+            const to = at + spanning.characters.length;
+            return [
+                ...rewritten,
+                {
+                    from: at,
+                    to,
+                    text: spanning.characters.join(""),
+                    reading: spanning.reading,
+                    cost: UNKNOWN_COST,
+                    readingCost: UNKNOWN_COST + READING_CHARGE,
+                    isProperNoun: false,
+                    partOfSpeech: "",
+                    // No dictionary entry backs this one — that is the whole reason it
+                    // had to be brought along — so it reports itself as the fallback it
+                    // is. A hint written over an edge that *was* backed keeps that edge's
+                    // own answer, since the entry still covers those characters.
+                    isKnown: false,
+                },
+            ];
+        }),
+    };
+}
+//# sourceMappingURL=hint-lattice.js.map

package/dist/decode/hint-lattice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hint-lattice.js","sourceRoot":"","sources":["../../src/decode/hint-lattice.ts"],"names":[],"mappings":"AAQA,OAAO,EAGL,cAAc,EACd,YAAY,GACb,MAAM,cAAc,CAAC;AAGtB;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,KAAoB,EAAE,EAAU;IACzD,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;KACxE,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CACzB,KAAoB,EACpB,IAAY,EACZ,MAAc;IAEd,MAAM,EAAE,GAAG,IAAI,GAAG,EAAoB,CAAC;IACvC,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC;QAC5C,IAAI,QAAQ,IAAI,IAAI,IAAI,QAAQ,GAAG,IAAI,GAAG,MAAM,EAAE,CAAC;YACjD,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAS,SAAS,CAChB,IAAc,EACd,UAA6B,EAC7B,EAAU;IAEV,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAC1B,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,SAAS,CAC3D,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,UAAU,CAAC,OAAgB,EAAE,KAAoB;IAC/D,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAE/B,+EAA+E;IAC/E,MAAM,MAAM,GAAG,CAAC,EAAU,EAAgD,EAAE;QAC1E,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;gBACnD,SAAS;YACX,CAAC;YACD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;gBACzD,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;oBAC7D,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,IAAiB,EAAe,EAAE;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QAEjC,yEAAyE;QACzE,2EAA2E;QAC3E,qEAAqE;QACrE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC5B,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,IAAI;YAC/B,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,CACzC,CAAC;QACF,IAAI,OAAO,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;QAEjE,0EAA0E;QAC1E,gBAAgB;QAChB,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC5B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;gBACxC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;gBAC7B,MAAM,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC7B,OAAO,UAAU,CAAC;gBACpB,CAAC;gBACD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;oBACb,OAAO,QAAQ,CAAC;gBAClB,CAAC;gBACD,sEAAsE;gBACtE,qEAAqE;gBACrE,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;gBACzB,OAAO,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;YACrD,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,OAAO,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAC;IAChE,CAAC,CAAC;IAEF,OAAO;QACL,UAAU;QACV,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;YACrC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACrD,0EAA0E;YAC1E,sEAAsE;YACtE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC/B,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,CAAC,MAAM;gBAC9C,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,CAAC;gBAC/B,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CACrE,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,MAAM,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC;YAC3C,OAAO;gBACL,GAAG,SAAS;gBACZ;oBACE,IAAI,EAAE,EAAE;oBACR,EAAE;oBACF,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClC,OAAO,EAAE,QAAQ,CAAC,OAAO;oBACzB,IAAI,EAAE,YAAY;oBAClB,WAAW,EAAE,YAAY,GAAG,cAAc;oBAC1C,YAAY,EAAE,KAAK;oBACnB,YAAY,EAAE,EAAE;oBAChB,mEAAmE;oBACnE,oEAAoE;oBACpE,sEAAsE;oBACtE,6DAA6D;oBAC7D,OAAO,EAAE,KAAK;iBACf;aACF,CAAC;QACJ,CAAC,CAAC;KACH,CAAC;AACJ,CAAC"}

package/dist/decode/hints.d.ts

@@ -1,5 +1,4 @@
 import { type Syllable } from "../syllable/syllable.js";
-import { type Lattice } from "./lattice.js";
 /**
  * A reading a caller asserts for a word, wherever that word occurs.
  *
@@ -68,7 +67,7 @@ export interface ResolvedHints {
 /**
  * One word hint, with its characters and reading already taken apart.
  */
-interface WordHint {
+export interface WordHint {
     readonly characters: readonly string[];
     readonly reading: readonly Syllable[];
 }
@@ -92,47 +91,5 @@ export declare function readHintReading(reading: string, subject: string): reado
  * longest-wins rule the dictionary itself is read by.
  */
 export declare function resolveHints(hints: ReadingHints): ResolvedHints;
-/**
- * The same hints with every position moved along by an offset.
- *
- * Word hints match on what is written and so are carried over untouched; only
- * the positional ones are counted from somewhere. Used where a run is decoded
- * with context in front of it, which moves the run's own characters up the
- * lattice by the length of that context.
- */
-export declare function shiftHints(hints: ResolvedHints, by: number): ResolvedHints;
-/**
- * The hints that fall inside a run, with their positions made relative to it.
- *
- * A caller counts positions from the start of the whole text, while a run is
- * decoded on its own, so the positions have to be moved to where the run put
- * them — and the ones naming a character in some other run dropped, rather than
- * landing on whatever happens to sit at that index here.
- */
-export declare function hintsWithin(hints: ResolvedHints, from: number, length: number): ResolvedHints;
-/**
- * A caller's readings, put into a lattice that was built without them.
- *
- * Two kinds of hint with deliberately different reach, which is the whole of
- * the semantics:
- *
- * A **word** hint is an assertion about the text it names, so it rewrites the
- * edge spanning exactly those characters and supplies the single-character
- * edges underneath it. It says nothing about a *longer* word that happens to
- * contain it — a bare 长 hint leaves 校长 as `xiàozhǎng`, because the dictionary
- * knowing 校长 is better evidence about that stretch than a caller's remark
- * about one of its characters. That is what makes a corrections table safe to
- * accumulate: entries do not reach into words nobody was thinking about.
- *
- * A **positional** hint is an assertion about one character of one text, and it
- * is the escape hatch precisely because nothing outranks it: it rewrites every
- * edge covering that position, the enclosing word included. Only a reading of
- * one syllable per character can be rewritten this way; a 儿化 edge is a single
- * claim about its whole span and there is no one syllable in it to replace.
- *
- * Nothing is invented that a caller did not write, and nothing is dropped: an
- * edge whose reading no hint touches comes through as it was.
- */
-export declare function applyHints(lattice: Lattice, hints: ResolvedHints): Lattice;
-export {};
+export { applyHints, hintsWithin, shiftHints } from "./hint-lattice.js";
 //# sourceMappingURL=hints.d.ts.map

package/dist/decode/hints.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hints.d.ts","sourceRoot":"","sources":["../../src/decode/hints.ts"],"names":[],"mappings":"AACA,OAAO,EAAgB,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAEtE,OAAO,EACL,KAAK,OAAO,EAIb,MAAM,cAAc,CAAC;AAEtB;;;;;;;GAOG;AACH,MAAM,WAAW,WAAW;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,+DAA+D;IAC/D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG,iBAAiB,CAAC;AAE1D;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,YAAY,GACpB,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAChC,SAAS,WAAW,EAAE,CAAC;AAE3B;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IACpC;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC5C;AAED;;GAEG;AACH,UAAU,QAAQ;IAChB,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,CAAC;CACvC;AASD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd,SAAS,QAAQ,EAAE,CAYrB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,YAAY,GAAG,aAAa,CAwC/D;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,EAAE,MAAM,GAAG,aAAa,CAK1E;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,aAAa,CAQf;AAeD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,aAAa,GAAG,OAAO,CAyF1E"}
+{"version":3,"file":"hints.d.ts","sourceRoot":"","sources":["../../src/decode/hints.ts"],"names":[],"mappings":"AACA,OAAO,EAAgB,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGtE;;;;;;;GAOG;AACH,MAAM,WAAW,WAAW;IAC1B,mDAAmD;IACnD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,+DAA+D;IAC/D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG,iBAAiB,CAAC;AAE1D;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,YAAY,GACpB,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAChC,SAAS,WAAW,EAAE,CAAC;AAE3B;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IACpC;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,CAAC;CACvC;AASD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd,SAAS,QAAQ,EAAE,CAYrB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,YAAY,GAAG,aAAa,CAwC/D;AAED,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC"}