chaffjs 0.24.0 → 0.25.0

package/dist/detectors/connective-hierarchy.d.ts

@@ -0,0 +1,16 @@
+import type { Detector, LexiconEntry, Sentence } from "../plugin.ts";
+/** One outer-level connective with nothing to stand above, and where it is in the document. */
+export type LoneConnective = {
+    readonly offset: number;
+    readonly written: string;
+    readonly usual: string;
+};
+/** The word lists the detector reads: the connectives, and the phrases that hold one's letters without being one (歯並びに). */
+export type ConnectiveLists = {
+    readonly connectives: readonly LexiconEntry[];
+    readonly lookalikes: readonly LexiconEntry[];
+};
+/** The outer-level connectives of a sentence that stand over no inner level. */
+export declare const loneConnectivesIn: (sentence: Sentence, lists: ConnectiveLists) => LoneConnective[];
+export declare const connectiveHierarchy: Detector;
+//# sourceMappingURL=connective-hierarchy.d.ts.map

package/dist/detectors/connective-hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connective-hierarchy.d.ts","sourceRoot":"","sources":["../../src/detectors/connective-hierarchy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAW,YAAY,EAAE,QAAQ,EAAe,MAAM,cAAc,CAAC;AAQ3F,+FAA+F;AAC/F,MAAM,MAAM,cAAc,GAAG;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAI3G,4HAA4H;AAC5H,MAAM,MAAM,eAAe,GAAG;IAAE,QAAQ,CAAC,WAAW,EAAE,SAAS,YAAY,EAAE,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,SAAS,YAAY,EAAE,CAAA;CAAE,CAAC;AA4D9H,gFAAgF;AAChF,eAAO,MAAM,iBAAiB,GAAI,UAAU,QAAQ,EAAE,OAAO,eAAe,KAAG,cAAc,EAS5F,CAAC;AAEF,eAAO,MAAM,mBAAmB,EAAE,QAYjC,CAAC"}

package/dist/detectors/connective-hierarchy.js

@@ -0,0 +1,68 @@
+import { escapeRegExp } from "../orthography.js";
+import { quotedSpans } from "../quoted-span.js";
+const CONJUNCTION = "CCONJ";
+/**
+ * The tagger does not always tell a connective from a noun and a particle: it reads 申請書並びに as 並び + に and
+ * 文字の並びに as the conjunction. After の, a determiner or an adjective (の並びに, この並びに, 正しい並びに) the word is
+ * a noun of its own. Where the tagger splits it, it is a connective only between two nouns: a noun, a number or a mark
+ * before it, and no verb right after it (一列並びに座る).
+ */
+const MODIFIES_NOUN = new Set(["DET", "ADJ"]);
+const GENITIVE = "の";
+const JOINS_AFTER = new Set(["NOUN", "PROPN", "NUM", "PUNCT", "SYM"]);
+const ENDS_CLAUSE = new Set(["VERB", "AUX"]);
+const modifiesNoun = (token) => token !== undefined && (MODIFIES_NOUN.has(token.pos) || (token.pos === "ADP" && token.surface === GENITIVE));
+const joinsNouns = (previous, next) => previous !== undefined && JOINS_AFTER.has(previous.pos) && next !== undefined && !ENDS_CLAUSE.has(next.pos);
+const placesOf = (text, word) => [...text.matchAll(new RegExp(escapeRegExp(word), "gu"))].map((match) => match.index);
+/** Inside 「」 or 『』 (a quoted phrase holds half a list) or inside a lookalike (歯並びに), by the sentence's own offsets. */
+const hiddenLetters = (text, lookalikes) => {
+    const hidden = Array.from({ length: text.length }, () => false);
+    const hide = (start, end) => hidden.fill(true, start, end);
+    quotedSpans(text).forEach((span) => hide(span.start, span.end));
+    lookalikes.forEach(({ pattern }) => placesOf(text, pattern).forEach((at) => hide(at, at + pattern.length)));
+    return hidden;
+};
+const readingOf = (sentence, lookalikes) => {
+    const tokens = sentence.tokens ?? [];
+    return {
+        byStart: new Map(tokens.map((token) => [token.span.start, token])),
+        byEnd: new Map(tokens.map((token) => [token.span.end, token])),
+        hidden: hiddenLetters(sentence.text, lookalikes),
+    };
+};
+const standsAsConnective = (reading, span) => {
+    const previous = reading.byEnd.get(span.start);
+    if (modifiesNoun(previous))
+        return false;
+    const own = reading.byStart.get(span.start);
+    const tagged = own !== undefined && own.pos === CONJUNCTION && own.span.end === span.end;
+    return tagged || joinsNouns(previous, reading.byStart.get(span.end));
+};
+const hasInnerLevel = (sentence, outer, connectives) => connectives.some((entry) => entry.instead_of === outer.pattern && sentence.text.includes(entry.pattern));
+/** Where one outer-level word stands as a connective in the sentence. */
+const connectiveSpans = (sentence, outer, reading) => placesOf(sentence.text, outer.pattern)
+    .filter((at) => reading.hidden[at] !== true)
+    .map((at) => ({ start: sentence.span.start + at, end: sentence.span.start + at + outer.pattern.length }))
+    .filter((span) => standsAsConnective(reading, span));
+/** The outer-level connectives of a sentence that stand over no inner level. */
+export const loneConnectivesIn = (sentence, lists) => {
+    const lone = lists.connectives.filter((entry) => entry.rewrite !== undefined && sentence.text.includes(entry.pattern) && !hasInnerLevel(sentence, entry, lists.connectives));
+    if (lone.length === 0)
+        return [];
+    const reading = readingOf(sentence, lists.lookalikes);
+    return lone
+        .flatMap((entry) => connectiveSpans(sentence, entry, reading).map((span) => ({ offset: span.start, written: entry.pattern, usual: entry.rewrite ?? "" })))
+        .sort((a, b) => a.offset - b.offset);
+};
+export const connectiveHierarchy = (doc, options) => {
+    const lists = { connectives: options.lexicon ?? [], lookalikes: doc.lexicons["connective-lookalike"] ?? [] };
+    return doc.sentences.flatMap((sentence) => loneConnectivesIn(sentence, lists).map((lone) => ({
+        rule: "",
+        severity: "info",
+        line: 0,
+        column: 0,
+        quote: sentence.text.trim(),
+        values: { written: lone.written, usual: lone.usual, offset: lone.offset },
+    })));
+};
+//# sourceMappingURL=connective-hierarchy.js.map

package/dist/detectors/connective-hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"connective-hierarchy.js","sourceRoot":"","sources":["../../src/detectors/connective-hierarchy.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAShD,MAAM,WAAW,GAAG,OAAO,CAAC;AAK5B;;;;;GAKG;AACH,MAAM,aAAa,GAAwB,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;AACnE,MAAM,QAAQ,GAAG,GAAG,CAAC;AACrB,MAAM,WAAW,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAC3F,MAAM,WAAW,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;AAElE,MAAM,YAAY,GAAG,CAAC,KAAwB,EAAW,EAAE,CACzD,KAAK,KAAK,SAAS,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,KAAK,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC;AAE/G,MAAM,UAAU,GAAG,CAAC,QAA2B,EAAE,IAAuB,EAAW,EAAE,CACnF,QAAQ,KAAK,SAAS,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAK9G,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,IAAY,EAAY,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAEhJ,uHAAuH;AACvH,MAAM,aAAa,GAAG,CAAC,IAAY,EAAE,UAAmC,EAAa,EAAE;IACrF,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,GAAW,EAAa,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IACtF,WAAW,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5G,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,QAAkB,EAAE,UAAmC,EAAW,EAAE;IACrF,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,IAAI,EAAE,CAAC;IACrC,OAAO;QACL,OAAO,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAClE,KAAK,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;KACjD,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,OAAgB,EAAE,IAAU,EAAW,EAAE;IACnE,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,IAAI,YAAY,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,GAAG,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;IACzF,OAAO,MAAM,IAAI,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACvE,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,QAAkB,EAAE,KAAmB,EAAE,WAAoC,EAAW,EAAE,CAC/G,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;AAE3G,yEAAyE;AACzE,MAAM,eAAe,GAAG,CAAC,QAAkB,EAAE,KAAmB,EAAE,OAAgB,EAAU,EAAE,CAC5F,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC;KACnC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC;KAC3C,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;KACxG,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;AAEzD,gFAAgF;AAChF,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,QAAkB,EAAE,KAAsB,EAAoB,EAAE;IAChG,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CACnC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,CACtI,CAAC;IACF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACtD,OAAO,IAAI;SACR,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;SACzJ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAa,CAAC,GAAG,EAAE,OAAO,EAAa,EAAE;IACvE,MAAM,KAAK,GAAG,EAAE,WAAW,EAAE,OAAO,CAAC,OAAO,IAAI,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,sBAAsB,CAAC,IAAI,EAAE,EAAE,CAAC;IAC7G,OAAO,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CACxC,iBAAiB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAChD,IAAI,EAAE,EAAE;QACR,QAAQ,EAAE,MAAM;QAChB,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE;QAC3B,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;KAC1E,CAAC,CAAC,CACJ,CAAC;AACJ,CAAC,CAAC"}

package/dist/detectors/missing-final-period.d.ts

@@ -0,0 +1,17 @@
+import type { Detector, Paragraph } from "../plugin.ts";
+/** A paragraph's end, and whether it closes with a sentence-ending mark. form is "closed" or "open". */
+export type ParagraphEnd = {
+    readonly offset: number;
+    readonly form: string;
+    readonly text: string;
+};
+/** The marks the detector reads, from the lexicon. */
+export type PeriodMarks = {
+    readonly ends: readonly string[];
+    readonly otherEnds: readonly string[];
+    readonly notes: readonly string[];
+};
+/** How a paragraph ends, or undefined when its last line is not a sentence (a label, a lead-in, a note, a laid-out row). */
+export declare const paragraphEnd: (text: string, paragraph: Paragraph, marks: PeriodMarks) => ParagraphEnd | undefined;
+export declare const missingFinalPeriod: Detector;
+//# sourceMappingURL=missing-final-period.d.ts.map

package/dist/detectors/missing-final-period.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-final-period.d.ts","sourceRoot":"","sources":["../../src/detectors/missing-final-period.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAyB,SAAS,EAAwB,MAAM,cAAc,CAAC;AASrG,wGAAwG;AACxG,MAAM,MAAM,YAAY,GAAG;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAErG,sDAAsD;AACtD,MAAM,MAAM,WAAW,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC;AAiCzI,4HAA4H;AAC5H,eAAO,MAAM,YAAY,GAAI,MAAM,MAAM,EAAE,WAAW,SAAS,EAAE,OAAO,WAAW,KAAG,YAAY,GAAG,SASpG,CAAC;AAQF,eAAO,MAAM,kBAAkB,EAAE,QAchC,CAAC"}

package/dist/detectors/missing-final-period.js

@@ -0,0 +1,62 @@
+import { formMinority } from "./form-minority.js";
+/** Brackets and quotes that may follow a closing mark (〜です。」). */
+const CLOSERS = '」』）)"”’';
+/** A line that is itself a quotation closes like a sentence. */
+const QUOTE_CLOSERS = "」』";
+/** A paragraph ending in a colon leads into a list or a block; it is not a sentence left open. */
+const LEAD_IN = /[：:]$/u;
+/** Two spaces in a row, half- or full-width, lay a line out like a table (an ingredient, then its amount), so it is not a sentence. */
+const LAYOUT = /[ \u3000]{2}/u;
+/** Fewer characters than this is a label or a caption, not a sentence. */
+const MIN_SENTENCE_CHARS = 15;
+/** Words that end a clause: a verb, an adjective or an auxiliary in its dictionary form ends the sentence. */
+const PREDICATE = new Set(["VERB", "ADJ", "AUX"]);
+/** The line's last mark before any closing brackets and quotes is one of these. */
+const endsWithMark = (line, marks) => {
+    const chars = Array.from(line);
+    return marks.includes(chars[chars.findLastIndex((char) => !CLOSERS.includes(char))] ?? "");
+};
+const isClosed = (line, ends) => endsWithMark(line, ends) || QUOTE_CLOSERS.includes(line.at(-1) ?? "\0");
+/** A note, a laid-out row, or a question or exclamation: not a sentence that could take the period. */
+const isAside = (line, marks) => marks.notes.some((note) => line.startsWith(note)) || LAYOUT.test(line) || endsWithMark(line, marks.otherEnds);
+/** The paragraph's last word ends a sentence: a predicate written in its dictionary form (〜します, 〜である, 望ましい). */
+const endsInPredicate = (paragraph) => {
+    const last = (paragraph.sentences.at(-1)?.tokens ?? []).filter((token) => token.surface.trim() !== "").at(-1);
+    return last !== undefined && PREDICATE.has(last.pos) && last.lemma === last.surface;
+};
+/** How a paragraph ends, or undefined when its last line is not a sentence (a label, a lead-in, a note, a laid-out row). */
+export const paragraphEnd = (text, paragraph, marks) => {
+    const body = text.slice(paragraph.span.start, paragraph.span.end).trimEnd();
+    const last = body.split("\n").at(-1)?.trim() ?? "";
+    if (Array.from(last).length < MIN_SENTENCE_CHARS || LEAD_IN.test(last))
+        return undefined;
+    const offset = paragraph.span.start + body.length - 1;
+    if (isAside(last, marks))
+        return undefined;
+    if (isClosed(last, marks.ends))
+        return { offset, form: "closed", text: last };
+    // A closing parenthetical after the sentence (〜します（別紙を参照する）) is not where the period goes.
+    return !CLOSERS.includes(last.at(-1) ?? "\0") && endsInPredicate(paragraph) ? { offset, form: "open", text: last } : undefined;
+};
+const marksOf = (lexicon) => ({
+    ends: lexicon.filter((entry) => entry.group === "end").map((entry) => entry.pattern),
+    otherEnds: lexicon.filter((entry) => entry.group === "other-end").map((entry) => entry.pattern),
+    notes: lexicon.filter((entry) => entry.group === "note").map((entry) => entry.pattern),
+});
+export const missingFinalPeriod = (doc, options) => {
+    const text = doc.prose ?? doc.source;
+    const marks = marksOf(doc.lexicons["final-period"] ?? []);
+    const ends = doc.paragraphs.flatMap((paragraph) => paragraphEnd(text, paragraph, marks) ?? []);
+    const minority = formMinority(ends, options.limit);
+    if (minority === undefined || minority.usual.form !== "closed")
+        return [];
+    return minority.odd.map((end) => ({
+        rule: "",
+        severity: "info",
+        line: 0,
+        column: 0,
+        quote: end.text,
+        values: { count: minority.odd.length, of: ends.length, offset: end.offset },
+    }));
+};
+//# sourceMappingURL=missing-final-period.js.map

package/dist/detectors/missing-final-period.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-final-period.js","sourceRoot":"","sources":["../../src/detectors/missing-final-period.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAclD,kEAAkE;AAClE,MAAM,OAAO,GAAG,SAAS,CAAC;AAC1B,gEAAgE;AAChE,MAAM,aAAa,GAAG,IAAI,CAAC;AAC3B,kGAAkG;AAClG,MAAM,OAAO,GAAG,QAAQ,CAAC;AACzB,uIAAuI;AACvI,MAAM,MAAM,GAAG,eAAe,CAAC;AAC/B,0EAA0E;AAC1E,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,8GAA8G;AAC9G,MAAM,SAAS,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;AAEvE,mFAAmF;AACnF,MAAM,YAAY,GAAG,CAAC,IAAY,EAAE,KAAwB,EAAW,EAAE;IACvE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAC7F,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,IAAuB,EAAW,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;AAE7I,uGAAuG;AACvG,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,KAAkB,EAAW,EAAE,CAC5D,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;AAEhH,gHAAgH;AAChH,MAAM,eAAe,GAAG,CAAC,SAAoB,EAAW,EAAE;IACxD,MAAM,IAAI,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,KAAY,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrH,OAAO,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,CAAC;AACtF,CAAC,CAAC;AAEF,4HAA4H;AAC5H,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,IAAY,EAAE,SAAoB,EAAE,KAAkB,EAA4B,EAAE;IAC/G,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;IAC5E,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACnD,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACzF,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACtD,IAAI,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAC9E,2FAA2F;IAC3F,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACjI,CAAC,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,OAAgC,EAAe,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC;IACpF,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC;IAC/F,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC;CACvF,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,kBAAkB,GAAa,CAAC,GAAkB,EAAE,OAAO,EAAa,EAAE;IACrF,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;IACrC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/F,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACnD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IAC1E,OAAO,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAChC,IAAI,EAAE,EAAE;QACR,QAAQ,EAAE,MAAM;QAChB,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,GAAG,CAAC,IAAI;QACf,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE;KAC5E,CAAC,CAAC,CAAC;AACN,CAAC,CAAC"}

package/dist/detectors/missing-space-after-comma.d.ts

@@ -0,0 +1,10 @@
+import type { Detector } from "../plugin.ts";
+/** One comma with no space after it, where it is, and the two words it joins as written. */
+export type TightComma = {
+    readonly offset: number;
+    readonly written: string;
+};
+/** Each run is read once, so a long line of values costs one pass. */
+export declare const tightCommasIn: (text: string) => TightComma[];
+export declare const missingSpaceAfterComma: Detector;
+//# sourceMappingURL=missing-space-after-comma.d.ts.map

package/dist/detectors/missing-space-after-comma.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-space-after-comma.d.ts","sourceRoot":"","sources":["../../src/detectors/missing-space-after-comma.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAW,MAAM,cAAc,CAAC;AAMtD,4FAA4F;AAC5F,MAAM,MAAM,UAAU,GAAG;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC;AA6B/E,sEAAsE;AACtE,eAAO,MAAM,aAAa,GAAI,MAAM,MAAM,KAAG,UAAU,EAInD,CAAC;AAEL,eAAO,MAAM,sBAAsB,EAAE,QAUpC,CAAC"}

package/dist/detectors/missing-space-after-comma.js

@@ -0,0 +1,42 @@
+import { quoteAround } from "./quote-around.js";
+/** A word of three letters or more (a possessive 's may follow), a comma, and a lower-case word of three letters or more. */
+const JOINED = /(?<![\p{L}\p{N}])[A-Za-z]{3,}(?:['’]s)?,[a-z]{3,}(?![\p{L}\p{N}])/u;
+/** Characters that make a run of text an address, a path, a parameter or data (a=b, a/b, a.b, @a, #a, a_b, 3,abc). */
+const DATA_MARK = /[/\\=@#:.&?_|+*~$%^<>{}[\]\p{N}]/u;
+/** Opening and closing marks a word of prose may carry ("(and,then)"), and the sentence's own end ("and,then."). */
+const OPENERS = "(\"'“‘[";
+const CLOSERS = ")\"'”’].,;!?";
+/** A run quoted whole, inside brackets or not ("true,false", ("true,false")): a value written out, not two words of the sentence. */
+const QUOTED_WHOLE = /^[([]*["'“‘].*["'”’][)\].,;!?]*$/u;
+/** A run of text between whitespace. */
+const RUN = /\S+/gu;
+const COMMA = ",";
+/** The run without the marks around it, trimmed by scanning rather than by a pattern that could backtrack. */
+const bareOf = (run) => {
+    const chars = run.split("");
+    const start = chars.findIndex((char) => !OPENERS.includes(char));
+    const end = chars.findLastIndex((char) => !CLOSERS.includes(char));
+    return start === -1 || end < start ? "" : run.slice(start, end + 1);
+};
+/** A run holding one comma and nothing that marks it as data. */
+const isProseRun = (run) => {
+    const bare = bareOf(run);
+    return bare.split(COMMA).length === 2 && !DATA_MARK.test(bare) && !QUOTED_WHOLE.test(run);
+};
+/** Each run is read once, so a long line of values costs one pass. */
+export const tightCommasIn = (text) => [...text.matchAll(RUN)].flatMap((run) => {
+    const joined = isProseRun(run[0]) ? JOINED.exec(run[0]) : null;
+    return joined === null ? [] : [{ offset: run.index + joined.index + joined[0].indexOf(COMMA), written: joined[0] }];
+});
+export const missingSpaceAfterComma = (doc) => {
+    const text = doc.prose ?? doc.source;
+    return tightCommasIn(text).map((comma) => ({
+        rule: "",
+        severity: "warning",
+        line: 0,
+        column: 0,
+        quote: quoteAround(text, comma.offset, comma.offset + 1),
+        values: { written: comma.written, offset: comma.offset },
+    }));
+};
+//# sourceMappingURL=missing-space-after-comma.js.map

package/dist/detectors/missing-space-after-comma.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-space-after-comma.js","sourceRoot":"","sources":["../../src/detectors/missing-space-after-comma.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAQhD,6HAA6H;AAC7H,MAAM,MAAM,GAAG,oEAAoE,CAAC;AACpF,sHAAsH;AACtH,MAAM,SAAS,GAAG,mCAAmC,CAAC;AACtD,oHAAoH;AACpH,MAAM,OAAO,GAAG,SAAS,CAAC;AAC1B,MAAM,OAAO,GAAG,cAAc,CAAC;AAC/B,qIAAqI;AACrI,MAAM,YAAY,GAAG,mCAAmC,CAAC;AACzD,wCAAwC;AACxC,MAAM,GAAG,GAAG,OAAO,CAAC;AACpB,MAAM,KAAK,GAAG,GAAG,CAAC;AAElB,8GAA8G;AAC9G,MAAM,MAAM,GAAG,CAAC,GAAW,EAAU,EAAE;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,OAAO,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AACtE,CAAC,CAAC;AAEF,iEAAiE;AACjE,MAAM,UAAU,GAAG,CAAC,GAAW,EAAW,EAAE;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACzB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC5F,CAAC,CAAC;AAEF,sEAAsE;AACtE,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,IAAY,EAAgB,EAAE,CAC1D,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;IACtC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,OAAO,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtH,CAAC,CAAC,CAAC;AAEL,MAAM,CAAC,MAAM,sBAAsB,GAAa,CAAC,GAAG,EAAa,EAAE;IACjE,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;IACrC,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACzC,IAAI,EAAE,EAAE;QACR,QAAQ,EAAE,SAAS;QACnB,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxD,MAAM,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE;KACzD,CAAC,CAAC,CAAC;AACN,CAAC,CAAC"}

package/dist/detectors/registry/connective-hierarchy.d.ts

@@ -0,0 +1,3 @@
+import type { Detector } from "../../plugin.ts";
+export declare const detector: Detector;
+//# sourceMappingURL=connective-hierarchy.d.ts.map

package/dist/detectors/registry/connective-hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connective-hierarchy.d.ts","sourceRoot":"","sources":["../../../src/detectors/registry/connective-hierarchy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAGhD,eAAO,MAAM,QAAQ,EAAE,QAA8B,CAAC"}

package/dist/detectors/registry/connective-hierarchy.js

@@ -0,0 +1,3 @@
+import { connectiveHierarchy } from "../connective-hierarchy.js";
+export const detector = connectiveHierarchy;
+//# sourceMappingURL=connective-hierarchy.js.map

package/dist/detectors/registry/connective-hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"connective-hierarchy.js","sourceRoot":"","sources":["../../../src/detectors/registry/connective-hierarchy.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAEjE,MAAM,CAAC,MAAM,QAAQ,GAAa,mBAAmB,CAAC"}

package/dist/detectors/registry/missing-final-period.d.ts

@@ -0,0 +1,3 @@
+import type { Detector } from "../../plugin.ts";
+export declare const detector: Detector;
+//# sourceMappingURL=missing-final-period.d.ts.map

package/dist/detectors/registry/missing-final-period.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-final-period.d.ts","sourceRoot":"","sources":["../../../src/detectors/registry/missing-final-period.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAGhD,eAAO,MAAM,QAAQ,EAAE,QAA6B,CAAC"}

package/dist/detectors/registry/missing-final-period.js

@@ -0,0 +1,3 @@
+import { missingFinalPeriod } from "../missing-final-period.js";
+export const detector = missingFinalPeriod;
+//# sourceMappingURL=missing-final-period.js.map

package/dist/detectors/registry/missing-final-period.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-final-period.js","sourceRoot":"","sources":["../../../src/detectors/registry/missing-final-period.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAEhE,MAAM,CAAC,MAAM,QAAQ,GAAa,kBAAkB,CAAC"}

package/dist/detectors/registry/missing-space-after-comma.d.ts

@@ -0,0 +1,3 @@
+import type { Detector } from "../../plugin.ts";
+export declare const detector: Detector;
+//# sourceMappingURL=missing-space-after-comma.d.ts.map

package/dist/detectors/registry/missing-space-after-comma.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-space-after-comma.d.ts","sourceRoot":"","sources":["../../../src/detectors/registry/missing-space-after-comma.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAGhD,eAAO,MAAM,QAAQ,EAAE,QAAiC,CAAC"}

package/dist/detectors/registry/missing-space-after-comma.js

@@ -0,0 +1,3 @@
+import { missingSpaceAfterComma } from "../missing-space-after-comma.js";
+export const detector = missingSpaceAfterComma;
+//# sourceMappingURL=missing-space-after-comma.js.map

package/dist/detectors/registry/missing-space-after-comma.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"missing-space-after-comma.js","sourceRoot":"","sources":["../../../src/detectors/registry/missing-space-after-comma.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAEzE,MAAM,CAAC,MAAM,QAAQ,GAAa,sBAAsB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "chaffjs",
-  "version": "0.24.0",
+  "version": "0.25.0",
   "description": "Prose validation harness. Finds what is hard to read, and never rewrites it for you.",
   "keywords": [
     "chaff",
@@ -67,7 +67,7 @@
   "dependencies": {
     "@anthropic-ai/sdk": "^0.125.0",
     "@chaffjs/lang-en": "0.22.0",
-    "@chaffjs/lang-ja": "0.23.0",
+    "@chaffjs/lang-ja": "0.24.0",
     "mdast-util-from-markdown": "^2.0.3",
     "mdast-util-frontmatter": "^2.0.1",
     "mdast-util-gfm-table": "^2.0.0",

package/rules/connective-hierarchy.yaml

@@ -0,0 +1,62 @@
+id: connective-hierarchy
+layer: L2
+status: stable
+how_to_find: connective-hierarchy
+word_list: connective-hierarchy
+extra_word_lists: [connective-lookalike]
+requires: [pos]
+languages: [ja]
+severity: warning
+
+name:
+  ja: 内の段の無い「並びに」「若しくは」
+  en: 並びに or 若しくは with no inner level
+
+why:
+  ja: 法令と公用文では、並べる語を段で使い分けます。一段の並べ方は「及び」「又は」で書き、二段に重ねたときだけ、外の段を「並びに」、内の段を「若しくは」で書きます（A及びB並びにC、A若しくはB又はC）。「及び」の無い文の「並びに」と、「又は」の無い文の「若しくは」は、段の無い並べ方に外の段の語を使っていて、読み手は内の段を探して止まります。
+  en: Japanese statutes and official writing join lists by level. A one-level list uses 及び (and) or 又は (or); only a two-level list uses 並びに for the outer "and" (A及びB並びにC) and 若しくは for the inner "or" (A若しくはB又はC). 並びに in a sentence with no 及び, or 若しくは in one with no 又は, uses the word for a level the sentence does not have, and the reader looks for the other level.
+
+message:
+  ja: 「{written}」の文に、段の組になる語がありません（一段なら「{usual}」）
+  en: '"{written}" with no other level of the list in the sentence (a one-level list uses "{usual}")'
+
+how_to_fix:
+  ja: 一段の並べ方なら「並びに」を「及び」に、「若しくは」を「又は」に替えてください。二段に重ねるつもりなら、内の段の語を書き足してください。
+  en: For a one-level list, write 及び for 並びに and 又は for 若しくは. If the list has two levels, write the other level's word too.
+
+levels: { strict: error, normal: warning, relaxed: info }
+
+use_for: [business, technical, blog, legal, docs, academic, literature, speech]
+off_for:
+  literature: Older prose uses 並びに and 若しくは as plain literary connectives, not by the official levels.
+  speech: Spoken Japanese, as in Diet and press transcripts, says 並びに and 若しくは for a single "and" and "or".
+
+group: wording
+summary:
+  ja: 「及び」の無い文の「並びに」、「又は」の無い文の「若しくは」
+  en: 並びに in a sentence with no 及び, or 若しくは in one with no 又は
+example:
+  ja:
+    before: |
+      申請書並びに添付書類を提出する。
+    after: |
+      申請書及び添付書類を提出する。
+
+not_flagged:
+  ja: 日本語の文書だけで動きます。仮名の「ならびに」「もしくは」は、普通の文で一段の並べ方にも使われるので見ません。「及び」「および」「又は」「または」が同じ文にあれば、段の組を作ったと読みます。「」『』の中は、引いた語句の片方だけなので見ません。名詞の後ろで名詞をつなぐときだけ見ます（文字の並びに、正しい並びに、縦並びには見ません）。
+  en: Only in Japanese documents. The kana forms ならびに and もしくは, which plain writing also uses for a one-level list, are not read. A sentence holding 及び, および, 又は or または is read as having the other level. A phrase inside 「」 or 『』 quotes half of a list and is not read. Only a word joining two nouns is read (文字の並びに, 正しい並びに and 縦並びに, the noun 並び with に, are not).
+sources: [koyobun-2022]
+rewrite:
+  depth: light
+  ja:
+    direction: 一段の並べ方なら、「並びに」を「及び」に、「若しくは」を「又は」に替えます。並べた語と順は変えません。
+    pairs:
+      - before: 申請書並びに添付書類を提出する。
+        after: 申請書及び添付書類を提出する。
+      - before: 書面若しくは電磁的方法により通知する。
+        after: 書面又は電磁的方法により通知する。
+    keep:
+      - 並べた語とその順
+    avoid:
+      - 文に無い内の段を書き足す
+      - 仮名の「および」「または」に書き換える

package/rules/missing-final-period.yaml

@@ -0,0 +1,76 @@
+id: missing-final-period
+layer: L2
+status: stable
+how_to_find: missing-final-period
+requires: [pos]
+languages: [ja]
+severity: info
+
+name:
+  ja: 「。」で終わらない段落
+  en: A paragraph ending without 。
+
+why:
+  ja: ほかの段落が「。」で終わる文書で、一つの段落だけが「〜しました」のように句点無しで終わると、書きかけで止まったか、貼り合わせた所に見えます。どちらの書き方が正しいかは決めず、文書の中で少ないほうを指します。見出しのような短い行、「：」で次へ続く行、注の行、表のように空白で並べた行、名詞で終わる行（体言止めの項目）は、文ではないので数えません。
+  en: In a Japanese document whose paragraphs end with 。, one paragraph that stops without it (〜しました) reads as unfinished, or as pasted in from elsewhere. chaff does not pick a side; it points at the paragraphs that differ from most of the document. Short lines such as captions, lines leading into a list with ：, notes, lines laid out with runs of spaces, and lines ending in a noun (an item in noun style) are not sentences and are not counted.
+
+message:
+  ja: この段落は「。」で終わっていません（この文書の段落はふつう「。」で終わります。{of} 段落のうち {count} 段落）
+  en: "This paragraph ends without 。, where the document's paragraphs usually end with it ({count} of {of})"
+
+how_to_fix:
+  ja: 段落の終わりに「。」を付けてください。
+  en: Add 。 at the end of the paragraph.
+
+# 少ないほうが、数えた段落の何パーセントまでなら「混ざっている」と見るか。これを超えたら、文書が使い分けている。
+levels: { strict: 34, normal: 25, relaxed: 15 }
+
+use_for: [business, technical, blog, legal, docs, academic, literature, speech]
+off_for:
+  literature: Verse and dialogue end lines without 。 on purpose.
+  speech: A transcript breaks where the speaker stops, not where a written sentence would end.
+
+group: consistency
+summary:
+  ja: 「。」で終わる段落の多い文書で、「。」無しで終わった段落
+  en: A paragraph ending without 。 in a document whose other paragraphs end with it
+example:
+  ja:
+    before: |
+      申請は市役所の窓口で受け付けます。
+
+      受付の時間は平日の午前九時から午後五時までです。
+
+      提出した書類は二週間ほどで審査が終わります。
+
+      審査の結果は郵送でお知らせしました
+    after: |
+      申請は市役所の窓口で受け付けます。
+
+      受付の時間は平日の午前九時から午後五時までです。
+
+      提出した書類は二週間ほどで審査が終わります。
+
+      審査の結果は郵送でお知らせしました。
+
+not_flagged:
+  ja: 日本語の文書だけで動きます。十五字に満たない行、「：」で終わる行、※ や ＊ で始まる注の行、空白を二つ続けて並べた行、名詞や連用形で終わる行（受付時間の案内、可能性あり）は文として数えません。閉じ括弧で終わる行（〜をご覧ください）と、「？」「！」で終わる行も数えません。段落の多くが「。」で終わらない文書（スライド、一覧）は指しません。
+  en: Only in Japanese documents. Lines under fifteen characters, lines ending in ：, note lines starting with ※ or ＊, lines laid out with two spaces in a row, and lines ending in a noun or a continuative form are not counted as sentences, nor are lines ending in a closing bracket, ？ or ！. A document whose paragraphs mostly end without 。 (slides, lists) is not reported.
+level_meaning:
+  ja: 「。」の無い段落が {limit}% までなら指摘
+  en: reported while paragraphs without 。 are at most {limit}% of the counted paragraphs
+sources: [textlint-ja-presets]
+rewrite:
+  depth: light
+  ja:
+    direction: 指した段落の終わりに「。」を一つ付けます。文は変えません。
+    pairs:
+      - before: 審査の結果は郵送でお知らせしました
+        after: 審査の結果は郵送でお知らせしました。
+      - before: 詳しい手順は担当者から説明します
+        after: 詳しい手順は担当者から説明します。
+    keep:
+      - 段落の言葉と順
+    avoid:
+      - 文を書き換える
+      - 名詞で終わる項目にまで「。」を付ける

package/rules/missing-space-after-comma.yaml

@@ -0,0 +1,57 @@
+id: missing-space-after-comma
+layer: L1
+status: stable
+how_to_find: missing-space-after-comma
+languages: [en]
+severity: warning
+
+name:
+  ja: カンマの後ろに空白が無い
+  en: No space after a comma
+
+why:
+  ja: 英文では、語をつなぐカンマの後ろに空白を一つ置きます。「address,and」のように空白が無いと、二つの語が一語に見え、検索でも別の語として当たりません。急いで打ったときや、書き換えの途中で空白が落ちた跡です。どちらの書き方を選ぶかの話ではなく、英語の句読点の決まりです。
+  en: 'English puts one space after a comma between words. Without it ("address,and") the two words read as one, and a search does not find either. It is a space dropped while typing or editing, not a matter of style.'
+
+message:
+  ja: 「{written}」のカンマの後ろに空白がありません
+  en: 'No space after the comma in "{written}"'
+
+how_to_fix:
+  ja: カンマの後ろに空白を一つ入れてください。
+  en: Put one space after the comma.
+
+levels: { strict: error, normal: warning, relaxed: info }
+
+use_for: [business, technical, blog, legal, docs, academic, literature, speech]
+off_for:
+  literature: Older printed texts and poetry set commas tight on purpose, and a transcribed edition keeps the printer's spacing.
+
+group: slips
+summary:
+  ja: 英文の「address,and」のように、語をつなぐカンマの後ろに空白が無い所
+  en: A comma between two words with no space after it, as in "address,and"
+example:
+  en:
+    before: |
+      Send the form to the office address,and keep a copy.
+    after: |
+      Send the form to the office address, and keep a copy.
+
+not_flagged:
+  ja: 英語の文書だけで動きます。値を並べたもの（blue,black,brown のようにカンマが二つ以上）、数字や記号を含むもの（3,000、a,b=c、path/a,b、user@x,y、file_name,size）、引用符で囲んだ値（"true,false"）、二字以下の語（id,x）、コードと URL は見ません。
+  en: 'Only in English documents. A run of values (two or more commas, as in blue,black,brown), a run holding a digit or a mark (3,000, a,b=c, path/a,b, user@x,y, file_name,size), a quoted value ("true,false"), words of one or two letters (id,x), code and URLs are not read.'
+sources: [vale-styles]
+rewrite:
+  depth: light
+  en:
+    direction: Put one space after the marked comma. Change nothing else.
+    pairs:
+      - before: Send it to the office address,and keep a copy.
+        after: Send it to the office address, and keep a copy.
+      - before: If the box is damaged,call us first.
+        after: If the box is damaged, call us first.
+    keep:
+      - the words and their order
+    avoid:
+      - adding spaces inside lists of values or code

package/skills/chaff/SKILL.md

@@ -96,9 +96,26 @@ Pick the easiest way that can say the requirement:
 | Requirement | Use |
 | --- | --- |
 | An existing rule covers it | A level, a number, `prefer`, `jargon` or `required_sections` in `chaff.yaml` |
-| A fixed phrase or pattern, with the team's own message | `custom_rules` of type `words` or `pattern` (coming in the next release) |
-| Decided by part of speech or inflection | `custom_rules` of type `tokens` (coming in the next release) |
-| Counting or comparing that the above cannot express | a Node function, `type: module` (a later release) |
+| A fixed phrase or pattern, with the team's own message | `custom_rules` of type `words` or `pattern` |
+| Decided by part of speech or inflection | `custom_rules` of type `tokens` |
+| Counting or comparing that the above cannot express | a Node function, `type: module` |
+| The same rules shared across repositories | a rule pack of YAML files: `npx chaffjs init --plugin <name>`, then `plugins:` in `chaff.yaml` |
+
+A `words` rule names the words, the team's text for each field `explain` shows, and one example:
+
+```yaml
+custom_rules:
+  - id: banned-word
+    type: words
+    words: [禁止ワード]
+    severity: warning
+    name: { ja: 禁止ワード }
+    why: { ja: この文書で避ける語です }
+    message: { ja: "「{matched}」は使いません" }
+    how_to_fix: { ja: 別の言い方にします }
+    example:
+      ja: { before: 禁止ワードを使った文, after: 別の言い方の文 }
+```
 
 Test a new team rule the same way: `explain`, then a sample it must report and a sample it must not, before
 committing `chaff.yaml`. The guide page "Adding a rule" covers each way and how to add a rule to chaff itself.

package/src/detectors/connective-hierarchy.ts

@@ -0,0 +1,99 @@
+import type { Detector, Finding, LexiconEntry, Sentence, Span, Token } from "../plugin.ts";
+import { escapeRegExp } from "../orthography.ts";
+import { quotedSpans } from "../quoted-span.ts";
+
+// A connective that joins only the outer level of a two-level list, in a sentence with no inner level under it. The
+// lexicon holds both levels: an entry with a rewrite is an outer-level word (rewrite is the word a one-level list uses),
+// and an entry with instead_of is an inner-level word that stands under that outer-level word.
+
+/** One outer-level connective with nothing to stand above, and where it is in the document. */
+export type LoneConnective = { readonly offset: number; readonly written: string; readonly usual: string };
+
+const CONJUNCTION = "CCONJ";
+
+/** The word lists the detector reads: the connectives, and the phrases that hold one's letters without being one (歯並びに). */
+export type ConnectiveLists = { readonly connectives: readonly LexiconEntry[]; readonly lookalikes: readonly LexiconEntry[] };
+
+/**
+ * The tagger does not always tell a connective from a noun and a particle: it reads 申請書並びに as 並び + に and
+ * 文字の並びに as the conjunction. After の, a determiner or an adjective (の並びに, この並びに, 正しい並びに) the word is
+ * a noun of its own. Where the tagger splits it, it is a connective only between two nouns: a noun, a number or a mark
+ * before it, and no verb right after it (一列並びに座る).
+ */
+const MODIFIES_NOUN: ReadonlySet<string> = new Set(["DET", "ADJ"]);
+const GENITIVE = "の";
+const JOINS_AFTER: ReadonlySet<string> = new Set(["NOUN", "PROPN", "NUM", "PUNCT", "SYM"]);
+const ENDS_CLAUSE: ReadonlySet<string> = new Set(["VERB", "AUX"]);
+
+const modifiesNoun = (token: Token | undefined): boolean =>
+  token !== undefined && (MODIFIES_NOUN.has(token.pos) || (token.pos === "ADP" && token.surface === GENITIVE));
+
+const joinsNouns = (previous: Token | undefined, next: Token | undefined): boolean =>
+  previous !== undefined && JOINS_AFTER.has(previous.pos) && next !== undefined && !ENDS_CLAUSE.has(next.pos);
+
+/** A sentence's tokens by where they start and end, and the letters a connective there would not be read in. */
+type Reading = { readonly byStart: ReadonlyMap<number, Token>; readonly byEnd: ReadonlyMap<number, Token>; readonly hidden: readonly boolean[] };
+
+const placesOf = (text: string, word: string): number[] => [...text.matchAll(new RegExp(escapeRegExp(word), "gu"))].map((match) => match.index);
+
+/** Inside 「」 or 『』 (a quoted phrase holds half a list) or inside a lookalike (歯並びに), by the sentence's own offsets. */
+const hiddenLetters = (text: string, lookalikes: readonly LexiconEntry[]): boolean[] => {
+  const hidden = Array.from({ length: text.length }, () => false);
+  const hide = (start: number, end: number): boolean[] => hidden.fill(true, start, end);
+  quotedSpans(text).forEach((span) => hide(span.start, span.end));
+  lookalikes.forEach(({ pattern }) => placesOf(text, pattern).forEach((at) => hide(at, at + pattern.length)));
+  return hidden;
+};
+
+const readingOf = (sentence: Sentence, lookalikes: readonly LexiconEntry[]): Reading => {
+  const tokens = sentence.tokens ?? [];
+  return {
+    byStart: new Map(tokens.map((token) => [token.span.start, token])),
+    byEnd: new Map(tokens.map((token) => [token.span.end, token])),
+    hidden: hiddenLetters(sentence.text, lookalikes),
+  };
+};
+
+const standsAsConnective = (reading: Reading, span: Span): boolean => {
+  const previous = reading.byEnd.get(span.start);
+  if (modifiesNoun(previous)) return false;
+  const own = reading.byStart.get(span.start);
+  const tagged = own !== undefined && own.pos === CONJUNCTION && own.span.end === span.end;
+  return tagged || joinsNouns(previous, reading.byStart.get(span.end));
+};
+
+const hasInnerLevel = (sentence: Sentence, outer: LexiconEntry, connectives: readonly LexiconEntry[]): boolean =>
+  connectives.some((entry) => entry.instead_of === outer.pattern && sentence.text.includes(entry.pattern));
+
+/** Where one outer-level word stands as a connective in the sentence. */
+const connectiveSpans = (sentence: Sentence, outer: LexiconEntry, reading: Reading): Span[] =>
+  placesOf(sentence.text, outer.pattern)
+    .filter((at) => reading.hidden[at] !== true)
+    .map((at) => ({ start: sentence.span.start + at, end: sentence.span.start + at + outer.pattern.length }))
+    .filter((span) => standsAsConnective(reading, span));
+
+/** The outer-level connectives of a sentence that stand over no inner level. */
+export const loneConnectivesIn = (sentence: Sentence, lists: ConnectiveLists): LoneConnective[] => {
+  const lone = lists.connectives.filter(
+    (entry) => entry.rewrite !== undefined && sentence.text.includes(entry.pattern) && !hasInnerLevel(sentence, entry, lists.connectives),
+  );
+  if (lone.length === 0) return [];
+  const reading = readingOf(sentence, lists.lookalikes);
+  return lone
+    .flatMap((entry) => connectiveSpans(sentence, entry, reading).map((span) => ({ offset: span.start, written: entry.pattern, usual: entry.rewrite ?? "" })))
+    .sort((a, b) => a.offset - b.offset);
+};
+
+export const connectiveHierarchy: Detector = (doc, options): Finding[] => {
+  const lists = { connectives: options.lexicon ?? [], lookalikes: doc.lexicons["connective-lookalike"] ?? [] };
+  return doc.sentences.flatMap((sentence) =>
+    loneConnectivesIn(sentence, lists).map((lone) => ({
+      rule: "",
+      severity: "info",
+      line: 0,
+      column: 0,
+      quote: sentence.text.trim(),
+      values: { written: lone.written, usual: lone.usual, offset: lone.offset },
+    })),
+  );
+};

package/src/detectors/missing-final-period.ts

@@ -0,0 +1,79 @@
+import type { Detector, Finding, LexiconEntry, Paragraph, ProseDocument, Token } from "../plugin.ts";
+import { formMinority } from "./form-minority.ts";
+
+// A paragraph whose last sentence stops without its closing mark, in a document whose other paragraphs end with one. It
+// takes no side: a document that ends none of its paragraphs with the mark (slides, labels) is not reported. The marks
+// come from the language's lexicon "final-period": group "end" is the period, group "other-end" closes a sentence another
+// way (？, ！) so the paragraph is not counted, and group "note" opens a note line. The
+// lexicon is read directly rather than as the rule's word list, since its marks are what a fixed paragraph ends with.
+
+/** A paragraph's end, and whether it closes with a sentence-ending mark. form is "closed" or "open". */
+export type ParagraphEnd = { readonly offset: number; readonly form: string; readonly text: string };
+
+/** The marks the detector reads, from the lexicon. */
+export type PeriodMarks = { readonly ends: readonly string[]; readonly otherEnds: readonly string[]; readonly notes: readonly string[] };
+
+/** Brackets and quotes that may follow a closing mark (〜です。」). */
+const CLOSERS = '」』）)"”’';
+/** A line that is itself a quotation closes like a sentence. */
+const QUOTE_CLOSERS = "」』";
+/** A paragraph ending in a colon leads into a list or a block; it is not a sentence left open. */
+const LEAD_IN = /[：:]$/u;
+/** Two spaces in a row, half- or full-width, lay a line out like a table (an ingredient, then its amount), so it is not a sentence. */
+const LAYOUT = /[ \u3000]{2}/u;
+/** Fewer characters than this is a label or a caption, not a sentence. */
+const MIN_SENTENCE_CHARS = 15;
+/** Words that end a clause: a verb, an adjective or an auxiliary in its dictionary form ends the sentence. */
+const PREDICATE: ReadonlySet<string> = new Set(["VERB", "ADJ", "AUX"]);
+
+/** The line's last mark before any closing brackets and quotes is one of these. */
+const endsWithMark = (line: string, marks: readonly string[]): boolean => {
+  const chars = Array.from(line);
+  return marks.includes(chars[chars.findLastIndex((char) => !CLOSERS.includes(char))] ?? "");
+};
+
+const isClosed = (line: string, ends: readonly string[]): boolean => endsWithMark(line, ends) || QUOTE_CLOSERS.includes(line.at(-1) ?? "\0");
+
+/** A note, a laid-out row, or a question or exclamation: not a sentence that could take the period. */
+const isAside = (line: string, marks: PeriodMarks): boolean =>
+  marks.notes.some((note) => line.startsWith(note)) || LAYOUT.test(line) || endsWithMark(line, marks.otherEnds);
+
+/** The paragraph's last word ends a sentence: a predicate written in its dictionary form (〜します, 〜である, 望ましい). */
+const endsInPredicate = (paragraph: Paragraph): boolean => {
+  const last = (paragraph.sentences.at(-1)?.tokens ?? []).filter((token: Token) => token.surface.trim() !== "").at(-1);
+  return last !== undefined && PREDICATE.has(last.pos) && last.lemma === last.surface;
+};
+
+/** How a paragraph ends, or undefined when its last line is not a sentence (a label, a lead-in, a note, a laid-out row). */
+export const paragraphEnd = (text: string, paragraph: Paragraph, marks: PeriodMarks): ParagraphEnd | undefined => {
+  const body = text.slice(paragraph.span.start, paragraph.span.end).trimEnd();
+  const last = body.split("\n").at(-1)?.trim() ?? "";
+  if (Array.from(last).length < MIN_SENTENCE_CHARS || LEAD_IN.test(last)) return undefined;
+  const offset = paragraph.span.start + body.length - 1;
+  if (isAside(last, marks)) return undefined;
+  if (isClosed(last, marks.ends)) return { offset, form: "closed", text: last };
+  // A closing parenthetical after the sentence (〜します（別紙を参照する）) is not where the period goes.
+  return !CLOSERS.includes(last.at(-1) ?? "\0") && endsInPredicate(paragraph) ? { offset, form: "open", text: last } : undefined;
+};
+
+const marksOf = (lexicon: readonly LexiconEntry[]): PeriodMarks => ({
+  ends: lexicon.filter((entry) => entry.group === "end").map((entry) => entry.pattern),
+  otherEnds: lexicon.filter((entry) => entry.group === "other-end").map((entry) => entry.pattern),
+  notes: lexicon.filter((entry) => entry.group === "note").map((entry) => entry.pattern),
+});
+
+export const missingFinalPeriod: Detector = (doc: ProseDocument, options): Finding[] => {
+  const text = doc.prose ?? doc.source;
+  const marks = marksOf(doc.lexicons["final-period"] ?? []);
+  const ends = doc.paragraphs.flatMap((paragraph) => paragraphEnd(text, paragraph, marks) ?? []);
+  const minority = formMinority(ends, options.limit);
+  if (minority === undefined || minority.usual.form !== "closed") return [];
+  return minority.odd.map((end) => ({
+    rule: "",
+    severity: "info",
+    line: 0,
+    column: 0,
+    quote: end.text,
+    values: { count: minority.odd.length, of: ends.length, offset: end.offset },
+  }));
+};

package/src/detectors/missing-space-after-comma.ts

@@ -0,0 +1,54 @@
+import type { Detector, Finding } from "../plugin.ts";
+import { quoteAround } from "./quote-around.ts";
+
+// A comma between two words with no space after it ("address,and"): a slip in English prose. A run of values joined by
+// commas ("blue,black,brown"), and anything inside an address, a path or an assignment, is data, not prose.
+
+/** One comma with no space after it, where it is, and the two words it joins as written. */
+export type TightComma = { readonly offset: number; readonly written: string };
+
+/** A word of three letters or more (a possessive 's may follow), a comma, and a lower-case word of three letters or more. */
+const JOINED = /(?<![\p{L}\p{N}])[A-Za-z]{3,}(?:['’]s)?,[a-z]{3,}(?![\p{L}\p{N}])/u;
+/** Characters that make a run of text an address, a path, a parameter or data (a=b, a/b, a.b, @a, #a, a_b, 3,abc). */
+const DATA_MARK = /[/\\=@#:.&?_|+*~$%^<>{}[\]\p{N}]/u;
+/** Opening and closing marks a word of prose may carry ("(and,then)"), and the sentence's own end ("and,then."). */
+const OPENERS = "(\"'“‘[";
+const CLOSERS = ")\"'”’].,;!?";
+/** A run quoted whole, inside brackets or not ("true,false", ("true,false")): a value written out, not two words of the sentence. */
+const QUOTED_WHOLE = /^[([]*["'“‘].*["'”’][)\].,;!?]*$/u;
+/** A run of text between whitespace. */
+const RUN = /\S+/gu;
+const COMMA = ",";
+
+/** The run without the marks around it, trimmed by scanning rather than by a pattern that could backtrack. */
+const bareOf = (run: string): string => {
+  const chars = run.split("");
+  const start = chars.findIndex((char) => !OPENERS.includes(char));
+  const end = chars.findLastIndex((char) => !CLOSERS.includes(char));
+  return start === -1 || end < start ? "" : run.slice(start, end + 1);
+};
+
+/** A run holding one comma and nothing that marks it as data. */
+const isProseRun = (run: string): boolean => {
+  const bare = bareOf(run);
+  return bare.split(COMMA).length === 2 && !DATA_MARK.test(bare) && !QUOTED_WHOLE.test(run);
+};
+
+/** Each run is read once, so a long line of values costs one pass. */
+export const tightCommasIn = (text: string): TightComma[] =>
+  [...text.matchAll(RUN)].flatMap((run) => {
+    const joined = isProseRun(run[0]) ? JOINED.exec(run[0]) : null;
+    return joined === null ? [] : [{ offset: run.index + joined.index + joined[0].indexOf(COMMA), written: joined[0] }];
+  });
+
+export const missingSpaceAfterComma: Detector = (doc): Finding[] => {
+  const text = doc.prose ?? doc.source;
+  return tightCommasIn(text).map((comma) => ({
+    rule: "",
+    severity: "warning",
+    line: 0,
+    column: 0,
+    quote: quoteAround(text, comma.offset, comma.offset + 1),
+    values: { written: comma.written, offset: comma.offset },
+  }));
+};

package/src/detectors/registry/connective-hierarchy.ts

@@ -0,0 +1,4 @@
+import type { Detector } from "../../plugin.ts";
+import { connectiveHierarchy } from "../connective-hierarchy.ts";
+
+export const detector: Detector = connectiveHierarchy;

package/src/detectors/registry/missing-final-period.ts

@@ -0,0 +1,4 @@
+import type { Detector } from "../../plugin.ts";
+import { missingFinalPeriod } from "../missing-final-period.ts";
+
+export const detector: Detector = missingFinalPeriod;

package/src/detectors/registry/missing-space-after-comma.ts

@@ -0,0 +1,4 @@
+import type { Detector } from "../../plugin.ts";
+import { missingSpaceAfterComma } from "../missing-space-after-comma.ts";
+
+export const detector: Detector = missingSpaceAfterComma;