@mailwoman/core 2.0.0

package/out/decoder/types.d.ts

@@ -0,0 +1,71 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Output-shape types for the neural classifier decoder.
+ *
+ *   The decoder turns a flat stream of BIO-labeled tokens (the raw output of the sequence model) into
+ *   an `AddressTree` — a containment-nested representation that downstream code projects into JSON
+ *   (libpostal-compat), tuple pairs (order-preserving), or XML (hierarchy + attributes).
+ *
+ *   Why three shapes:
+ *
+ *   - JSON is the libpostal-compat surface; downstream users with existing pipelines.
+ *   - Tuples preserve repetition + source order — fixes the lossy cases JSON can't handle.
+ *   - XML preserves containment hierarchy and per-node attributes (conf today, src in Phase 4 when the
+ *       Resolver lands). XML chosen over S-expression for LLM-tooling alignment and off-the-shelf
+ *       parser availability.
+ *
+ *   See `containment.ts` for the parent-of mapping that drives nesting.
+ */
+import type { BioLabel, ComponentTag } from "../types/component.js";
+export type { BioLabel, ComponentTag };
+/**
+ * A single token emitted by the model, paired with its predicted label and confidence.
+ *
+ * `start`/`end` are character offsets into the original raw input. The tokenizer is responsible for
+ * producing these (SentencePiece's `encode` returns offsets); they are NOT recomputed by the
+ * decoder.
+ */
+export interface DecoderToken {
+    /** The token piece as the tokenizer emitted it (with any leading-space sentinel preserved). */
+    piece: string;
+    /** Inclusive start char offset in the original raw text. */
+    start: number;
+    /** Exclusive end char offset in the original raw text. */
+    end: number;
+    /** The argmax BIO label for this token. */
+    label: BioLabel;
+    /** Softmax confidence for the chosen label, in [0, 1]. */
+    confidence: number;
+}
+/**
+ * One node of the address tree — a component span plus any nested child components.
+ *
+ * `value` is the raw text covered by this span, sliced from the original input by `[start, end)`.
+ * `confidence` is aggregated across the span's tokens (currently mean; see `build-tree.ts`).
+ * `children` are tagged subcomponents whose spans fall within this node's span AND whose tag's
+ * containment rule names this node's tag as a permitted parent.
+ */
+export interface AddressNode {
+    tag: ComponentTag;
+    value: string;
+    start: number;
+    end: number;
+    confidence: number;
+    children: AddressNode[];
+}
+/**
+ * The full decoded tree for one parsed address.
+ *
+ * `roots` is the list of top-level components in source order. Components that don't have a
+ * containing parent in the labeled output become roots themselves (e.g. a bare "house_number" with
+ * no labeled street parent).
+ */
+export interface AddressTree {
+    /** The original raw input text — preserved for round-trip and XML root @raw attribute. */
+    raw: string;
+    roots: AddressNode[];
+}
+//# sourceMappingURL=types.d.ts.map

package/out/decoder/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../decoder/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAEnE,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAA;AAEtC;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC5B,+FAA+F;IAC/F,KAAK,EAAE,MAAM,CAAA;IACb,4DAA4D;IAC5D,KAAK,EAAE,MAAM,CAAA;IACb,0DAA0D;IAC1D,GAAG,EAAE,MAAM,CAAA;IACX,2CAA2C;IAC3C,KAAK,EAAE,QAAQ,CAAA;IACf,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAA;CAClB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,WAAW;IAC3B,GAAG,EAAE,YAAY,CAAA;IACjB,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;IACX,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,WAAW,EAAE,CAAA;CACvB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC3B,0FAA0F;IAC1F,GAAG,EAAE,MAAM,CAAA;IACX,KAAK,EAAE,WAAW,EAAE,CAAA;CACpB"}

package/out/decoder/types.js

@@ -0,0 +1,23 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Output-shape types for the neural classifier decoder.
+ *
+ *   The decoder turns a flat stream of BIO-labeled tokens (the raw output of the sequence model) into
+ *   an `AddressTree` — a containment-nested representation that downstream code projects into JSON
+ *   (libpostal-compat), tuple pairs (order-preserving), or XML (hierarchy + attributes).
+ *
+ *   Why three shapes:
+ *
+ *   - JSON is the libpostal-compat surface; downstream users with existing pipelines.
+ *   - Tuples preserve repetition + source order — fixes the lossy cases JSON can't handle.
+ *   - XML preserves containment hierarchy and per-node attributes (conf today, src in Phase 4 when the
+ *       Resolver lands). XML chosen over S-expression for LLM-tooling alignment and off-the-shelf
+ *       parser availability.
+ *
+ *   See `containment.ts` for the parent-of mapping that drives nesting.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/out/decoder/types.js.map

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

package/out/filters/InvalidSolutionFilter.d.ts

@@ -0,0 +1,19 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Classification, Solver, SolverContext } from "@mailwoman/core";
+type InvalidSequence = Classification[];
+/**
+ * Filter to remove combinations of classifications that don't logically make sense.
+ *
+ * For example, removing solutions which are only 'house_number+locality'
+ */
+export declare class InvalidSolutionFilter implements Solver {
+    readonly invalidSequences: InvalidSequence[];
+    constructor(...invalidSequences: InvalidSequence[]);
+    solve(tokenizer: SolverContext): void;
+}
+export {};
+//# sourceMappingURL=InvalidSolutionFilter.d.ts.map

package/out/filters/InvalidSolutionFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InvalidSolutionFilter.d.ts","sourceRoot":"","sources":["../../filters/InvalidSolutionFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAE5E,KAAK,eAAe,GAAG,cAAc,EAAE,CAAA;AAEvC;;;;GAIG;AACH,qBAAa,qBAAsB,YAAW,MAAM;IACnD,SAAgB,gBAAgB,EAAE,eAAe,EAAE,CAAA;gBAEvC,GAAG,gBAAgB,EAAE,eAAe,EAAE;IAIlD,KAAK,CAAC,SAAS,EAAE,aAAa,GAAG,IAAI;CAerC"}

package/out/filters/InvalidSolutionFilter.js

@@ -0,0 +1,29 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * Filter to remove combinations of classifications that don't logically make sense.
+ *
+ * For example, removing solutions which are only 'house_number+locality'
+ */
+export class InvalidSolutionFilter {
+    invalidSequences;
+    constructor(...invalidSequences) {
+        this.invalidSequences = invalidSequences.map((invalidCombination) => invalidCombination.sort());
+    }
+    solve(tokenizer) {
+        const nextSolutions = tokenizer.solutions.filter((solution) => {
+            const classifications = solution.collectClassifications().sort();
+            return !this.invalidSequences.some((p) => {
+                if (classifications.length !== p.length)
+                    return false;
+                const invalid = classifications.every((_, i) => classifications[i] === p[i]);
+                return invalid;
+            });
+        });
+        tokenizer.solutions = nextSolutions;
+    }
+}
+//# sourceMappingURL=InvalidSolutionFilter.js.map

package/out/filters/InvalidSolutionFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InvalidSolutionFilter.js","sourceRoot":"","sources":["../../filters/InvalidSolutionFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH;;;;GAIG;AACH,MAAM,OAAO,qBAAqB;IACjB,gBAAgB,CAAmB;IAEnD,YAAY,GAAG,gBAAmC;QACjD,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,kBAAkB,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAA;IAChG,CAAC;IAED,KAAK,CAAC,SAAwB;QAC7B,MAAM,aAAa,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC7D,MAAM,eAAe,GAAG,QAAQ,CAAC,sBAAsB,EAAE,CAAC,IAAI,EAAE,CAAA;YAEhE,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBACxC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;oBAAE,OAAO,KAAK,CAAA;gBAErD,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBAE5E,OAAO,OAAO,CAAA;YACf,CAAC,CAAC,CAAA;QACH,CAAC,CAAC,CAAA;QAEF,SAAS,CAAC,SAAS,GAAG,aAAa,CAAA;IACpC,CAAC;CACD"}

package/out/filters/RelationshipFilter.d.ts

@@ -0,0 +1,14 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { type FilterRelation, type FilterRelationRule, Solution, type Solver, type SolverContext } from "@mailwoman/core";
+export declare class RelationshipFilter implements Solver {
+    protected rules: FilterRelationRule[];
+    constructor(rules: FilterRelationRule[]);
+    protected applyRelation(relation: FilterRelation, solutions: readonly Solution[]): Solution[];
+    protected applyMustNotFollow(relation: FilterRelation, solutions: readonly Solution[]): Solution[];
+    solve(context: SolverContext): void;
+}
+//# sourceMappingURL=RelationshipFilter.d.ts.map

package/out/filters/RelationshipFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RelationshipFilter.d.ts","sourceRoot":"","sources":["../../filters/RelationshipFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACN,KAAK,cAAc,EACnB,KAAK,kBAAkB,EACvB,QAAQ,EACR,KAAK,MAAM,EACX,KAAK,aAAa,EAElB,MAAM,iBAAiB,CAAA;AAExB,qBAAa,kBAAmB,YAAW,MAAM;IACpC,SAAS,CAAC,KAAK,EAAE,kBAAkB,EAAE;gBAA3B,KAAK,EAAE,kBAAkB,EAAE;IAEjD,SAAS,CAAC,aAAa,CAAC,QAAQ,EAAE,cAAc,EAAE,SAAS,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ,EAAE;IAgC7F,SAAS,CAAC,kBAAkB,CAAC,QAAQ,EAAE,cAAc,EAAE,SAAS,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ,EAAE;IAiB3F,KAAK,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;CAW1C"}

package/out/filters/RelationshipFilter.js

@@ -0,0 +1,64 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Solution, Span, } from "@mailwoman/core";
+export class RelationshipFilter {
+    rules;
+    constructor(rules) {
+        this.rules = rules;
+    }
+    applyRelation(relation, solutions) {
+        return solutions.filter((solution) => {
+            let predicate;
+            const matchedSubjects = [];
+            for (const { span, classification } of solution.matches) {
+                if (!predicate && classification === relation.object) {
+                    predicate =
+                        relation.direction === "precedes"
+                            ? (subject) => subject.start > span.start
+                            : (subject) => subject.start < span.start;
+                }
+                if (classification === relation.subject) {
+                    matchedSubjects.push(span);
+                }
+            }
+            if (!predicate || matchedSubjects.length === 0)
+                return true;
+            // Solution contains both object & subject classifications.
+            if (!matchedSubjects.some(predicate))
+                return true;
+            // Remove the object classification from this solution.
+            solution.matches = solution.matches.filter((p) => p.classification !== relation.object);
+            // new Solution()
+            return solution.matches.length > 0;
+        });
+    }
+    applyMustNotFollow(relation, solutions) {
+        return solutions.filter((solution) => {
+            const [matchedObject] = solution.filter(relation.object);
+            const matchedSubjects = solution.filter(relation.subject);
+            if (!matchedObject || matchedSubjects.length === 0)
+                return true;
+            // Solution contains both object & subject classifications.
+            // Does the object comes before the subject(s)?
+            if (!matchedSubjects.some((p) => p.span.start < matchedObject.span.end))
+                return true;
+            // Remove the object classification from this solution.
+            solution.matches = solution.matches.filter((p) => p.classification !== relation.object);
+            return solution.matches.length > 0;
+        });
+    }
+    solve(context) {
+        for (const [object, direction, subject] of this.rules) {
+            const relation = {
+                object,
+                direction,
+                subject,
+            };
+            context.solutions = this.applyRelation(relation, context.solutions);
+        }
+    }
+}
+//# sourceMappingURL=RelationshipFilter.js.map

package/out/filters/RelationshipFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RelationshipFilter.js","sourceRoot":"","sources":["../../filters/RelationshipFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAGN,QAAQ,EAGR,IAAI,GACJ,MAAM,iBAAiB,CAAA;AAExB,MAAM,OAAO,kBAAkB;IACR;IAAtB,YAAsB,KAA2B;QAA3B,UAAK,GAAL,KAAK,CAAsB;IAAG,CAAC;IAE3C,aAAa,CAAC,QAAwB,EAAE,SAA8B;QAC/E,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YACpC,IAAI,SAAmD,CAAA;YACvD,MAAM,eAAe,GAAW,EAAE,CAAA;YAElC,KAAK,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACzD,IAAI,CAAC,SAAS,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACtD,SAAS;wBACR,QAAQ,CAAC,SAAS,KAAK,UAAU;4BAChC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;4BACzC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;gBAC5C,CAAC;gBAED,IAAI,cAAc,KAAK,QAAQ,CAAC,OAAO,EAAE,CAAC;oBACzC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC3B,CAAC;YACF,CAAC;YAED,IAAI,CAAC,SAAS,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAA;YAE3D,2DAA2D;YAE3D,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;YAEjD,uDAAuD;YACvD,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAA;YAEvF,iBAAiB;YACjB,OAAO,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QACnC,CAAC,CAAC,CAAA;IACH,CAAC;IAES,kBAAkB,CAAC,QAAwB,EAAE,SAA8B;QACpF,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YACpC,MAAM,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YACxD,MAAM,eAAe,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;YAEzD,IAAI,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAA;YAC/D,2DAA2D;YAC3D,+CAA+C;YAC/C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAA;YAEpF,uDAAuD;YACvD,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAA;YAEvF,OAAO,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QACnC,CAAC,CAAC,CAAA;IACH,CAAC;IAEM,KAAK,CAAC,OAAsB;QAClC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvD,MAAM,QAAQ,GAAmB;gBAChC,MAAM;gBACN,SAAS;gBACT,OAAO;aACP,CAAA;YAED,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,CAAC,CAAA;QACpE,CAAC;IACF,CAAC;CACD"}

package/out/filters/SubsetFilter.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Solver, SolverContext } from "@mailwoman/core";
+export declare class SubsetFilter implements Solver {
+    solve(context: SolverContext): void;
+}
+//# sourceMappingURL=SubsetFilter.d.ts.map

package/out/filters/SubsetFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SubsetFilter.d.ts","sourceRoot":"","sources":["../../filters/SubsetFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAE5D,qBAAa,YAAa,YAAW,MAAM;IAC1C,KAAK,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;CAqBnC"}

package/out/filters/SubsetFilter.js

@@ -0,0 +1,26 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export class SubsetFilter {
+    solve(context) {
+        for (const [i, solution] of context.solutions.entries()) {
+            context.solutions = context.solutions.filter((s, j) => {
+                if (j <= i) {
+                    return true;
+                }
+                // do not favour solutions with lower scores (if for any reason they are not sorted)
+                if (solution.score < s.score) {
+                    return false;
+                }
+                // if two solutions cover the same tokens, remove the latter
+                if (solution.coversSameClassification(s)) {
+                    return false;
+                }
+                return true;
+            });
+        }
+    }
+}
+//# sourceMappingURL=SubsetFilter.js.map

package/out/filters/SubsetFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SubsetFilter.js","sourceRoot":"","sources":["../../filters/SubsetFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,OAAO,YAAY;IACxB,KAAK,CAAC,OAAsB;QAC3B,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YACzD,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACrD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACZ,OAAO,IAAI,CAAA;gBACZ,CAAC;gBAED,oFAAoF;gBACpF,IAAI,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;oBAC9B,OAAO,KAAK,CAAA;gBACb,CAAC;gBAED,4DAA4D;gBAC5D,IAAI,QAAQ,CAAC,wBAAwB,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1C,OAAO,KAAK,CAAA;gBACb,CAAC;gBAED,OAAO,IAAI,CAAA;YACZ,CAAC,CAAC,CAAA;QACH,CAAC;IACF,CAAC;CACD"}

package/out/filters/TokenDistanceFilter.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Solver, SolverContext } from "@mailwoman/core";
+export declare class TokenDistanceFilter implements Solver {
+    solve(context: SolverContext): void;
+}
+//# sourceMappingURL=TokenDistanceFilter.d.ts.map

package/out/filters/TokenDistanceFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TokenDistanceFilter.d.ts","sourceRoot":"","sources":["../../filters/TokenDistanceFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAI5D,qBAAa,mBAAoB,YAAW,MAAM;IACjD,KAAK,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;CAyBnC"}

package/out/filters/TokenDistanceFilter.js

@@ -0,0 +1,30 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+const MAX_DISTANCE = 2;
+export class TokenDistanceFilter {
+    solve(context) {
+        context.solutions = context.solutions.filter((solution) => {
+            const housenumber = solution.filter("house_number");
+            const street = solution.filter("street");
+            // Housenumber with no street
+            // note: remove this as a postcode classification may be more relevant
+            // note: this functionality may no longer be valid in an autocomplete context
+            if (housenumber.length > 0 && street.length === 0) {
+                solution.matches = solution.findWithout("house_number");
+                return solution.matches.length > 0;
+            }
+            // Both house number and street classified.
+            if (housenumber.length > 0 && street.length > 0) {
+                // Ensure tokens are less than n distance apart.
+                if (street[0].span.distance(housenumber[0].span) > MAX_DISTANCE) {
+                    return false;
+                }
+            }
+            return true;
+        });
+    }
+}
+//# sourceMappingURL=TokenDistanceFilter.js.map

package/out/filters/TokenDistanceFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TokenDistanceFilter.js","sourceRoot":"","sources":["../../filters/TokenDistanceFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,YAAY,GAAG,CAAC,CAAA;AAEtB,MAAM,OAAO,mBAAmB;IAC/B,KAAK,CAAC,OAAsB;QAC3B,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YACzD,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,cAAc,CAAC,CAAA;YACnD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;YAExC,6BAA6B;YAC7B,sEAAsE;YACtE,6EAA6E;YAC7E,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnD,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,WAAW,CAAC,cAAc,CAAC,CAAA;gBAEvD,OAAO,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YACnC,CAAC;YAED,2CAA2C;YAC3C,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACjD,gDAAgD;gBAChD,IAAI,MAAM,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;oBACnE,OAAO,KAAK,CAAA;gBACb,CAAC;YACF,CAAC;YAED,OAAO,IAAI,CAAA;QACZ,CAAC,CAAC,CAAA;IACH,CAAC;CACD"}

package/out/filters/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./InvalidSolutionFilter.js";
+export * from "./RelationshipFilter.js";
+export * from "./SubsetFilter.js";
+export * from "./TokenDistanceFilter.js";
+//# sourceMappingURL=index.d.ts.map

package/out/filters/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../filters/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,4BAA4B,CAAA;AAC1C,cAAc,yBAAyB,CAAA;AACvC,cAAc,mBAAmB,CAAA;AACjC,cAAc,0BAA0B,CAAA"}

package/out/filters/index.js

@@ -0,0 +1,10 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./InvalidSolutionFilter.js";
+export * from "./RelationshipFilter.js";
+export * from "./SubsetFilter.js";
+export * from "./TokenDistanceFilter.js";
+//# sourceMappingURL=index.js.map

package/out/filters/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../filters/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,4BAA4B,CAAA;AAC1C,cAAc,yBAAyB,CAAA;AACvC,cAAc,mBAAmB,CAAA;AACjC,cAAc,0BAA0B,CAAA"}

package/out/formatter/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { ClassificationMap } from "@mailwoman/core/classification";
+/**
+ * Given a map of classifications, format them into a human-readable address.
+ */
+export declare function formatAddress(classifications: ClassificationMap): string;
+//# sourceMappingURL=index.d.ts.map

package/out/formatter/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../formatter/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,iBAAiB,EAAyB,MAAM,gCAAgC,CAAA;AAwB9F;;GAEG;AACH,wBAAgB,aAAa,CAAC,eAAe,EAAE,iBAAiB,UA2B/D"}

package/out/formatter/index.js

@@ -0,0 +1,49 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import addressFormatter from "@fragaria/address-formatter";
+const ClassificationToFragaria = new Map([
+    ["venue", "attention"],
+    ["street", "street"],
+    ["country", "country"],
+    ["house_number", "housenumber"],
+    ["locality", "locality"],
+    ["postcode", "postcode"],
+    ["region", "state"],
+]);
+const ClassificationToSeparator = new Map([
+    ["venue", ", "],
+    ["street", " & "],
+    ["country", ", "],
+    ["house_number", ", "],
+    ["locality", " "],
+    ["postcode", "-"],
+    ["region", ", "],
+]);
+/**
+ * Given a map of classifications, format them into a human-readable address.
+ */
+export function formatAddress(classifications) {
+    const props = new Map();
+    for (const [classification, value] of classifications.entries()) {
+        const fragariaProp = ClassificationToFragaria.get(classification);
+        if (!fragariaProp)
+            continue;
+        if (!value)
+            continue;
+        if (props.has(fragariaProp))
+            continue;
+        const separator = ClassificationToSeparator.get(classification) || ", ";
+        props.set(fragariaProp, value.join(separator));
+    }
+    const formatted = addressFormatter.format(Object.fromEntries(props), {
+        // abbreviate: true,
+        // appendCountry: true,
+        countryCode: "US",
+        output: "array",
+    });
+    return formatted.join(", ");
+}
+//# sourceMappingURL=index.js.map

package/out/formatter/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../formatter/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,gBAAgB,MAAM,6BAA6B,CAAA;AAK1D,MAAM,wBAAwB,GAAG,IAAI,GAAG,CAA8C;IACrF,CAAC,OAAO,EAAE,WAAW,CAAC;IACtB,CAAC,QAAQ,EAAE,QAAQ,CAAC;IACpB,CAAC,SAAS,EAAE,SAAS,CAAC;IACtB,CAAC,cAAc,EAAE,aAAa,CAAC;IAC/B,CAAC,UAAU,EAAE,UAAU,CAAC;IACxB,CAAC,UAAU,EAAE,UAAU,CAAC;IACxB,CAAC,QAAQ,EAAE,OAAO,CAAC;CACnB,CAAC,CAAA;AAEF,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAgC;IACxE,CAAC,OAAO,EAAE,IAAI,CAAC;IACf,CAAC,QAAQ,EAAE,KAAK,CAAC;IACjB,CAAC,SAAS,EAAE,IAAI,CAAC;IACjB,CAAC,cAAc,EAAE,IAAI,CAAC;IACtB,CAAC,UAAU,EAAE,GAAG,CAAC;IACjB,CAAC,UAAU,EAAE,GAAG,CAAC;IACjB,CAAC,QAAQ,EAAE,IAAI,CAAC;CAChB,CAAC,CAAA;AAEF;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,eAAkC;IAC/D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgC,CAAA;IAErD,KAAK,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;QACjE,MAAM,YAAY,GAAG,wBAAwB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;QAEjE,IAAI,CAAC,YAAY;YAAE,SAAQ;QAC3B,IAAI,CAAC,KAAK;YAAE,SAAQ;QACpB,IAAI,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,SAAQ;QAErC,MAAM,SAAS,GAAG,yBAAyB,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,IAAI,CAAA;QAEvE,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAA;IAC/C,CAAC;IAED,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CACxC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAEzB;QACC,oBAAoB;QACpB,uBAAuB;QACvB,WAAW,EAAE,IAAI;QACjB,MAAM,EAAE,OAAO;KACf,CACD,CAAA;IAED,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC5B,CAAC"}

package/out/index.d.ts

@@ -0,0 +1,14 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./classification/index.js";
+export * from "./decoder/index.js";
+export * from "./formatter/index.js";
+export * from "./parser/index.js";
+export * from "./resources/index.js";
+export * from "./solver/index.js";
+export * from "./tokenization/index.js";
+export * from "./types/index.js";
+//# sourceMappingURL=index.d.ts.map

package/out/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,cAAc,2BAA2B,CAAA;AACzC,cAAc,oBAAoB,CAAA;AAClC,cAAc,sBAAsB,CAAA;AACpC,cAAc,mBAAmB,CAAA;AACjC,cAAc,sBAAsB,CAAA;AACpC,cAAc,mBAAmB,CAAA;AACjC,cAAc,yBAAyB,CAAA;AACvC,cAAc,kBAAkB,CAAA"}

package/out/index.js

@@ -0,0 +1,18 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+// `resources` triggers top-level await (libpostal data scan). Keep it LAST so consumers using
+// bare `@mailwoman/core` for non-resource exports (classifiers, tokenization, decoder, …) can
+// resolve those exports before TLA pauses the module. Re-ordering broke
+// `class extends WordClassifier` evaluation under Vite's TLA-aware loader.
+export * from "./classification/index.js";
+export * from "./decoder/index.js";
+export * from "./formatter/index.js";
+export * from "./parser/index.js";
+export * from "./resources/index.js";
+export * from "./solver/index.js";
+export * from "./tokenization/index.js";
+export * from "./types/index.js";
+//# sourceMappingURL=index.js.map

package/out/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,8FAA8F;AAC9F,8FAA8F;AAC9F,wEAAwE;AACxE,2EAA2E;AAC3E,cAAc,2BAA2B,CAAA;AACzC,cAAc,oBAAoB,CAAA;AAClC,cAAc,sBAAsB,CAAA;AACpC,cAAc,mBAAmB,CAAA;AACjC,cAAc,sBAAsB,CAAA;AACpC,cAAc,mBAAmB,CAAA;AACjC,cAAc,yBAAyB,CAAA;AACvC,cAAc,kBAAkB,CAAA"}

package/out/locale/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./locale.js";
+export * from "./profiles/index.js";
+export * from "./registry.js";
+//# sourceMappingURL=index.d.ts.map

package/out/locale/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../locale/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,aAAa,CAAA;AAC3B,cAAc,qBAAqB,CAAA;AACnC,cAAc,eAAe,CAAA"}

package/out/locale/index.js

@@ -0,0 +1,9 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export * from "./locale.js";
+export * from "./profiles/index.js";
+export * from "./registry.js";
+//# sourceMappingURL=index.js.map

package/out/locale/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../locale/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,aAAa,CAAA;AAC3B,cAAc,qBAAqB,CAAA;AACnC,cAAc,eAAe,CAAA"}

package/out/locale/locale.d.ts

@@ -0,0 +1,43 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Locale-profile types (per #6 §LocaleProfile). A `LocaleProfile` declares everything
+ *   locale-specific about classification: which weights package (if any) backs the neural
+ *   classifier, which rule classifier IDs are active, which `ComponentTag`s the locale actually
+ *   uses, and any per-component policy overrides.
+ *
+ *   The classifier IDs in `ruleClassifiers` are the stable `ProposalClassifier.id` values that
+ *   `wrapLegacyClassifier` assigns when the legacy classifier registry lands (see the Phase 0
+ *   task-3 follow-up in DECISIONS.md).
+ */
+import type { ComponentTag } from "@mailwoman/core/types";
+import type { ClassifierPolicy } from "../policy/policy.js";
+export interface LocaleProfile {
+    /** BCP-47 locale tag (e.g. `"en-US"`, `"fr-FR"`, `"ja-JP"`). */
+    locale: string;
+    /**
+     * Npm package providing ONNX weights and tokenizer for the neural classifier in this locale.
+     * Optional — Phase 0 ships no weights; a locale without a weights package runs rule-only.
+     */
+    weightsPackage?: string;
+    /**
+     * Rule classifier IDs active in this locale. Stable identifiers declared by
+     * `ProposalClassifier.id`. An empty list means the locale relies entirely on neural inference.
+     */
+    ruleClassifiers: string[];
+    /**
+     * Components this locale uses. Must be a subset of `COMPONENT_TAGS`. The system validates this at
+     * registration.
+     */
+    componentsSupported: ComponentTag[];
+    /** Per-component policy overrides for this locale. */
+    policy: ClassifierPolicy[];
+}
+export interface LocaleRegistry {
+    register(profile: LocaleProfile): void;
+    get(locale: string): LocaleProfile | undefined;
+    list(): LocaleProfile[];
+}
+//# sourceMappingURL=locale.d.ts.map

package/out/locale/locale.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"locale.d.ts","sourceRoot":"","sources":["../../locale/locale.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACzD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAA;AAE3D,MAAM,WAAW,aAAa;IAC7B,gEAAgE;IAChE,MAAM,EAAE,MAAM,CAAA;IAEd;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAA;IAEvB;;;OAGG;IACH,eAAe,EAAE,MAAM,EAAE,CAAA;IAEzB;;;OAGG;IACH,mBAAmB,EAAE,YAAY,EAAE,CAAA;IAEnC,sDAAsD;IACtD,MAAM,EAAE,gBAAgB,EAAE,CAAA;CAC1B;AAED,MAAM,WAAW,cAAc;IAC9B,QAAQ,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI,CAAA;IACtC,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,CAAA;IAC9C,IAAI,IAAI,aAAa,EAAE,CAAA;CACvB"}

package/out/locale/locale.js

@@ -0,0 +1,16 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   Locale-profile types (per #6 §LocaleProfile). A `LocaleProfile` declares everything
+ *   locale-specific about classification: which weights package (if any) backs the neural
+ *   classifier, which rule classifier IDs are active, which `ComponentTag`s the locale actually
+ *   uses, and any per-component policy overrides.
+ *
+ *   The classifier IDs in `ruleClassifiers` are the stable `ProposalClassifier.id` values that
+ *   `wrapLegacyClassifier` assigns when the legacy classifier registry lands (see the Phase 0
+ *   task-3 follow-up in DECISIONS.md).
+ */
+export {};
+//# sourceMappingURL=locale.js.map

package/out/locale/locale.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"locale.js","sourceRoot":"","sources":["../../locale/locale.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG"}

package/out/locale/profiles/en-us.d.ts

@@ -0,0 +1,12 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ *
+ *   En-US locale profile (per Phase 0 task 5). Lists the rule classifier IDs the legacy registry will
+ *   assign and the `ComponentTag`s the US locale actually uses. No `weightsPackage` is set in Phase
+ *   0 — neural weights ship in Phase 3.
+ */
+import type { LocaleProfile } from "../locale.js";
+export declare const enUS: LocaleProfile;
+//# sourceMappingURL=en-us.d.ts.map

package/out/locale/profiles/en-us.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"en-us.d.ts","sourceRoot":"","sources":["../../../locale/profiles/en-us.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAEjD,eAAO,MAAM,IAAI,EAAE,aAwDlB,CAAA"}