puzlink 0.1.0

package/dist/lib/letterDistribution.js

@@ -0,0 +1,230 @@
+var __runInitializers = (this && this.__runInitializers) || function (thisArg, initializers, value) {
+    var useValue = arguments.length > 2;
+    for (var i = 0; i < initializers.length; i++) {
+        value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+    }
+    return useValue ? value : void 0;
+};
+var __esDecorate = (this && this.__esDecorate) || function (ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+    function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+    var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+    var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+    var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+    var _, done = false;
+    for (var i = decorators.length - 1; i >= 0; i--) {
+        var context = {};
+        for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+        for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+        context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+        var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+        if (kind === "accessor") {
+            if (result === void 0) continue;
+            if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+            if (_ = accept(result.get)) descriptor.get = _;
+            if (_ = accept(result.set)) descriptor.set = _;
+            if (_ = accept(result.init)) initializers.unshift(_);
+        }
+        else if (_ = accept(result)) {
+            if (kind === "field") initializers.unshift(_);
+            else descriptor[key] = _;
+        }
+    }
+    if (target) Object.defineProperty(target, contextIn.name, descriptor);
+    done = true;
+};
+import { Distribution } from "./distribution.js";
+import { LogCounter } from "./logCounter.js";
+import { LogNum } from "./logNum.js";
+import { memoize } from "./memoize.js";
+import { caesar, interval } from "./util.js";
+export const LETTERS = "abcdefghijklmnopqrstuvwxyz";
+export const VOWELS = "aeiou";
+export const CONSONANTS = "bcdfghjklmnpqrstvwxyz";
+/**
+ * Info about the letter distribution of a wordlist.
+ *
+ * All of these methods rely on letters being drawn iid. This is the case for
+ * letters that come from random indexing. This is *not* the case for things
+ * like random substrings.
+ */
+let LetterDistribution = (() => {
+    let _instanceExtraInitializers = [];
+    let _probConsecutive_decorators;
+    let _probDistinct_decorators;
+    let _probVowels_decorators;
+    let _probConsonants_decorators;
+    return class LetterDistribution {
+        static {
+            const _metadata = typeof Symbol === "function" && Symbol.metadata ? Object.create(null) : void 0;
+            _probConsecutive_decorators = [memoize()];
+            _probDistinct_decorators = [memoize(2)];
+            _probVowels_decorators = [memoize()];
+            _probConsonants_decorators = [memoize()];
+            __esDecorate(this, null, _probConsecutive_decorators, { kind: "method", name: "probConsecutive", static: false, private: false, access: { has: obj => "probConsecutive" in obj, get: obj => obj.probConsecutive }, metadata: _metadata }, null, _instanceExtraInitializers);
+            __esDecorate(this, null, _probDistinct_decorators, { kind: "method", name: "probDistinct", static: false, private: false, access: { has: obj => "probDistinct" in obj, get: obj => obj.probDistinct }, metadata: _metadata }, null, _instanceExtraInitializers);
+            __esDecorate(this, null, _probVowels_decorators, { kind: "method", name: "probVowels", static: false, private: false, access: { has: obj => "probVowels" in obj, get: obj => obj.probVowels }, metadata: _metadata }, null, _instanceExtraInitializers);
+            __esDecorate(this, null, _probConsonants_decorators, { kind: "method", name: "probConsonants", static: false, private: false, access: { has: obj => "probConsonants" in obj, get: obj => obj.probConsonants }, metadata: _metadata }, null, _instanceExtraInitializers);
+            if (_metadata) Object.defineProperty(this, Symbol.metadata, { enumerable: true, configurable: true, writable: true, value: _metadata });
+        }
+        distribution = __runInitializers(this, _instanceExtraInitializers);
+        lengthToProbs;
+        constructor(wordlist) {
+            const letterCount = new Map();
+            let total = 0;
+            for (const word of wordlist) {
+                for (const letter of word) {
+                    letterCount.set(letter, (letterCount.get(letter) ?? 0) + 1);
+                    total++;
+                }
+            }
+            this.distribution = new Distribution(new Map(Array.from(letterCount.entries(), ([letter, count]) => [
+                letter,
+                LogNum.fromFraction(count, total),
+            ])));
+            this.lengthToProbs = new Map();
+            for (const word of wordlist) {
+                const prob = LogNum.prod(Array.from(word, (letter) => this.distribution.get(letter)));
+                const counts = new Map();
+                for (const letter of word) {
+                    counts.set(letter, (counts.get(letter) ?? 0) + 1);
+                }
+                const perms = LogNum.fromFactorial(word.length).div(LogNum.prod(Array.from(counts.values(), (count) => LogNum.fromFactorial(count))));
+                if (!this.lengthToProbs.has(word.length)) {
+                    this.lengthToProbs.set(word.length, {
+                        word: LogNum.from(0),
+                        anagram: LogNum.from(0),
+                    });
+                }
+                this.lengthToProbs.get(word.length).word = this.lengthToProbs
+                    .get(word.length)
+                    .word.add(prob);
+                this.lengthToProbs.get(word.length).anagram = this.lengthToProbs
+                    .get(word.length)
+                    .anagram.add(prob.mul(perms));
+            }
+        }
+        /**
+         * Log probability that a list of letters is iid drawn from this distribution,
+         * via chi-squared.
+         */
+        probUnordered(letters) {
+            const counter = LogCounter.from(letters);
+            return this.distribution.probUnordered(counter);
+        }
+        /** Over- and under-represented letters, at 2 sigma. */
+        outliers(letters) {
+            const counter = LogCounter.from(letters);
+            const { high, low } = this.distribution.outliers(counter);
+            return { high: Object.keys(high), low: Object.keys(low) };
+        }
+        /**
+         * Log probability that words of given lengths share common letters, in the
+         * same order.
+         */
+        probCommonOrdered(common, lengths) {
+            if (common === 0) {
+                return LogNum.from(1);
+            }
+            const combos = LogNum.prod(interval(0, common - 1).flatMap((k) => lengths.map((length) => LogNum.fromFraction(length - k, k + 1))));
+            const p = this.distribution.moment(lengths.length).pow(common);
+            return LogNum.from(1).sub(LogNum.fromExp(-p.toNum() * combos.toNum()));
+        }
+        /** Log probability that k letters are all equal. */
+        probEqual(k) {
+            return this.distribution.probEqual(k);
+        }
+        /** Log probability that k letters are all equal, except for one. */
+        probAlmostEqual(k) {
+            return this.distribution.probAlmostEqual(k);
+        }
+        /** Log probability that k letters have exactly two values. */
+        probTwoDistinct(k) {
+            return this.distribution.probTwoDistinct(k);
+        }
+        /** Log probability that k letters are consecutive. */
+        probConsecutive(k) {
+            if (k <= 1) {
+                return LogNum.from(1);
+            }
+            else if (k > LETTERS.length) {
+                return LogNum.from(0);
+            }
+            const freqWindow = [];
+            for (const i of interval(1, k)) {
+                freqWindow.push(this.distribution.get(LETTERS[i]));
+            }
+            const partials = [];
+            for (let a = 1; a + k - 1 <= LETTERS.length; a++) {
+                partials.push(LogNum.prod(freqWindow));
+                freqWindow.shift();
+                freqWindow.push(this.distribution.get(LETTERS[a + k]));
+            }
+            return LogNum.fromFactorial(k).mul(LogNum.sum(partials));
+        }
+        /**
+         * Log probability that k letters have distinct values, all at least min.
+         */
+        probDistinct(k, min = "a") {
+            if (k <= 0) {
+                return LogNum.from(1);
+            }
+            else if (min > "z") {
+                return LogNum.from(0);
+            }
+            const probs = [];
+            for (const [letter, freq] of this.distribution.entries()) {
+                if (letter < min) {
+                    continue;
+                }
+                probs.push(freq.mul(this.probDistinct(k - 1, caesar(letter, 1))));
+            }
+            return probs.length === 0
+                ? LogNum.from(0)
+                : LogNum.from(k).mul(LogNum.sum(probs));
+        }
+        /** Log probability that k letters can be grouped in equal pairs. */
+        probPaired(k) {
+            if (k % 2 !== 0) {
+                return LogNum.from(0);
+            }
+            return this.probDistinct(Math.floor(k / 2));
+        }
+        /** Log probability that k letters form a word. */
+        probWord(k) {
+            return this.lengthToProbs.get(k)?.word ?? LogNum.from(0);
+        }
+        /** Log probability that k letters form an anagram of a word. */
+        probAnagram(k) {
+            return this.lengthToProbs.get(k)?.anagram ?? LogNum.from(0);
+        }
+        /** Log probability that k letters are all vowels. */
+        probVowels(k) {
+            if (k === 0) {
+                return LogNum.from(1);
+            }
+            if (k === 1) {
+                return LogNum.sum(Array.from(VOWELS, (vowel) => this.distribution.get(vowel)));
+            }
+            return this.probVowels(1).pow(k);
+        }
+        /** Log probability that k letters are all consonants. */
+        probConsonants(k) {
+            if (k === 0) {
+                return LogNum.from(1);
+            }
+            if (k === 1) {
+                return LogNum.sum(Array.from(CONSONANTS, (consonant) => this.distribution.get(consonant)));
+            }
+            return this.probConsonants(1).pow(k);
+        }
+        /**
+         * Log probability that n words, each of length k, have the same pattern of
+         * vowels and consonants.
+         */
+        probEqualVowelPattern(n, k) {
+            return this.probVowels(k).add(this.probConsonants(k)).pow(n);
+        }
+    };
+})();
+export { LetterDistribution };
+//# sourceMappingURL=letterDistribution.js.map

package/dist/lib/letterDistribution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"letterDistribution.js","sourceRoot":"","sources":["../../src/lib/letterDistribution.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,CAAC,MAAM,OAAO,GAAG,4BAA4B,CAAC;AACpD,MAAM,CAAC,MAAM,MAAM,GAAG,OAAO,CAAC;AAC9B,MAAM,CAAC,MAAM,UAAU,GAAG,uBAAuB,CAAC;AAElD;;;;;;GAMG;IACU,kBAAkB;;;;;;iBAAlB,kBAAkB;;;2CAsH5B,OAAO,EAAE;wCA0BT,OAAO,CAAC,CAAC,CAAC;sCAwCV,OAAO,EAAE;0CAcT,OAAO,EAAE;YA/EV,gMAAA,eAAe,6DAoBd;YAMD,uLAAA,YAAY,6DAkBX;YAsBD,iLAAA,UAAU,6DAUT;YAID,6LAAA,cAAc,6DAUb;;;QAhNQ,YAAY,GADV,mDAAkB,CACe;QAC3B,aAAa,CAQ5B;QAEF,YAAY,QAAkB;YAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;oBAC1B,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC5D,KAAK,EAAE,CAAC;gBACV,CAAC;YACH,CAAC;YAED,IAAI,CAAC,YAAY,GAAG,IAAI,YAAY,CAClC,IAAI,GAAG,CACL,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM;gBACN,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC;aAClC,CAAC,CACH,CACF,CAAC;YAEF,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAA6C,CAAC;YAE1E,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CACtB,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAC5D,CAAC;gBAEF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;gBACzC,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;oBAC1B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpD,CAAC;gBACD,MAAM,KAAK,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CACjD,MAAM,CAAC,IAAI,CACT,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CACpE,CACF,CAAC;gBAEF,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACzC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE;wBAClC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;wBACpB,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;qBACxB,CAAC,CAAC;gBACL,CAAC;gBACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa;qBAC3D,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE;qBACjB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,OAAO,GAAG,IAAI,CAAC,aAAa;qBAC9D,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE;qBACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED;;;WAGG;QACH,aAAa,CAAC,OAAiB;YAC7B,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAClD,CAAC;QAED,uDAAuD;QACvD,QAAQ,CAAC,OAAiB;YAIxB,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC1D,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5D,CAAC;QAED;;;WAGG;QACH,iBAAiB,CAAC,MAAc,EAAE,OAAiB;YACjD,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CACxB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CACpC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAChE,CACF,CAAC;YACF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE/D,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;QAED,oDAAoD;QACpD,SAAS,CAAC,CAAS;YACjB,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,oEAAoE;QACpE,eAAe,CAAC,CAAS;YACvB,OAAO,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,8DAA8D;QAC9D,eAAe,CAAC,CAAS;YACvB,OAAO,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,sDAAsD;QAEtD,eAAe,CAAC,CAAS;YACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC9B,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,UAAU,GAAG,EAAE,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC/B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YACtD,CAAC;YAED,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACvC,UAAU,CAAC,KAAK,EAAE,CAAC;gBACnB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC;YAC1D,CAAC;YAED,OAAO,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED;;WAEG;QAEH,YAAY,CAAC,CAAS,EAAE,GAAG,GAAG,GAAG;YAC/B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBACrB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;gBACzD,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,CAAC;YAED,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;gBACvB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,oEAAoE;QACpE,UAAU,CAAC,CAAS;YAClB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,kDAAkD;QAClD,QAAQ,CAAC,CAAS;YAChB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,gEAAgE;QAChE,WAAW,CAAC,CAAS;YACnB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9D,CAAC;QAED,qDAAqD;QAErD,UAAU,CAAC,CAAS;YAClB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO,MAAM,CAAC,GAAG,CACf,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAC5D,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QAED,yDAAyD;QAEzD,cAAc,CAAC,CAAS;YACtB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO,MAAM,CAAC,GAAG,CACf,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CACxE,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED;;;WAGG;QACH,qBAAqB,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,CAAC;;;SAzNU,kBAAkB"}

package/dist/lib/letterIndices.d.ts

@@ -0,0 +1,13 @@
+/** A map from letters to their indices in a given slug. */
+export declare class LetterIndices {
+    private readonly indices;
+    constructor(indices: ReadonlyMap<string, number[]>);
+    static from(slug: string): LetterIndices;
+    counts(): IterableIterator<[string, number]>;
+    countSet(): Set<number>;
+    entries(): IterableIterator<[string, number[]]>;
+    filterKeys(fn: (letter: string, indices: number[]) => boolean): string[];
+    get(letter: string): number[];
+    keys(): IterableIterator<string>;
+}
+//# sourceMappingURL=letterIndices.d.ts.map

package/dist/lib/letterIndices.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"letterIndices.d.ts","sourceRoot":"","sources":["../../src/lib/letterIndices.ts"],"names":[],"mappings":"AAEA,2DAA2D;AAC3D,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAgC;gBAE5C,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAIlD,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa;IAavC,MAAM,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAM7C,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC;IAIvB,OAAO,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAI/C,UAAU,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,OAAO,GAAG,MAAM,EAAE;IAMxE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAI7B,IAAI,IAAI,gBAAgB,CAAC,MAAM,CAAC;CAGjC"}

package/dist/lib/letterIndices.js

@@ -0,0 +1,41 @@
+import { enumerate } from "./util.js";
+/** A map from letters to their indices in a given slug. */
+export class LetterIndices {
+    indices;
+    constructor(indices) {
+        this.indices = indices;
+    }
+    static from(slug) {
+        const indices = new Map();
+        for (const [i, letter] of enumerate(slug)) {
+            if (!indices.has(letter)) {
+                indices.set(letter, []);
+            }
+            indices.get(letter).push(i);
+        }
+        return new LetterIndices(indices);
+    }
+    *counts() {
+        for (const [letter, indices] of this.indices.entries()) {
+            yield [letter, indices.length];
+        }
+    }
+    countSet() {
+        return new Set(Array.from(this.counts(), ([, c]) => c));
+    }
+    entries() {
+        return this.indices.entries();
+    }
+    filterKeys(fn) {
+        return Array.from(this.indices.entries())
+            .filter(([letter, indices]) => fn(letter, indices))
+            .map(([letter]) => letter);
+    }
+    get(letter) {
+        return this.indices.get(letter) ?? [];
+    }
+    keys() {
+        return this.indices.keys();
+    }
+}
+//# sourceMappingURL=letterIndices.js.map

package/dist/lib/letterIndices.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"letterIndices.js","sourceRoot":"","sources":["../../src/lib/letterIndices.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC,2DAA2D;AAC3D,MAAM,OAAO,aAAa;IACP,OAAO,CAAgC;IAExD,YAAY,OAAsC;QAChD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,IAAY;QACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE5C,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAC1B,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,CAAC,MAAM;QACL,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACvD,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IAChC,CAAC;IAED,UAAU,CAAC,EAAkD;QAC3D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;aACtC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;aAClD,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACxC,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;CACF"}

package/dist/lib/logCounter.d.ts

@@ -0,0 +1,23 @@
+import { LogNum } from "./logNum.js";
+/** A map from items to log counts. */
+export declare class LogCounter<T extends PropertyKey> {
+    private readonly counts;
+    constructor(counts: ReadonlyMap<T, LogNum>, totalCache?: LogNum);
+    static from(data: string): LogCounter<string>;
+    static from<T extends PropertyKey>(data: Iterable<T>): LogCounter<T>;
+    static from<T extends PropertyKey, U>(data: Iterable<U>, map: (item: U) => T): LogCounter<T>;
+    /** The number of distinct items. */
+    get distinct(): LogNum;
+    private totalCache;
+    /** The total number of all items. */
+    get total(): LogNum;
+    /** The log count of the given item. */
+    get(item: T): LogNum;
+    /** Returns an iterable of [item, log count] pairs. */
+    entries(): IterableIterator<[T, LogNum]>;
+    /** Returns a list of items that satisfy the given predicate. */
+    filterKeys(fn: (item: T, count: LogNum) => boolean): T[];
+    /** Returns an iterable of [item, log probability] pairs. */
+    frequencies(): IterableIterator<[T, LogNum]>;
+}
+//# sourceMappingURL=logCounter.d.ts.map

package/dist/lib/logCounter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logCounter.d.ts","sourceRoot":"","sources":["../../src/lib/logCounter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,sCAAsC;AACtC,qBAAa,UAAU,CAAC,CAAC,SAAS,WAAW;IAC3C,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAyB;gBAEpC,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,UAAU,CAAC,EAAE,MAAM;IAK/D,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;IAC7C,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,WAAW,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IACpE,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,WAAW,EAAE,CAAC,EAClC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAClB,UAAU,CAAC,CAAC,CAAC;IAsBhB,oCAAoC;IACpC,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,OAAO,CAAC,UAAU,CAAqB;IAEvC,qCAAqC;IACrC,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,uCAAuC;IACvC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM;IAIpB,sDAAsD;IACtD,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAIxC,gEAAgE;IAChE,UAAU,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAAG,CAAC,EAAE;IAMxD,4DAA4D;IAC3D,WAAW,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAK9C"}

package/dist/lib/logCounter.js

@@ -0,0 +1,49 @@
+import { LogNum } from "./logNum.js";
+/** A map from items to log counts. */
+export class LogCounter {
+    counts;
+    constructor(counts, totalCache) {
+        this.counts = counts;
+        this.totalCache = totalCache;
+    }
+    static from(data, map) {
+        const counts = new Map();
+        let total = 0;
+        for (const item_ of data) {
+            const item = map ? map(item_) : item_;
+            counts.set(item, (counts.get(item) ?? 0) + 1);
+            total++;
+        }
+        return new LogCounter(new Map(Array.from(counts).map(([item, count]) => [item, LogNum.from(count)])), LogNum.from(total));
+    }
+    /** The number of distinct items. */
+    get distinct() {
+        return LogNum.from(this.counts.size);
+    }
+    totalCache;
+    /** The total number of all items. */
+    get total() {
+        return (this.totalCache ??= LogNum.sum(Array.from(this.counts.values())));
+    }
+    /** The log count of the given item. */
+    get(item) {
+        return this.counts.get(item) ?? LogNum.from(0);
+    }
+    /** Returns an iterable of [item, log count] pairs. */
+    entries() {
+        return this.counts.entries();
+    }
+    /** Returns a list of items that satisfy the given predicate. */
+    filterKeys(fn) {
+        return Array.from(this.counts.entries())
+            .filter(([item, count]) => fn(item, count))
+            .map(([item]) => item);
+    }
+    /** Returns an iterable of [item, log probability] pairs. */
+    *frequencies() {
+        for (const [item, count] of this.counts) {
+            yield [item, count.div(this.total)];
+        }
+    }
+}
+//# sourceMappingURL=logCounter.js.map

package/dist/lib/logCounter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logCounter.js","sourceRoot":"","sources":["../../src/lib/logCounter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,sCAAsC;AACtC,MAAM,OAAO,UAAU;IACJ,MAAM,CAAyB;IAEhD,YAAY,MAA8B,EAAE,UAAmB;QAC7D,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAQD,MAAM,CAAC,IAAI,CACT,IAAoC,EACpC,GAAwC;QAExC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO,IAAI,UAAU,CACnB,IAAI,GAAG,CACL,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CACtE,EACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CACnB,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,IAAI,QAAQ;QACV,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAEO,UAAU,CAAqB;IAEvC,qCAAqC;IACrC,IAAI,KAAK;QACP,OAAO,CAAC,IAAI,CAAC,UAAU,KAAK,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,uCAAuC;IACvC,GAAG,CAAC,IAAO;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,sDAAsD;IACtD,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,gEAAgE;IAChE,UAAU,CAAC,EAAuC;QAChD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;aACrC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,4DAA4D;IAC5D,CAAC,WAAW;QACV,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;CACF"}

package/dist/lib/logNum.d.ts

@@ -0,0 +1,36 @@
+/**
+ * A numerically-stable-ish log of a non-negative number. Operations represent
+ * operations on the numbers, not the log numbers.
+ *
+ * @example LogNum.from(2).add(LogNum.from(3)).toNum() // 5
+ */
+export declare class LogNum {
+    private readonly data;
+    /** Construct from the actual log number. */
+    constructor(data: number);
+    static from(value: number): LogNum;
+    static fromExp(value: number): LogNum;
+    static fromFraction(numerator: number, denominator: number): LogNum;
+    static fromBinomial(n: number, k: number): LogNum;
+    static fromZipf(zipf: number): LogNum;
+    static fromFactorial(n: number): LogNum;
+    toNum(): number;
+    toLog(): number;
+    exp(): LogNum;
+    log(): LogNum;
+    pow(power: number): LogNum;
+    mul(other: LogNum): LogNum;
+    div(other: LogNum): LogNum;
+    add(other: LogNum): LogNum;
+    absSub(other: LogNum): LogNum;
+    sub(other: LogNum): LogNum;
+    gt(other: LogNum): boolean;
+    lt(other: LogNum): boolean;
+    static max(values: LogNum[]): LogNum;
+    static min(values: LogNum[]): LogNum;
+    static sum(values: LogNum[]): LogNum;
+    static prod(values: LogNum[]): LogNum;
+    static binomialProb(successes: number, trials: number, frequency: LogNum): LogNum;
+    static binomialPValue(successes: number, trials: number, frequency: LogNum): LogNum;
+}
+//# sourceMappingURL=logNum.d.ts.map

package/dist/lib/logNum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logNum.d.ts","sourceRoot":"","sources":["../../src/lib/logNum.ts"],"names":[],"mappings":"AAuBA;;;;;GAKG;AACH,qBAAa,MAAM;IACjB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAE9B,4CAA4C;gBAChC,IAAI,EAAE,MAAM;IAIxB,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAIlC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAIrC,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAKnE,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAQjD,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAIrC,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIvC,KAAK,IAAI,MAAM;IAIf,KAAK,IAAI,MAAM;IAIf,GAAG,IAAI,MAAM;IAIb,GAAG,IAAI,MAAM;IAIb,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAI1B,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAI1B,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAI1B,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAW1B,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAQ7B,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAU1B,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAI1B,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAI1B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAIpC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAIpC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAWpC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAIrC,MAAM,CAAC,YAAY,CACjB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,GAChB,MAAM;IAUT,MAAM,CAAC,cAAc,CACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,GAChB,MAAM;CAoBV"}

package/dist/lib/logNum.js

@@ -0,0 +1,193 @@
+var __runInitializers = (this && this.__runInitializers) || function (thisArg, initializers, value) {
+    var useValue = arguments.length > 2;
+    for (var i = 0; i < initializers.length; i++) {
+        value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+    }
+    return useValue ? value : void 0;
+};
+var __esDecorate = (this && this.__esDecorate) || function (ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+    function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+    var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+    var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+    var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+    var _, done = false;
+    for (var i = decorators.length - 1; i >= 0; i--) {
+        var context = {};
+        for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+        for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+        context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+        var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+        if (kind === "accessor") {
+            if (result === void 0) continue;
+            if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+            if (_ = accept(result.get)) descriptor.get = _;
+            if (_ = accept(result.set)) descriptor.set = _;
+            if (_ = accept(result.init)) initializers.unshift(_);
+        }
+        else if (_ = accept(result)) {
+            if (kind === "field") initializers.unshift(_);
+            else descriptor[key] = _;
+        }
+    }
+    if (target) Object.defineProperty(target, contextIn.name, descriptor);
+    done = true;
+};
+import { zipfToLogProb } from "cromulence";
+import { gammaln } from "simple-statistics";
+import { memoize } from "./memoize.js";
+import { interval } from "./util.js";
+/**
+ * A numerically-stable-ish log(1 - exp(x)).
+ *
+ * Follows the algorithm in <https://cran.r-project.org/web/packages/Rmpfr/vignettes/log1mexp-note.pdf>.
+ */
+function log1mExp(x) {
+    return x > -Math.log(2) ? Math.log1p(-Math.exp(x)) : Math.log(-Math.expm1(x));
+}
+/**
+ * A numerically-stable-ish log(1 + exp(x)).
+ *
+ * Follows the algorithm in <https://cran.r-project.org/web/packages/Rmpfr/vignettes/log1mexp-note.pdf>.
+ */
+function log1pExp(x) {
+    return x <= 18 ? Math.log1p(Math.exp(x)) : x + Math.exp(-x);
+}
+/**
+ * A numerically-stable-ish log of a non-negative number. Operations represent
+ * operations on the numbers, not the log numbers.
+ *
+ * @example LogNum.from(2).add(LogNum.from(3)).toNum() // 5
+ */
+let LogNum = (() => {
+    let _staticExtraInitializers = [];
+    let _static_fromBinomial_decorators;
+    return class LogNum {
+        static {
+            const _metadata = typeof Symbol === "function" && Symbol.metadata ? Object.create(null) : void 0;
+            __esDecorate(this, null, _static_fromBinomial_decorators, { kind: "method", name: "fromBinomial", static: true, private: false, access: { has: obj => "fromBinomial" in obj, get: obj => obj.fromBinomial }, metadata: _metadata }, null, _staticExtraInitializers);
+            if (_metadata) Object.defineProperty(this, Symbol.metadata, { enumerable: true, configurable: true, writable: true, value: _metadata });
+            __runInitializers(this, _staticExtraInitializers);
+        }
+        data;
+        /** Construct from the actual log number. */
+        constructor(data) {
+            this.data = data;
+        }
+        static from(value) {
+            return new LogNum(Math.log(value));
+        }
+        static fromExp(value) {
+            return new LogNum(value);
+        }
+        static fromFraction(numerator, denominator) {
+            return new LogNum(Math.log(numerator) - Math.log(denominator));
+        }
+        static fromBinomial(n, k) {
+            if (n === 0 || k === 0 || k === n) {
+                return LogNum.from(1);
+            }
+            return LogNum.fromBinomial(n - 1, k - 1).add(LogNum.fromBinomial(n - 1, k));
+        }
+        static fromZipf(zipf) {
+            return new LogNum(zipfToLogProb(zipf));
+        }
+        static fromFactorial(n) {
+            return new LogNum(gammaln(n + 1));
+        }
+        toNum() {
+            return Math.exp(this.data);
+        }
+        toLog() {
+            return this.data;
+        }
+        exp() {
+            return new LogNum(Math.exp(this.data));
+        }
+        log() {
+            return LogNum.from(this.data);
+        }
+        pow(power) {
+            return new LogNum(this.data * power);
+        }
+        mul(other) {
+            return new LogNum(this.data + other.data);
+        }
+        div(other) {
+            return new LogNum(this.data - other.data);
+        }
+        add(other) {
+            let [max, min] = [this.data, other.data];
+            if (max < min) {
+                [max, min] = [min, max];
+            }
+            if (min === -Infinity) {
+                return new LogNum(max);
+            }
+            return new LogNum(max + log1pExp(min - max));
+        }
+        absSub(other) {
+            let [max, min] = [this.data, other.data];
+            if (max < min) {
+                [max, min] = [min, max];
+            }
+            return new LogNum(max + log1mExp(min - max));
+        }
+        sub(other) {
+            if (this.lt(other)) {
+                throw new Error(`log underflow: ${this.data.toString()} - ${other.data.toString()}`);
+            }
+            const [max, min] = [this.data, other.data];
+            return new LogNum(max + log1mExp(min - max));
+        }
+        gt(other) {
+            return this.data > other.data;
+        }
+        lt(other) {
+            return this.data < other.data;
+        }
+        static max(values) {
+            return new LogNum(Math.max(...values.map((x) => x.data)));
+        }
+        static min(values) {
+            return new LogNum(Math.min(...values.map((x) => x.data)));
+        }
+        static sum(values) {
+            // Strip zeroes first:
+            values = values.filter((x) => x.data !== -Infinity);
+            const max = Math.max(...values.map((x) => x.data));
+            if (max === Infinity) {
+                return new LogNum(Infinity);
+            }
+            const expSum = values.reduce((acc, x) => acc + Math.exp(x.data - max), 0);
+            return new LogNum(max + Math.log(expSum));
+        }
+        static prod(values) {
+            return new LogNum(values.reduce((acc, x) => acc + x.data, 0));
+        }
+        static binomialProb(successes, trials, frequency) {
+            return LogNum.fromBinomial(trials, successes).mul(frequency.pow(successes).mul(LogNum.from(1)
+                .sub(frequency)
+                .pow(trials - successes)));
+        }
+        static binomialPValue(successes, trials, frequency) {
+            const expected = trials * frequency.toNum();
+            const probs = [];
+            if (successes > expected) {
+                for (const i of interval(successes, trials)) {
+                    probs.push(LogNum.binomialProb(i, trials, frequency));
+                }
+            }
+            else {
+                for (const i of interval(0, successes)) {
+                    probs.push(LogNum.binomialProb(i, trials, frequency));
+                }
+            }
+            return LogNum.sum(probs);
+        }
+        [(_static_fromBinomial_decorators = [memoize(2)], Symbol.for("nodejs.util.inspect.custom"))]() {
+            return `LogNum(${this.data.toFixed(3)}: ${this.toNum().toString()})`;
+        }
+    };
+})();
+export { LogNum };
+//# sourceMappingURL=logNum.js.map

package/dist/lib/logNum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logNum.js","sourceRoot":"","sources":["../../src/lib/logNum.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC;;;;GAIG;AACH,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;IACU,MAAM;;;iBAAN,MAAM;;;YAqBjB,6LAAO,YAAY,2DAMlB;;YA3BU,iDAAM,CAAA;;QACA,IAAI,CAAS;QAE9B,4CAA4C;QAC5C,YAAY,IAAY;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAa;YACvB,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,CAAC,OAAO,CAAC,KAAa;YAC1B,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAED,MAAM,CAAC,YAAY,CAAC,SAAiB,EAAE,WAAmB;YACxD,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QACjE,CAAC;QAGD,MAAM,CAAC,YAAY,CAAC,CAAS,EAAE,CAAS;YACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;YAED,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,CAAC,QAAQ,CAAC,IAAY;YAC1B,OAAO,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,CAAC,aAAa,CAAC,CAAS;YAC5B,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,KAAK;YACH,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,KAAK;YACH,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,GAAG;YACD,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,GAAG;YACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QAED,GAAG,CAAC,KAAa;YACf,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,GAAG,CAAC,KAAa;YACf,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;QAED,GAAG,CAAC,KAAa;YACf,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;QAED,GAAG,CAAC,KAAa;YACf,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBACd,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACtB,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,OAAO,IAAI,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,MAAM,CAAC,KAAa;YAClB,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBACd,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,OAAO,IAAI,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,GAAG,CAAC,KAAa;YACf,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnB,MAAM,IAAI,KAAK,CACb,kBAAkB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CACpE,CAAC;YACJ,CAAC;YACD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,OAAO,IAAI,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,EAAE,CAAC,KAAa;YACd,OAAO,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAChC,CAAC;QAED,EAAE,CAAC,KAAa;YACd,OAAO,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAChC,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,MAAgB;YACzB,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,MAAgB;YACzB,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,MAAgB;YACzB,sBAAsB;YACtB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACnD,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;gBACrB,OAAO,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC9B,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1E,OAAO,IAAI,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,MAAgB;YAC1B,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,CAAC,YAAY,CACjB,SAAiB,EACjB,MAAc,EACd,SAAiB;YAEjB,OAAO,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,GAAG,CAC/C,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;iBACX,GAAG,CAAC,SAAS,CAAC;iBACd,GAAG,CAAC,MAAM,GAAG,SAAS,CAAC,CAC3B,CACF,CAAC;QACJ,CAAC;QAED,MAAM,CAAC,cAAc,CACnB,SAAiB,EACjB,MAAc,EACd,SAAiB;YAEjB,MAAM,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,EAAE,CAAC;YAEjB,IAAI,SAAS,GAAG,QAAQ,EAAE,CAAC;gBACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;oBAC5C,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;oBACvC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;YAED,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAED,qCA5IC,OAAO,CAAC,CAAC,CAAC,GA4IV,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,EAAC;YACxC,OAAO,UAAU,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,GAAG,CAAC;QACvE,CAAC;;;SAlKU,MAAM"}

package/dist/lib/memoize.d.ts

@@ -0,0 +1,5 @@
+type AnyFn = (...args: readonly any[]) => unknown;
+/** Memoize a class method that takes up to three arguments. */
+export declare function memoize<const Fn extends AnyFn>(levels?: 1 | 2 | 3): (target: Fn) => Fn;
+export {};
+//# sourceMappingURL=memoize.d.ts.map

package/dist/lib/memoize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoize.d.ts","sourceRoot":"","sources":["../../src/lib/memoize.ts"],"names":[],"mappings":"AAEA,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,SAAS,GAAG,EAAE,KAAK,OAAO,CAAC;AA+HlD,+DAA+D;AAC/D,wBAAgB,OAAO,CAAC,KAAK,CAAC,EAAE,SAAS,KAAK,EAC5C,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GACjB,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC"}