@mailwoman/core 2.0.0

package/out/solver/mask.js

@@ -0,0 +1,52 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { TokenContext } from "@mailwoman/core/tokenization";
+import { SolutionMatch } from "./SolutionMatch.js";
+/**
+ * Mapping of classification labels to mask codes.
+ */
+export const ClassificationMaskCodeMap = new Map([
+    ["venue", "V"],
+    ["house_number", "N"],
+    ["street", "S"],
+    ["postcode", "P"],
+    ["level", "L"],
+    ["level_designator", "L"],
+    ["unit", "U"],
+    ["unit_designator", "U"],
+    ["fallback", "A"],
+]);
+/**
+ * Mask which shows the areas covered by different types of classification
+ *
+ * - `N` housenumber
+ * - `S` street
+ * - `P` postcode
+ * - `A` administrative
+ * - `L` Level
+ * - `U` unit
+ *
+ * @returns Mask of the input for this solution
+ */
+export function createMask(context, matches) {
+    const { body } = context.span;
+    const mask = Array.from({ length: body.length }, () => " ");
+    // Scan the input letter-by-letter from left-to-right.
+    for (let i = 0; i < body.length; i++) {
+        // find which fields cover this character (should only be covered by 0 or 1 field)
+        const [firstMatch] = Iterator.from(matches).filter((pair) => pair.span.start <= i && pair.span.end >= i);
+        if (!firstMatch)
+            continue;
+        const code = ClassificationMaskCodeMap.get(firstMatch.classification) || ClassificationMaskCodeMap.get("fallback");
+        for (let j = firstMatch.span.start; j < firstMatch.span.end; j++) {
+            mask[j] = code;
+        }
+        // Skip forward to avoid scanning the same token again.
+        i = firstMatch.span.end;
+    }
+    return mask.join("");
+}
+//# sourceMappingURL=mask.js.map

package/out/solver/mask.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mask.js","sourceRoot":"","sources":["../../solver/mask.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAA;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAA;AAIlD;;GAEG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAwC;IACvF,CAAC,OAAO,EAAE,GAAG,CAAC;IACd,CAAC,cAAc,EAAE,GAAG,CAAC;IACrB,CAAC,QAAQ,EAAE,GAAG,CAAC;IACf,CAAC,UAAU,EAAE,GAAG,CAAC;IACjB,CAAC,OAAO,EAAE,GAAG,CAAC;IACd,CAAC,kBAAkB,EAAE,GAAG,CAAC;IACzB,CAAC,MAAM,EAAE,GAAG,CAAC;IACb,CAAC,iBAAiB,EAAE,GAAG,CAAC;IACxB,CAAC,UAAU,EAAE,GAAG,CAAC;CACjB,CAAC,CAAA;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CAAC,OAAqB,EAAE,OAAgC;IACjF,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,CAAA;IAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;IAE3D,sDAAsD;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,kFAAkF;QAClF,MAAM,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAExG,IAAI,CAAC,UAAU;YAAE,SAAQ;QAEzB,MAAM,IAAI,GAAG,yBAAyB,CAAC,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,IAAI,yBAAyB,CAAC,GAAG,CAAC,UAAU,CAAE,CAAA;QAEnH,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAClE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACf,CAAC;QAED,uDAAuD;QACvD,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAA;IACxB,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACrB,CAAC"}

package/out/solvers/ExclusiveCartesianSolver.d.ts

@@ -0,0 +1,12 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { HashMapSolver, Solution, TokenContext } from "@mailwoman/core";
+export declare class ExclusiveCartesianSolver extends HashMapSolver {
+    solve(context: TokenContext): void;
+    static exclusiveCartesian(...solutions: Solution[]): Solution[];
+}
+export default ExclusiveCartesianSolver;
+//# sourceMappingURL=ExclusiveCartesianSolver.d.ts.map

package/out/solvers/ExclusiveCartesianSolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExclusiveCartesianSolver.d.ts","sourceRoot":"","sources":["../../solvers/ExclusiveCartesianSolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AAIvE,qBAAa,wBAAyB,SAAQ,aAAa;IAC1D,KAAK,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI;IAWlC,MAAM,CAAC,kBAAkB,CAAC,GAAG,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE;CA8C/D;AAED,eAAe,wBAAwB,CAAA"}

package/out/solvers/ExclusiveCartesianSolver.js

@@ -0,0 +1,58 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { HashMapSolver, Solution, TokenContext } from "@mailwoman/core";
+const MAX_RECURSION = 10;
+const MAX_SOLUTIONS = 50000;
+export class ExclusiveCartesianSolver extends HashMapSolver {
+    solve(context) {
+        const map = this.generateHashMap(context, false, true);
+        const solutions = Array.from(map.values()).reverse();
+        const exclusiveSolutions = ExclusiveCartesianSolver.exclusiveCartesian(...solutions);
+        context.solutions = context.solutions.concat(exclusiveSolutions);
+    }
+    // compute the unique cartesian product
+    // (all permutations of non-overlapping tokens from different classifications)
+    static exclusiveCartesian(...solutions) {
+        let results = [];
+        const max = solutions.length - 1;
+        if (!solutions.length)
+            return results;
+        const explore = (currentSolution, solutionIndex) => {
+            const referencedSolution = solutions[solutionIndex];
+            for (let pairIndex = 0, l = referencedSolution.matches.length; pairIndex < l; pairIndex++) {
+                const copy = new Solution(Iterator.from(currentSolution.matches));
+                if (referencedSolution.matches[pairIndex]?.span.body.length) {
+                    copy.matches.push(referencedSolution.matches[pairIndex]);
+                }
+                if (solutionIndex === max) {
+                    if (copy.matches.length && results.length < MAX_SOLUTIONS) {
+                        results.push(copy);
+                    }
+                }
+                else if (solutionIndex < MAX_RECURSION) {
+                    explore(copy, solutionIndex + 1);
+                }
+            }
+        };
+        explore(new Solution(), 0);
+        // Reverse order, so that the most granular classifications are at the end.
+        results = results.reverse();
+        // Do not add a pair where the span intersects an existing pair
+        // i.e. we can't have two postal codes in the same solution.
+        results = results.filter((s) => {
+            return !s.matches.some((p1, i1) => {
+                return s.matches.some((p2, i2) => {
+                    if (i2 <= i1)
+                        return false;
+                    return p1.span.intersects(p2.span);
+                });
+            });
+        });
+        return results;
+    }
+}
+export default ExclusiveCartesianSolver;
+//# sourceMappingURL=ExclusiveCartesianSolver.js.map

package/out/solvers/ExclusiveCartesianSolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExclusiveCartesianSolver.js","sourceRoot":"","sources":["../../solvers/ExclusiveCartesianSolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AACvE,MAAM,aAAa,GAAG,EAAE,CAAA;AACxB,MAAM,aAAa,GAAG,KAAK,CAAA;AAE3B,MAAM,OAAO,wBAAyB,SAAQ,aAAa;IAC1D,KAAK,CAAC,OAAqB;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;QACtD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAA;QAEpD,MAAM,kBAAkB,GAAG,wBAAwB,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC,CAAA;QAEpF,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAA;IACjE,CAAC;IAED,uCAAuC;IACvC,8EAA8E;IAC9E,MAAM,CAAC,kBAAkB,CAAC,GAAG,SAAqB;QACjD,IAAI,OAAO,GAAe,EAAE,CAAA;QAE5B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;QAEhC,IAAI,CAAC,SAAS,CAAC,MAAM;YAAE,OAAO,OAAO,CAAA;QAErC,MAAM,OAAO,GAAG,CAAC,eAAyB,EAAE,aAAqB,EAAQ,EAAE;YAC1E,MAAM,kBAAkB,GAAG,SAAS,CAAC,aAAa,CAAE,CAAA;YAEpD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;gBAC3F,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAA;gBAEjE,IAAI,kBAAkB,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC7D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,SAAS,CAAE,CAAC,CAAA;gBAC1D,CAAC;gBAED,IAAI,aAAa,KAAK,GAAG,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,aAAa,EAAE,CAAC;wBAC3D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACnB,CAAC;gBACF,CAAC;qBAAM,IAAI,aAAa,GAAG,aAAa,EAAE,CAAC;oBAC1C,OAAO,CAAC,IAAI,EAAE,aAAa,GAAG,CAAC,CAAC,CAAA;gBACjC,CAAC;YACF,CAAC;QACF,CAAC,CAAA;QACD,OAAO,CAAC,IAAI,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAA;QAE1B,2EAA2E;QAC3E,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;QAE3B,+DAA+D;QAC/D,4DAA4D;QAE5D,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;gBACjC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;oBAChC,IAAI,EAAE,IAAI,EAAE;wBAAE,OAAO,KAAK,CAAA;oBAE1B,OAAO,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;gBACnC,CAAC,CAAC,CAAA;YACH,CAAC,CAAC,CAAA;QACH,CAAC,CAAC,CAAA;QAEF,OAAO,OAAO,CAAA;IACf,CAAC;CACD;AAED,eAAe,wBAAwB,CAAA"}

package/out/solvers/HouseNumberPositionPenalty.d.ts

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

package/out/solvers/HouseNumberPositionPenalty.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HouseNumberPositionPenalty.d.ts","sourceRoot":"","sources":["../../solvers/HouseNumberPositionPenalty.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAsB,KAAK,MAAM,EAAE,KAAK,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAkCrF,qBAAa,0BAA2B,YAAW,MAAM;IACxD,KAAK,CAAC,EAAE,SAAS,EAAE,EAAE,aAAa,GAAG,IAAI;CA6BzC"}

package/out/solvers/HouseNumberPositionPenalty.js

@@ -0,0 +1,63 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { Alpha2LanguageCode } from "@mailwoman/core";
+const basePenalty = 0.05;
+const numberLastLangs = new Map([
+    [Alpha2LanguageCode.German, basePenalty],
+    [Alpha2LanguageCode.Slovenian, basePenalty],
+    [Alpha2LanguageCode.Polish, basePenalty],
+    [Alpha2LanguageCode.Bosnian, basePenalty],
+    [Alpha2LanguageCode.Croatian, basePenalty],
+    [Alpha2LanguageCode.Dutch, basePenalty],
+    [Alpha2LanguageCode.Czech, basePenalty],
+    [Alpha2LanguageCode.Danish, basePenalty],
+    // Guatemala & Honduras do not flip their house numbers
+    [Alpha2LanguageCode.Spanish, basePenalty / 2],
+    [Alpha2LanguageCode.Finnish, basePenalty],
+    [Alpha2LanguageCode.GreekModern_1453, basePenalty],
+    [Alpha2LanguageCode.Icelandic, basePenalty],
+    [Alpha2LanguageCode.Italian, basePenalty],
+    [Alpha2LanguageCode.NorwegianBokmål, basePenalty],
+    [Alpha2LanguageCode.Portuguese, basePenalty],
+    [Alpha2LanguageCode.Swedish, basePenalty],
+    [Alpha2LanguageCode.Slovak, basePenalty],
+    [Alpha2LanguageCode.Turkish, basePenalty],
+    [Alpha2LanguageCode.Romanian, basePenalty],
+    [Alpha2LanguageCode.Hungarian, basePenalty],
+]);
+const numberFirstLangs = new Map([
+    [Alpha2LanguageCode.English, basePenalty],
+    // Switzerland and Andorre has some French streets.
+    [Alpha2LanguageCode.French, basePenalty / 2],
+]);
+export class HouseNumberPositionPenalty {
+    solve({ solutions }) {
+        for (const solution of solutions) {
+            const houseNumber = solution.find("house_number");
+            const street = solution.find("street");
+            if (!houseNumber || !street || !street.languages) {
+                continue;
+            }
+            const { languages } = street;
+            // For now, we don't supports multi-lang entries.
+            if (languages.size !== 1)
+                continue;
+            const [lang] = languages;
+            if (!lang || lang === "all")
+                return;
+            const numberLastLangMatch = numberLastLangs.get(lang);
+            const numberFirstMatch = numberFirstLangs.get(lang);
+            // Check if the number should be in last position (after street) or first position (before street).
+            if (typeof numberLastLangMatch === "number" && houseNumber.span.start < street.span.start) {
+                solution.penalty += numberLastLangMatch;
+            }
+            else if (typeof numberFirstMatch === "number" && street.span.start < houseNumber.span.start) {
+                solution.penalty += numberFirstMatch;
+            }
+        }
+    }
+}
+//# sourceMappingURL=HouseNumberPositionPenalty.js.map

package/out/solvers/HouseNumberPositionPenalty.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HouseNumberPositionPenalty.js","sourceRoot":"","sources":["../../solvers/HouseNumberPositionPenalty.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,kBAAkB,EAAmC,MAAM,iBAAiB,CAAA;AAErF,MAAM,WAAW,GAAG,IAAI,CAAA;AAExB,MAAM,eAAe,GAAG,IAAI,GAAG,CAAiB;IAC/C,CAAC,kBAAkB,CAAC,MAAM,EAAE,WAAW,CAAC;IACxC,CAAC,kBAAkB,CAAC,SAAS,EAAE,WAAW,CAAC;IAC3C,CAAC,kBAAkB,CAAC,MAAM,EAAE,WAAW,CAAC;IACxC,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC;IACzC,CAAC,kBAAkB,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC1C,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,CAAC;IACvC,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,CAAC;IACvC,CAAC,kBAAkB,CAAC,MAAM,EAAE,WAAW,CAAC;IACxC,uDAAuD;IACvD,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,GAAG,CAAC,CAAC;IAC7C,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC;IACzC,CAAC,kBAAkB,CAAC,gBAAgB,EAAE,WAAW,CAAC;IAClD,CAAC,kBAAkB,CAAC,SAAS,EAAE,WAAW,CAAC;IAC3C,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC;IACzC,CAAC,kBAAkB,CAAC,eAAe,EAAE,WAAW,CAAC;IACjD,CAAC,kBAAkB,CAAC,UAAU,EAAE,WAAW,CAAC;IAC5C,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC;IACzC,CAAC,kBAAkB,CAAC,MAAM,EAAE,WAAW,CAAC;IACxC,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC;IACzC,CAAC,kBAAkB,CAAC,QAAQ,EAAE,WAAW,CAAC;IAC1C,CAAC,kBAAkB,CAAC,SAAS,EAAE,WAAW,CAAC;CAC3C,CAAC,CAAA;AAEF,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAiB;IAChD,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC;IACzC,mDAAmD;IACnD,CAAC,kBAAkB,CAAC,MAAM,EAAE,WAAW,GAAG,CAAC,CAAC;CAC5C,CAAC,CAAA;AAEF,MAAM,OAAO,0BAA0B;IACtC,KAAK,CAAC,EAAE,SAAS,EAAiB;QACjC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;YACjD,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAEtC,IAAI,CAAC,WAAW,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;gBAClD,SAAQ;YACT,CAAC;YAED,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CAAA;YAE5B,iDAAiD;YACjD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;gBAAE,SAAQ;YAElC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAA;YAExB,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,KAAK;gBAAE,OAAM;YAEnC,MAAM,mBAAmB,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACrD,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAEnD,mGAAmG;YACnG,IAAI,OAAO,mBAAmB,KAAK,QAAQ,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC3F,QAAQ,CAAC,OAAO,IAAI,mBAAmB,CAAA;YACxC,CAAC;iBAAM,IAAI,OAAO,gBAAgB,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC/F,QAAQ,CAAC,OAAO,IAAI,gBAAgB,CAAA;YACrC,CAAC;QACF,CAAC;IACF,CAAC;CACD"}

package/out/solvers/LeadingAreaDeclassifier.d.ts

@@ -0,0 +1,13 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Solver, SolverContext } from "@mailwoman/core";
+/**
+ * This solver removes leading area classifications that are not the last non-admin classification.
+ */
+export declare class LeadingAreaDeclassifier implements Solver {
+    solve(context: SolverContext): void;
+}
+//# sourceMappingURL=LeadingAreaDeclassifier.d.ts.map

package/out/solvers/LeadingAreaDeclassifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LeadingAreaDeclassifier.d.ts","sourceRoot":"","sources":["../../solvers/LeadingAreaDeclassifier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAkB,MAAM,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAO5E;;GAEG;AACH,qBAAa,uBAAwB,YAAW,MAAM;IACrD,KAAK,CAAC,OAAO,EAAE,aAAa;CAuB5B"}

package/out/solvers/LeadingAreaDeclassifier.js

@@ -0,0 +1,35 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+const LeadingArea = {
+    Admin: new Set(["locality", "region", "country"]),
+    Netural: new Set(["postcode"]),
+};
+/**
+ * This solver removes leading area classifications that are not the last non-admin classification.
+ */
+export class LeadingAreaDeclassifier {
+    solve(context) {
+        for (const solution of context.solutions) {
+            // Track the last non-admin cursor position.
+            let lastNonAdminCursorPosition = 0;
+            for (const { classification, span } of solution.matches) {
+                if (LeadingArea.Admin.has(classification))
+                    continue;
+                if (LeadingArea.Netural.has(classification))
+                    continue;
+                lastNonAdminCursorPosition = span.end;
+            }
+            solution.matches = solution.matches.filter(({ classification, span }) => {
+                const isAdmin = LeadingArea.Admin.has(classification);
+                // if (isAdmin && pair.span.end < lastNonAdminCursorPosition) return false
+                return !(isAdmin && span.end < lastNonAdminCursorPosition);
+            });
+        }
+        context.solutions.sort((a, b) => b.score - a.score);
+        context.solutions.forEach((s) => s.matches.sort((a, b) => a.span.start - b.span.start));
+    }
+}
+//# sourceMappingURL=LeadingAreaDeclassifier.js.map

package/out/solvers/LeadingAreaDeclassifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LeadingAreaDeclassifier.js","sourceRoot":"","sources":["../../solvers/LeadingAreaDeclassifier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,WAAW,GAAG;IACnB,KAAK,EAAE,IAAI,GAAG,CAAiB,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IACjE,OAAO,EAAE,IAAI,GAAG,CAAiB,CAAC,UAAU,CAAC,CAAC;CACiB,CAAA;AAEhE;;GAEG;AACH,MAAM,OAAO,uBAAuB;IACnC,KAAK,CAAC,OAAsB;QAC3B,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;YAC1C,4CAA4C;YAC5C,IAAI,0BAA0B,GAAG,CAAC,CAAA;YAElC,KAAK,MAAM,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACzD,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC;oBAAE,SAAQ;gBACnD,IAAI,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC;oBAAE,SAAQ;gBAErD,0BAA0B,GAAG,IAAI,CAAC,GAAG,CAAA;YACtC,CAAC;YAED,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,EAAE,EAAE;gBACvE,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;gBAErD,0EAA0E;gBAC1E,OAAO,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,GAAG,0BAA0B,CAAC,CAAA;YAC3D,CAAC,CAAC,CAAA;QACH,CAAC;QAED,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QACnD,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IACxF,CAAC;CACD"}

package/out/solvers/MultiStreetSolver.d.ts

@@ -0,0 +1,32 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { HashMapSolver, TokenContext } from "@mailwoman/core";
+/**
+ * If a 'multistreet' classification was detected then add a new solution which covers all streets
+ * included.
+ *
+ * The ExclusiveCartesianSolver ensures that each public classification can exist only once per
+ * solution (ie. we can't have two postalcodes).
+ *
+ * Intersections are the only exception to this rule, so rather than modifying the
+ * ExclusiveCartesianSolver we use this solver to create the missing intersection solutions (those
+ * with 2x 'street' labels).
+ *
+ * One of the challenges is that there could be many different interpretations of the admin tokens,
+ * so we need to ensure that each of those permutations is also represented by a distinct
+ * intersection solution.
+ *
+ * The solver works by iterating over existing solutions looking for any which identified a street,
+ * it then clones that solution, removes any tokens less granular than street and attempts to add
+ * the new street token in its place.
+ *
+ * Care is taken to ensure that the resulting solution does not contain tokens in overlapping
+ * positions.
+ */
+export declare class MultiStreetSolver extends HashMapSolver {
+    solve(context: TokenContext): void;
+}
+//# sourceMappingURL=MultiStreetSolver.d.ts.map

package/out/solvers/MultiStreetSolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MultiStreetSolver.d.ts","sourceRoot":"","sources":["../../solvers/MultiStreetSolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAuB,aAAa,EAAY,YAAY,EAAE,MAAM,iBAAiB,CAAA;AAa5F;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,iBAAkB,SAAQ,aAAa;IACnD,KAAK,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI;CAoElC"}

package/out/solvers/MultiStreetSolver.js

@@ -0,0 +1,110 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import { HashMapSolver, Solution, TokenContext } from "@mailwoman/core";
+// classifications which are more granular than StreetClassification
+// should not be included in intersection solutions.
+const MORE_GRANULAR_THAN_STREET = new Set([
+    "house_number",
+    "level",
+    "level_designator",
+    "unit",
+    "unit_designator",
+    "venue",
+]);
+/**
+ * If a 'multistreet' classification was detected then add a new solution which covers all streets
+ * included.
+ *
+ * The ExclusiveCartesianSolver ensures that each public classification can exist only once per
+ * solution (ie. we can't have two postalcodes).
+ *
+ * Intersections are the only exception to this rule, so rather than modifying the
+ * ExclusiveCartesianSolver we use this solver to create the missing intersection solutions (those
+ * with 2x 'street' labels).
+ *
+ * One of the challenges is that there could be many different interpretations of the admin tokens,
+ * so we need to ensure that each of those permutations is also represented by a distinct
+ * intersection solution.
+ *
+ * The solver works by iterating over existing solutions looking for any which identified a street,
+ * it then clones that solution, removes any tokens less granular than street and attempts to add
+ * the new street token in its place.
+ *
+ * Care is taken to ensure that the resulting solution does not contain tokens in overlapping
+ * positions.
+ */
+export class MultiStreetSolver extends HashMapSolver {
+    solve(context) {
+        const classificationSolutionMap = this.generateHashMap(context, true);
+        const multistreet = classificationSolutionMap.get("multistreet");
+        const street = classificationSolutionMap.get("street");
+        if (!multistreet || multistreet.matches.length < 1)
+            return;
+        if (!street || street.matches.length < 2)
+            return;
+        // only currently consider one multistreet parse (for simplicity)
+        // @todo: there may be some rare cases where we detect more than one?
+        const [multi] = multistreet.matches;
+        if (!multi)
+            return;
+        // generate a list of streets which intersect the multistreet
+        const streets = street.matches.filter(({ span }) => span.intersects(multi.span));
+        if (streets.length < 2)
+            return;
+        // generate a list of candidate solutions which could potentially be
+        // cloned to generate new intersection solutions
+        let candidates = context.solutions.filter((solution) => {
+            return solution.matches.some(({ span, classification }) => {
+                return classification === "street" && span.intersects(multi.span);
+            });
+        });
+        // truncate the candidates by making a copy of the current solution and removing all solution
+        // matches which came before the street and also any matches less granular than street
+        // (such as venue, housenumber etc.)
+        candidates = candidates.map((solution) => {
+            // find the street solution pair (there should be exactly one)
+            const candidateStreet = solution.find("street");
+            // Remove some pairs from the solution.
+            const truncated = solution.matches.filter(({ start, classification }) => {
+                return start >= candidateStreet.span.start && !MORE_GRANULAR_THAN_STREET.has(classification);
+            });
+            return new Solution(truncated);
+        });
+        // the truncation step above can generate duplicate solutions so a 'content hash'
+        // is generated in order to deduplicate them.
+        // note: this is purely a performance optimization as it generates fewer candidates
+        candidates = uniqBy(candidates, (truncated) => {
+            return truncated.matches.map(({ span, classification }) => `${classification}:${span.normalized}`).join("_");
+        });
+        // iterate over candidates and generate new intersection solutions
+        const intersectionSolutions = candidates.flatMap((truncated) => {
+            // find all street classsifications which intersect the 'multistreet' span
+            // and also do not overlap an existing pair in this solution.
+            return streets
+                .filter((candidateStreet) => {
+                return truncated.matches.every(({ span }) => !span.intersects(candidateStreet.span));
+            })
+                .flatMap((candidateStreet) => {
+                // Copy of the truncated solution and add the additional street.
+                return new Solution([...truncated.matches, candidateStreet]);
+            });
+        });
+        context.solutions = [...context.solutions, ...intersectionSolutions];
+    }
+}
+function uniqBy(arr, predicate) {
+    const pickedObjects = arr
+        .filter(Boolean)
+        .reduce((map, item) => {
+        const key = predicate(item);
+        if (!key)
+            return map;
+        return map.has(key) ? map : map.set(key, item);
+    }, new Map())
+        .values();
+    return Array.from(pickedObjects);
+}
+//# sourceMappingURL=MultiStreetSolver.js.map

package/out/solvers/MultiStreetSolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MultiStreetSolver.js","sourceRoot":"","sources":["../../solvers/MultiStreetSolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAuB,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AAE5F,oEAAoE;AACpE,oDAAoD;AACpD,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAiB;IACzD,cAAc;IACd,OAAO;IACP,kBAAkB;IAClB,MAAM;IACN,iBAAiB;IACjB,OAAO;CACP,CAAC,CAAA;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,iBAAkB,SAAQ,aAAa;IACnD,KAAK,CAAC,OAAqB;QAC1B,MAAM,yBAAyB,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;QACrE,MAAM,WAAW,GAAG,yBAAyB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAA;QAChE,MAAM,MAAM,GAAG,yBAAyB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QAEtD,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAE1D,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEhD,iEAAiE;QACjE,qEAAqE;QACrE,MAAM,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,OAAO,CAAA;QAEnC,IAAI,CAAC,KAAK;YAAE,OAAM;QAElB,6DAA6D;QAC7D,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;QAEhF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAE9B,oEAAoE;QACpE,gDAAgD;QAChD,IAAI,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YACtD,OAAO,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE;gBACzD,OAAO,cAAc,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAClE,CAAC,CAAC,CAAA;QACH,CAAC,CAAC,CAAA;QAEF,6FAA6F;QAC7F,sFAAsF;QACtF,oCAAoC;QACpC,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;YACxC,8DAA8D;YAC9D,MAAM,eAAe,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAA;YAEhD,uCAAuC;YACvC,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE;gBACvE,OAAO,KAAK,IAAI,eAAe,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;YAC7F,CAAC,CAAC,CAAA;YAEF,OAAO,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAA;QAC/B,CAAC,CAAC,CAAA;QAEF,iFAAiF;QACjF,6CAA6C;QAC7C,mFAAmF;QAEnF,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC,SAAS,EAAE,EAAE;YAC7C,OAAO,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,GAAG,cAAc,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC7G,CAAC,CAAC,CAAA;QAEF,kEAAkE;QAClE,MAAM,qBAAqB,GAAe,UAAU,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;YAC1E,0EAA0E;YAC1E,6DAA6D;YAC7D,OAAO,OAAO;iBACZ,MAAM,CAAC,CAAC,eAAe,EAAE,EAAE;gBAC3B,OAAO,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAA;YACrF,CAAC,CAAC;iBACD,OAAO,CAAC,CAAC,eAAe,EAAE,EAAE;gBAC5B,gEAAgE;gBAEhE,OAAO,IAAI,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAA;YAC7D,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC,CAAA;QAEF,OAAO,CAAC,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,GAAG,qBAAqB,CAAC,CAAA;IACrE,CAAC;CACD;AAED,SAAS,MAAM,CAAI,GAAQ,EAAE,SAA4B;IACxD,MAAM,aAAa,GAAG,GAAG;SACvB,MAAM,CAAC,OAAO,CAAC;SACf,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QACrB,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;QAE3B,IAAI,CAAC,GAAG;YAAE,OAAO,GAAG,CAAA;QAEpB,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IAC/C,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC;SACZ,MAAM,EAAE,CAAA;IAEV,OAAO,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;AACjC,CAAC"}

package/out/solvers/OrphanedLevelTypeDeclassifier.d.ts

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

package/out/solvers/OrphanedLevelTypeDeclassifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrphanedLevelTypeDeclassifier.d.ts","sourceRoot":"","sources":["../../solvers/OrphanedLevelTypeDeclassifier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAEpD,qBAAa,6BAA6B;IACzC,KAAK,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;CAiBnC"}

package/out/solvers/OrphanedLevelTypeDeclassifier.js

@@ -0,0 +1,21 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export class OrphanedLevelTypeDeclassifier {
+    solve(context) {
+        context.solutions = context.solutions.filter((solution) => {
+            const levelType = solution.filter("level_designator");
+            if (levelType.length === 0)
+                return true;
+            const level = solution.filter("level");
+            if (level.length === 0) {
+                solution.matches = solution.findWithout("level_designator");
+                return solution.matches.length > 0;
+            }
+            return true;
+        });
+    }
+}
+//# sourceMappingURL=OrphanedLevelTypeDeclassifier.js.map

package/out/solvers/OrphanedLevelTypeDeclassifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrphanedLevelTypeDeclassifier.js","sourceRoot":"","sources":["../../solvers/OrphanedLevelTypeDeclassifier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,OAAO,6BAA6B;IACzC,KAAK,CAAC,OAAsB;QAC3B,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YACzD,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAA;YAErD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAA;YAEvC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;YAEtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAA;gBAE3D,OAAO,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YACnC,CAAC;YAED,OAAO,IAAI,CAAA;QACZ,CAAC,CAAC,CAAA;IACH,CAAC;CACD"}

package/out/solvers/OrphanedUnitTypeDeclassifier.d.ts

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

package/out/solvers/OrphanedUnitTypeDeclassifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrphanedUnitTypeDeclassifier.d.ts","sourceRoot":"","sources":["../../solvers/OrphanedUnitTypeDeclassifier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAEpD,qBAAa,4BAA4B;IACxC,KAAK,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;CAiBnC"}

package/out/solvers/OrphanedUnitTypeDeclassifier.js

@@ -0,0 +1,21 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+export class OrphanedUnitTypeDeclassifier {
+    solve(context) {
+        context.solutions = context.solutions.filter((solution) => {
+            const unitType = solution.filter("unit_designator");
+            if (unitType.length === 0)
+                return true;
+            const unit = solution.filter("unit");
+            if (unit.length === 0) {
+                solution.matches = solution.findWithout("unit_designator");
+                return solution.matches.length > 0;
+            }
+            return true;
+        });
+    }
+}
+//# sourceMappingURL=OrphanedUnitTypeDeclassifier.js.map

package/out/solvers/OrphanedUnitTypeDeclassifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrphanedUnitTypeDeclassifier.js","sourceRoot":"","sources":["../../solvers/OrphanedUnitTypeDeclassifier.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,OAAO,4BAA4B;IACxC,KAAK,CAAC,OAAsB;QAC3B,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE;YACzD,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAA;YAEnD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAA;YAEtC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAEpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAA;gBAE1D,OAAO,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YACnC,CAAC;YAED,OAAO,IAAI,CAAA;QACZ,CAAC,CAAC,CAAA;IACH,CAAC;CACD"}

package/out/solvers/PostcodePositionPenalty.d.ts

@@ -0,0 +1,16 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Solver, SolverContext } from "@mailwoman/core";
+/**
+ * Applies a penalty to solutions where the postcode may have recieved a high score with an uncommon
+ * position in the address.
+ *
+ * E.g. rua godinho de faria 1200
+ */
+export declare class PostcodePositionPenalty implements Solver {
+    solve({ solutions }: SolverContext): void;
+}
+//# sourceMappingURL=PostcodePositionPenalty.d.ts.map

package/out/solvers/PostcodePositionPenalty.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PostcodePositionPenalty.d.ts","sourceRoot":"","sources":["../../solvers/PostcodePositionPenalty.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAI5D;;;;;GAKG;AACH,qBAAa,uBAAwB,YAAW,MAAM;IACrD,KAAK,CAAC,EAAE,SAAS,EAAE,EAAE,aAAa,GAAG,IAAI;CAmBzC"}

package/out/solvers/PostcodePositionPenalty.js

@@ -0,0 +1,33 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+const basePenalty = 0.1;
+/**
+ * Applies a penalty to solutions where the postcode may have recieved a high score with an uncommon
+ * position in the address.
+ *
+ * E.g. rua godinho de faria 1200
+ */
+export class PostcodePositionPenalty {
+    solve({ solutions }) {
+        for (const solution of solutions) {
+            // Do nothing if the solution doesn't have a postcode classification
+            const postcode = solution.find("postcode");
+            if (!postcode)
+                continue;
+            // Do nothing if the solution has a housenumber classification
+            const housenumber = solution.find("house_number");
+            if (housenumber)
+                continue;
+            // Do nothing for solutions with either none or 2+ street classifications (intersections)
+            const streetCount = solution.filter("street").length;
+            if (streetCount === 0 || streetCount >= 2)
+                continue;
+            // apply a small penalty
+            solution.penalty += basePenalty;
+        }
+    }
+}
+//# sourceMappingURL=PostcodePositionPenalty.js.map

package/out/solvers/PostcodePositionPenalty.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PostcodePositionPenalty.js","sourceRoot":"","sources":["../../solvers/PostcodePositionPenalty.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,WAAW,GAAG,GAAG,CAAA;AAEvB;;;;;GAKG;AACH,MAAM,OAAO,uBAAuB;IACnC,KAAK,CAAC,EAAE,SAAS,EAAiB;QACjC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YAClC,oEAAoE;YACpE,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YAC1C,IAAI,CAAC,QAAQ;gBAAE,SAAQ;YAEvB,8DAA8D;YAC9D,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;YACjD,IAAI,WAAW;gBAAE,SAAQ;YAEzB,yFAAyF;YACzF,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAA;YAEpD,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,IAAI,CAAC;gBAAE,SAAQ;YAEnD,wBAAwB;YACxB,QAAQ,CAAC,OAAO,IAAI,WAAW,CAAA;QAChC,CAAC;IACF,CAAC;CACD"}

package/out/solvers/VenueCaptureSolver.d.ts

@@ -0,0 +1,13 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+import type { Solver, SolverContext } from "@mailwoman/core";
+/**
+ * This solver extends solutions with venues to ensure that they are no spans are left behind.
+ */
+export declare class VenueCaptureSolver implements Solver {
+    solve(context: SolverContext): void;
+}
+//# sourceMappingURL=VenueCaptureSolver.d.ts.map

package/out/solvers/VenueCaptureSolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"VenueCaptureSolver.d.ts","sourceRoot":"","sources":["../../solvers/VenueCaptureSolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAE5D;;GAEG;AACH,qBAAa,kBAAmB,YAAW,MAAM;IAChD,KAAK,CAAC,OAAO,EAAE,aAAa;CAW5B"}

package/out/solvers/VenueCaptureSolver.js

@@ -0,0 +1,22 @@
+/**
+ * @copyright Sister Software
+ * @license AGPL-3.0
+ * @author Teffen Ellis, et al.
+ */
+/**
+ * This solver extends solutions with venues to ensure that they are no spans are left behind.
+ */
+export class VenueCaptureSolver {
+    solve(context) {
+        for (const solution of context.solutions) {
+            const matches = solution.filter("venue");
+            if (matches.length === 0)
+                continue;
+            for (const match of matches) {
+                if (match.start === 0)
+                    continue;
+            }
+        }
+    }
+}
+//# sourceMappingURL=VenueCaptureSolver.js.map

package/out/solvers/VenueCaptureSolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VenueCaptureSolver.js","sourceRoot":"","sources":["../../solvers/VenueCaptureSolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAC9B,KAAK,CAAC,OAAsB;QAC3B,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;YAExC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAQ;YAElC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC;oBAAE,SAAQ;YAChC,CAAC;QACF,CAAC;IACF,CAAC;CACD"}