wiki-graph-core 0.3.1 → 0.4.1

package/dist/graph/evidence-selection/quote-score.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/graph/evidence-selection/quote-score.ts"],"sourcesContent":["const EXACT_SCORE = 1;\nconst NORMALIZED_EXACT_SCORE = 0.995;\nconst SUBSTRING_BASE_SCORE = 0.95;\nconst SUBSTRING_COVERAGE_BONUS = 0.04;\nconst FUZZY_MIN_WINDOW_RATIO = 0.72;\nconst FUZZY_MAX_WINDOW_RATIO = 2.25;\nconst UNORDERED_PENALTY_THRESHOLD = 0.75;\nconst LOW_ORDERED_PENALTY_THRESHOLD = 0.45;\n\nconst CASE_FOLDING_OVERRIDES = new Map<string, string>([\n  [\"ß\", \"ss\"],\n  [\"ẞ\", \"ss\"],\n  [\"ς\", \"σ\"],\n]);\n\nexport type EvidenceQuoteMatchStrategy =\n  | \"empty\"\n  | \"exact\"\n  | \"normalized_exact\"\n  | \"normalized_substring\"\n  | \"fuzzy_window\";\n\nexport interface EvidenceQuoteScore {\n  readonly exactRaw: boolean;\n  readonly exactNormalized: boolean;\n  readonly exactSubstring: boolean;\n  readonly matchEnd: number;\n  readonly matchStart: number;\n  readonly normalizedQuote: string;\n  readonly normalizedSentence: string;\n  readonly score: number;\n  readonly strategy: EvidenceQuoteMatchStrategy;\n}\n\nexport interface PreparedEvidenceQuote {\n  readonly normalizedQuote: string;\n  readonly quoteRaw: string;\n}\n\nexport function normalizeEvidenceDisplayText(text: string): string {\n  return text\n    .replace(/\\p{Default_Ignorable_Code_Point}/gu, \"\")\n    .normalize(\"NFKC\")\n    .replace(/\\s+/gu, \" \")\n    .trim();\n}\n\nexport function normalizeEvidenceText(text: string): string {\n  const separated = replaceSeparatorsWithSpace(text);\n  const stripped = separated.replace(/\\p{Default_Ignorable_Code_Point}/gu, \"\");\n  const compatible = stripped.normalize(\"NFKC\");\n  const folded = caseFold(compatible);\n  const decomposed = folded.normalize(\"NFD\").replace(/\\p{M}/gu, \"\");\n  const reseparated = replaceSeparatorsWithSpace(decomposed);\n\n  return reseparated.replace(/ +/gu, \" \").trim();\n}\n\nexport function scoreEvidenceQuote(input: {\n  readonly quote: string;\n  readonly sentence: string;\n}): EvidenceQuoteScore {\n  return scorePreparedEvidenceQuote({\n    preparedQuote: prepareEvidenceQuote(input.quote),\n    sentence: input.sentence,\n  });\n}\n\nexport function prepareEvidenceQuote(quote: string): PreparedEvidenceQuote {\n  const quoteRaw = stripMarkup(quote).trim();\n\n  return {\n    normalizedQuote: normalizeEvidenceText(quoteRaw),\n    quoteRaw,\n  };\n}\n\nexport function scorePreparedEvidenceQuote(input: {\n  readonly preparedQuote: PreparedEvidenceQuote;\n  readonly sentence: string;\n}): EvidenceQuoteScore {\n  const { normalizedQuote, quoteRaw } = input.preparedQuote;\n  const sentenceRaw = stripMarkup(input.sentence).trim();\n  const normalizedSentence = normalizeEvidenceText(sentenceRaw);\n\n  if (normalizedQuote === \"\" || normalizedSentence === \"\") {\n    return createEmptyScore(normalizedQuote, normalizedSentence);\n  }\n\n  if (quoteRaw === sentenceRaw) {\n    return {\n      exactNormalized: true,\n      exactRaw: true,\n      exactSubstring: true,\n      matchEnd: normalizedSentence.length,\n      matchStart: 0,\n      normalizedQuote,\n      normalizedSentence,\n      score: EXACT_SCORE,\n      strategy: \"exact\",\n    };\n  }\n\n  if (normalizedQuote === normalizedSentence) {\n    return {\n      exactNormalized: true,\n      exactRaw: false,\n      exactSubstring: true,\n      matchEnd: normalizedSentence.length,\n      matchStart: 0,\n      normalizedQuote,\n      normalizedSentence,\n      score: NORMALIZED_EXACT_SCORE,\n      strategy: \"normalized_exact\",\n    };\n  }\n\n  const substringStart = normalizedSentence.indexOf(normalizedQuote);\n\n  if (substringStart !== -1) {\n    const coverage =\n      normalizedQuote.length / Math.max(1, normalizedSentence.length);\n\n    return {\n      exactNormalized: false,\n      exactRaw: false,\n      exactSubstring: true,\n      matchEnd: substringStart + normalizedQuote.length,\n      matchStart: substringStart,\n      normalizedQuote,\n      normalizedSentence,\n      score: Math.min(\n        0.99,\n        SUBSTRING_BASE_SCORE + SUBSTRING_COVERAGE_BONUS * coverage,\n      ),\n      strategy: \"normalized_substring\",\n    };\n  }\n\n  return scoreBestFuzzyWindow(normalizedQuote, normalizedSentence);\n}\n\nfunction scoreBestFuzzyWindow(\n  normalizedQuote: string,\n  normalizedSentence: string,\n): EvidenceQuoteScore {\n  const minWindow = Math.max(\n    1,\n    Math.floor(normalizedQuote.length * FUZZY_MIN_WINDOW_RATIO),\n  );\n  const maxWindow = Math.min(\n    normalizedSentence.length,\n    Math.max(\n      minWindow,\n      Math.ceil(normalizedQuote.length * FUZZY_MAX_WINDOW_RATIO),\n    ),\n  );\n  let best: EvidenceQuoteScore = createEmptyScore(\n    normalizedQuote,\n    normalizedSentence,\n  );\n\n  for (let windowSize = minWindow; windowSize <= maxWindow; windowSize += 1) {\n    for (\n      let start = 0;\n      start <= normalizedSentence.length - windowSize;\n      start += 1\n    ) {\n      const window = normalizedSentence.slice(start, start + windowSize);\n      const score = scoreWindow(normalizedQuote, window);\n\n      if (score <= best.score) {\n        continue;\n      }\n\n      best = {\n        exactNormalized: false,\n        exactRaw: false,\n        exactSubstring: false,\n        matchEnd: start + windowSize,\n        matchStart: start,\n        normalizedQuote,\n        normalizedSentence,\n        score,\n        strategy: \"fuzzy_window\",\n      };\n    }\n  }\n\n  return best;\n}\n\nfunction scoreWindow(quote: string, window: string): number {\n  const editScore = levenshteinSimilarity(quote, window);\n  const substringScore = longestCommonSubstringScore(quote, window);\n  const subsequenceScore = longestCommonSubsequenceScore(quote, window);\n  const orderedCoverageScore = orderedCoverage(quote, window);\n  const ngramScore = charNgramScore(quote, window);\n  const lengthScore = lengthSimilarity(quote, window);\n  const unorderedScore = unorderedCharOverlapScore(quote, window);\n  const orderedScore = Math.max(\n    editScore,\n    substringScore,\n    subsequenceScore,\n    orderedCoverageScore,\n  );\n  let score =\n    0.2 * editScore +\n    0.18 * substringScore +\n    0.24 * subsequenceScore +\n    0.2 * orderedCoverageScore +\n    0.08 * ngramScore +\n    0.05 * lengthScore +\n    0.05 * unorderedScore;\n\n  if (\n    unorderedScore >= UNORDERED_PENALTY_THRESHOLD &&\n    orderedScore < LOW_ORDERED_PENALTY_THRESHOLD\n  ) {\n    score *= 0.65;\n  }\n\n  return Math.max(0, Math.min(1, score));\n}\n\nfunction normalizeScalar(char: string): string {\n  return CASE_FOLDING_OVERRIDES.get(char) ?? char.toLocaleLowerCase(\"und\");\n}\n\nfunction caseFold(text: string): string {\n  let folded = \"\";\n\n  for (const char of text) {\n    folded += normalizeScalar(char);\n  }\n\n  return folded;\n}\n\nfunction replaceSeparatorsWithSpace(text: string): string {\n  let output = \"\";\n\n  for (const char of text) {\n    output += isPreservedSymbol(char) || !isSeparator(char) ? char : \" \";\n  }\n\n  return output;\n}\n\nfunction isPreservedSymbol(char: string): boolean {\n  return char === \"+\" || char === \"#\" || char === \"&\";\n}\n\nfunction isSeparator(char: string): boolean {\n  return (\n    /\\s/u.test(char) ||\n    /\\p{Separator}/u.test(char) ||\n    /[\\p{Dash_Punctuation}\\p{Connector_Punctuation}\\p{Initial_Punctuation}\\p{Final_Punctuation}\\p{Open_Punctuation}\\p{Close_Punctuation}\\p{Other_Punctuation}]/u.test(\n      char,\n    ) ||\n    /[\\\\/.。．｡、，,：:；;！!？?·・•|]/u.test(char)\n  );\n}\n\nfunction stripMarkup(text: string): string {\n  return text.replace(/<\\/?(?:mention|quote)\\b[^>]*>/giu, \"\");\n}\n\nfunction createEmptyScore(\n  normalizedQuote: string,\n  normalizedSentence: string,\n): EvidenceQuoteScore {\n  return {\n    exactNormalized: false,\n    exactRaw: false,\n    exactSubstring: false,\n    matchEnd: -1,\n    matchStart: -1,\n    normalizedQuote,\n    normalizedSentence,\n    score: 0,\n    strategy: \"empty\",\n  };\n}\n\nfunction charNgramScore(left: string, right: string): number {\n  const bigramScore = diceCoefficient(\n    charNgrams(left, 2),\n    charNgrams(right, 2),\n  );\n  const trigramScore = diceCoefficient(\n    charNgrams(left, 3),\n    charNgrams(right, 3),\n  );\n\n  return (bigramScore + trigramScore) / 2;\n}\n\nfunction charNgrams(text: string, size: number): ReadonlySet<string> {\n  if (text.length <= size) {\n    return text === \"\" ? new Set() : new Set([text]);\n  }\n\n  const result = new Set<string>();\n\n  for (let index = 0; index <= text.length - size; index += 1) {\n    result.add(text.slice(index, index + size));\n  }\n\n  return result;\n}\n\nfunction diceCoefficient(\n  left: ReadonlySet<string>,\n  right: ReadonlySet<string>,\n): number {\n  if (left.size === 0 || right.size === 0) {\n    return 0;\n  }\n\n  let overlap = 0;\n\n  for (const value of left) {\n    if (right.has(value)) {\n      overlap += 1;\n    }\n  }\n\n  return (2 * overlap) / (left.size + right.size);\n}\n\nfunction lengthSimilarity(left: string, right: string): number {\n  return (\n    1 -\n    Math.abs(left.length - right.length) / Math.max(left.length, right.length)\n  );\n}\n\nfunction levenshteinSimilarity(left: string, right: string): number {\n  if (left === right) {\n    return 1;\n  }\n  if (left === \"\" || right === \"\") {\n    return 0;\n  }\n\n  let previous = Array.from({ length: right.length + 1 }, (_, index) => index);\n  let current = new Array<number>(right.length + 1).fill(0);\n  const leftChars = [...left];\n  const rightChars = [...right];\n\n  for (const [leftIndex, leftChar] of leftChars.entries()) {\n    current[0] = leftIndex + 1;\n\n    for (const [rightIndex, rightChar] of rightChars.entries()) {\n      const insertCost = (current[rightIndex] ?? 0) + 1;\n      const deleteCost = (previous[rightIndex + 1] ?? 0) + 1;\n      const replaceCost =\n        (previous[rightIndex] ?? 0) + (leftChar === rightChar ? 0 : 1);\n\n      current[rightIndex + 1] = Math.min(insertCost, deleteCost, replaceCost);\n    }\n\n    [previous, current] = [current, previous];\n  }\n\n  const distance =\n    previous[rightChars.length] ?? Math.max(left.length, right.length);\n\n  return 1 - distance / Math.max(left.length, right.length);\n}\n\nfunction longestCommonSubstringScore(left: string, right: string): number {\n  if (left === \"\" || right === \"\") {\n    return 0;\n  }\n\n  const leftChars = [...left];\n  const rightChars = [...right];\n  let previous = new Array<number>(rightChars.length + 1).fill(0);\n  let current = new Array<number>(rightChars.length + 1).fill(0);\n  let longest = 0;\n\n  for (let leftIndex = 1; leftIndex <= leftChars.length; leftIndex += 1) {\n    for (let rightIndex = 1; rightIndex <= rightChars.length; rightIndex += 1) {\n      current[rightIndex] =\n        leftChars[leftIndex - 1] === rightChars[rightIndex - 1]\n          ? (previous[rightIndex - 1] ?? 0) + 1\n          : 0;\n      longest = Math.max(longest, current[rightIndex] ?? 0);\n    }\n\n    [previous, current] = [current, previous];\n    current.fill(0);\n  }\n\n  return (2 * longest) / (leftChars.length + rightChars.length);\n}\n\nfunction longestCommonSubsequenceScore(left: string, right: string): number {\n  if (left === \"\" || right === \"\") {\n    return 0;\n  }\n\n  const leftChars = [...left];\n  const rightChars = [...right];\n  let previous = new Array<number>(rightChars.length + 1).fill(0);\n  let current = new Array<number>(rightChars.length + 1).fill(0);\n\n  for (let leftIndex = 1; leftIndex <= leftChars.length; leftIndex += 1) {\n    for (let rightIndex = 1; rightIndex <= rightChars.length; rightIndex += 1) {\n      current[rightIndex] =\n        leftChars[leftIndex - 1] === rightChars[rightIndex - 1]\n          ? (previous[rightIndex - 1] ?? 0) + 1\n          : Math.max(previous[rightIndex] ?? 0, current[rightIndex - 1] ?? 0);\n    }\n\n    [previous, current] = [current, previous];\n    current.fill(0);\n  }\n\n  const longest = previous[rightChars.length] ?? 0;\n\n  return (2 * longest) / (leftChars.length + rightChars.length);\n}\n\nfunction orderedCoverage(left: string, right: string): number {\n  if (left === \"\" || right === \"\") {\n    return 0;\n  }\n\n  const leftChars = [...left];\n  const rightChars = [...right];\n  let previous = new Array<number>(rightChars.length + 1).fill(0);\n  let current = new Array<number>(rightChars.length + 1).fill(0);\n\n  for (let leftIndex = 1; leftIndex <= leftChars.length; leftIndex += 1) {\n    for (let rightIndex = 1; rightIndex <= rightChars.length; rightIndex += 1) {\n      current[rightIndex] =\n        leftChars[leftIndex - 1] === rightChars[rightIndex - 1]\n          ? (previous[rightIndex - 1] ?? 0) + 1\n          : Math.max(previous[rightIndex] ?? 0, current[rightIndex - 1] ?? 0);\n    }\n\n    [previous, current] = [current, previous];\n    current.fill(0);\n  }\n\n  return (previous[rightChars.length] ?? 0) / leftChars.length;\n}\n\nfunction unorderedCharOverlapScore(left: string, right: string): number {\n  const leftCounts = countChars(left);\n  const rightCounts = countChars(right);\n  let overlap = 0;\n  let total = 0;\n\n  for (const [char, leftCount] of leftCounts) {\n    const rightCount = rightCounts.get(char) ?? 0;\n\n    overlap += Math.min(leftCount, rightCount);\n    total += leftCount;\n  }\n\n  return total === 0 ? 0 : overlap / total;\n}\n\nfunction countChars(text: string): Map<string, number> {\n  const counts = new Map<string, number>();\n\n  for (const char of text) {\n    counts.set(char, (counts.get(char) ?? 0) + 1);\n  }\n\n  return counts;\n}\n"],"mappings":"AAAA,MAAM,cAAc;AACpB,MAAM,yBAAyB;AAC/B,MAAM,uBAAuB;AAC7B,MAAM,2BAA2B;AACjC,MAAM,yBAAyB;AAC/B,MAAM,yBAAyB;AAC/B,MAAM,8BAA8B;AACpC,MAAM,gCAAgC;AAEtC,MAAM,yBAAyB,oBAAI,IAAoB;AAAA,EACrD,CAAC,QAAK,IAAI;AAAA,EACV,CAAC,UAAK,IAAI;AAAA,EACV,CAAC,UAAK,QAAG;AACX,CAAC;AA0BM,SAAS,6BAA6B,MAAsB;AACjE,SAAO,KACJ,QAAQ,WAAC,qCAAiC,IAAE,GAAE,EAAE,EAChD,UAAU,MAAM,EAChB,QAAQ,SAAS,GAAG,EACpB,KAAK;AACV;AAEO,SAAS,sBAAsB,MAAsB;AAC1D,QAAM,YAAY,2BAA2B,IAAI;AACjD,QAAM,WAAW,UAAU,QAAQ,WAAC,qCAAiC,IAAE,GAAE,EAAE;AAC3E,QAAM,aAAa,SAAS,UAAU,MAAM;AAC5C,QAAM,SAAS,SAAS,UAAU;AAClC,QAAM,aAAa,OAAO,UAAU,KAAK,EAAE,QAAQ,WAAC,UAAM,IAAE,GAAE,EAAE;AAChE,QAAM,cAAc,2BAA2B,UAAU;AAEzD,SAAO,YAAY,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAC/C;AAEO,SAAS,mBAAmB,OAGZ;AACrB,SAAO,2BAA2B;AAAA,IAChC,eAAe,qBAAqB,MAAM,KAAK;AAAA,IAC/C,UAAU,MAAM;AAAA,EAClB,CAAC;AACH;AAEO,SAAS,qBAAqB,OAAsC;AACzE,QAAM,WAAW,YAAY,KAAK,EAAE,KAAK;AAEzC,SAAO;AAAA,IACL,iBAAiB,sBAAsB,QAAQ;AAAA,IAC/C;AAAA,EACF;AACF;AAEO,SAAS,2BAA2B,OAGpB;AACrB,QAAM,EAAE,iBAAiB,SAAS,IAAI,MAAM;AAC5C,QAAM,cAAc,YAAY,MAAM,QAAQ,EAAE,KAAK;AACrD,QAAM,qBAAqB,sBAAsB,WAAW;AAE5D,MAAI,oBAAoB,MAAM,uBAAuB,IAAI;AACvD,WAAO,iBAAiB,iBAAiB,kBAAkB;AAAA,EAC7D;AAEA,MAAI,aAAa,aAAa;AAC5B,WAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,UAAU,mBAAmB;AAAA,MAC7B,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,MAAI,oBAAoB,oBAAoB;AAC1C,WAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,UAAU,mBAAmB;AAAA,MAC7B,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,QAAM,iBAAiB,mBAAmB,QAAQ,eAAe;AAEjE,MAAI,mBAAmB,IAAI;AACzB,UAAM,WACJ,gBAAgB,SAAS,KAAK,IAAI,GAAG,mBAAmB,MAAM;AAEhE,WAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,UAAU,iBAAiB,gBAAgB;AAAA,MAC3C,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,MACA,OAAO,KAAK;AAAA,QACV;AAAA,QACA,uBAAuB,2BAA2B;AAAA,MACpD;AAAA,MACA,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,SAAO,qBAAqB,iBAAiB,kBAAkB;AACjE;AAEA,SAAS,qBACP,iBACA,oBACoB;AACpB,QAAM,YAAY,KAAK;AAAA,IACrB;AAAA,IACA,KAAK,MAAM,gBAAgB,SAAS,sBAAsB;AAAA,EAC5D;AACA,QAAM,YAAY,KAAK;AAAA,IACrB,mBAAmB;AAAA,IACnB,KAAK;AAAA,MACH;AAAA,MACA,KAAK,KAAK,gBAAgB,SAAS,sBAAsB;AAAA,IAC3D;AAAA,EACF;AACA,MAAI,OAA2B;AAAA,IAC7B;AAAA,IACA;AAAA,EACF;AAEA,WAAS,aAAa,WAAW,cAAc,WAAW,cAAc,GAAG;AACzE,aACM,QAAQ,GACZ,SAAS,mBAAmB,SAAS,YACrC,SAAS,GACT;AACA,YAAM,SAAS,mBAAmB,MAAM,OAAO,QAAQ,UAAU;AACjE,YAAM,QAAQ,YAAY,iBAAiB,MAAM;AAEjD,UAAI,SAAS,KAAK,OAAO;AACvB;AAAA,MACF;AAEA,aAAO;AAAA,QACL,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,UAAU,QAAQ;AAAA,QAClB,YAAY;AAAA,QACZ;AAAA,QACA;AAAA,QACA;AAAA,QACA,UAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,YAAY,OAAe,QAAwB;AAC1D,QAAM,YAAY,sBAAsB,OAAO,MAAM;AACrD,QAAM,iBAAiB,4BAA4B,OAAO,MAAM;AAChE,QAAM,mBAAmB,8BAA8B,OAAO,MAAM;AACpE,QAAM,uBAAuB,gBAAgB,OAAO,MAAM;AAC1D,QAAM,aAAa,eAAe,OAAO,MAAM;AAC/C,QAAM,cAAc,iBAAiB,OAAO,MAAM;AAClD,QAAM,iBAAiB,0BAA0B,OAAO,MAAM;AAC9D,QAAM,eAAe,KAAK;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,MAAI,QACF,MAAM,YACN,OAAO,iBACP,OAAO,mBACP,MAAM,uBACN,OAAO,aACP,OAAO,cACP,OAAO;AAET,MACE,kBAAkB,+BAClB,eAAe,+BACf;AACA,aAAS;AAAA,EACX;AAEA,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,SAAS,gBAAgB,MAAsB;AAC7C,SAAO,uBAAuB,IAAI,IAAI,KAAK,KAAK,kBAAkB,KAAK;AACzE;AAEA,SAAS,SAAS,MAAsB;AACtC,MAAI,SAAS;AAEb,aAAW,QAAQ,MAAM;AACvB,cAAU,gBAAgB,IAAI;AAAA,EAChC;AAEA,SAAO;AACT;AAEA,SAAS,2BAA2B,MAAsB;AACxD,MAAI,SAAS;AAEb,aAAW,QAAQ,MAAM;AACvB,cAAU,kBAAkB,IAAI,KAAK,CAAC,YAAY,IAAI,IAAI,OAAO;AAAA,EACnE;AAEA,SAAO;AACT;AAEA,SAAS,kBAAkB,MAAuB;AAChD,SAAO,SAAS,OAAO,SAAS,OAAO,SAAS;AAClD;AAEA,SAAS,YAAY,MAAuB;AAC1C,SACE,MAAM,KAAK,IAAI,KACf,WAAC,kBAAc,GAAC,EAAC,KAAK,IAAI,KAC1B,6JAA6J;AAAA,IAC3J;AAAA,EACF,KACA,4BAA4B,KAAK,IAAI;AAEzC;AAEA,SAAS,YAAY,MAAsB;AACzC,SAAO,KAAK,QAAQ,oCAAoC,EAAE;AAC5D;AAEA,SAAS,iBACP,iBACA,oBACoB;AACpB,SAAO;AAAA,IACL,iBAAiB;AAAA,IACjB,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,UAAU;AAAA,EACZ;AACF;AAEA,SAAS,eAAe,MAAc,OAAuB;AAC3D,QAAM,cAAc;AAAA,IAClB,WAAW,MAAM,CAAC;AAAA,IAClB,WAAW,OAAO,CAAC;AAAA,EACrB;AACA,QAAM,eAAe;AAAA,IACnB,WAAW,MAAM,CAAC;AAAA,IAClB,WAAW,OAAO,CAAC;AAAA,EACrB;AAEA,UAAQ,cAAc,gBAAgB;AACxC;AAEA,SAAS,WAAW,MAAc,MAAmC;AACnE,MAAI,KAAK,UAAU,MAAM;AACvB,WAAO,SAAS,KAAK,oBAAI,IAAI,IAAI,oBAAI,IAAI,CAAC,IAAI,CAAC;AAAA,EACjD;AAEA,QAAM,SAAS,oBAAI,IAAY;AAE/B,WAAS,QAAQ,GAAG,SAAS,KAAK,SAAS,MAAM,SAAS,GAAG;AAC3D,WAAO,IAAI,KAAK,MAAM,OAAO,QAAQ,IAAI,CAAC;AAAA,EAC5C;AAEA,SAAO;AACT;AAEA,SAAS,gBACP,MACA,OACQ;AACR,MAAI,KAAK,SAAS,KAAK,MAAM,SAAS,GAAG;AACvC,WAAO;AAAA,EACT;AAEA,MAAI,UAAU;AAEd,aAAW,SAAS,MAAM;AACxB,QAAI,MAAM,IAAI,KAAK,GAAG;AACpB,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAQ,IAAI,WAAY,KAAK,OAAO,MAAM;AAC5C;AAEA,SAAS,iBAAiB,MAAc,OAAuB;AAC7D,SACE,IACA,KAAK,IAAI,KAAK,SAAS,MAAM,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAE7E;AAEA,SAAS,sBAAsB,MAAc,OAAuB;AAClE,MAAI,SAAS,OAAO;AAClB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,MAAM,UAAU,IAAI;AAC/B,WAAO;AAAA,EACT;AAEA,MAAI,WAAW,MAAM,KAAK,EAAE,QAAQ,MAAM,SAAS,EAAE,GAAG,CAAC,GAAG,UAAU,KAAK;AAC3E,MAAI,UAAU,IAAI,MAAc,MAAM,SAAS,CAAC,EAAE,KAAK,CAAC;AACxD,QAAM,YAAY,CAAC,GAAG,IAAI;AAC1B,QAAM,aAAa,CAAC,GAAG,KAAK;AAE5B,aAAW,CAAC,WAAW,QAAQ,KAAK,UAAU,QAAQ,GAAG;AACvD,YAAQ,CAAC,IAAI,YAAY;AAEzB,eAAW,CAAC,YAAY,SAAS,KAAK,WAAW,QAAQ,GAAG;AAC1D,YAAM,cAAc,QAAQ,UAAU,KAAK,KAAK;AAChD,YAAM,cAAc,SAAS,aAAa,CAAC,KAAK,KAAK;AACrD,YAAM,eACH,SAAS,UAAU,KAAK,MAAM,aAAa,YAAY,IAAI;AAE9D,cAAQ,aAAa,CAAC,IAAI,KAAK,IAAI,YAAY,YAAY,WAAW;AAAA,IACxE;AAEA,KAAC,UAAU,OAAO,IAAI,CAAC,SAAS,QAAQ;AAAA,EAC1C;AAEA,QAAM,WACJ,SAAS,WAAW,MAAM,KAAK,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAEnE,SAAO,IAAI,WAAW,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAC1D;AAEA,SAAS,4BAA4B,MAAc,OAAuB;AACxE,MAAI,SAAS,MAAM,UAAU,IAAI;AAC/B,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,CAAC,GAAG,IAAI;AAC1B,QAAM,aAAa,CAAC,GAAG,KAAK;AAC5B,MAAI,WAAW,IAAI,MAAc,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AAC9D,MAAI,UAAU,IAAI,MAAc,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AAC7D,MAAI,UAAU;AAEd,WAAS,YAAY,GAAG,aAAa,UAAU,QAAQ,aAAa,GAAG;AACrE,aAAS,aAAa,GAAG,cAAc,WAAW,QAAQ,cAAc,GAAG;AACzE,cAAQ,UAAU,IAChB,UAAU,YAAY,CAAC,MAAM,WAAW,aAAa,CAAC,KACjD,SAAS,aAAa,CAAC,KAAK,KAAK,IAClC;AACN,gBAAU,KAAK,IAAI,SAAS,QAAQ,UAAU,KAAK,CAAC;AAAA,IACtD;AAEA,KAAC,UAAU,OAAO,IAAI,CAAC,SAAS,QAAQ;AACxC,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,SAAQ,IAAI,WAAY,UAAU,SAAS,WAAW;AACxD;AAEA,SAAS,8BAA8B,MAAc,OAAuB;AAC1E,MAAI,SAAS,MAAM,UAAU,IAAI;AAC/B,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,CAAC,GAAG,IAAI;AAC1B,QAAM,aAAa,CAAC,GAAG,KAAK;AAC5B,MAAI,WAAW,IAAI,MAAc,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AAC9D,MAAI,UAAU,IAAI,MAAc,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AAE7D,WAAS,YAAY,GAAG,aAAa,UAAU,QAAQ,aAAa,GAAG;AACrE,aAAS,aAAa,GAAG,cAAc,WAAW,QAAQ,cAAc,GAAG;AACzE,cAAQ,UAAU,IAChB,UAAU,YAAY,CAAC,MAAM,WAAW,aAAa,CAAC,KACjD,SAAS,aAAa,CAAC,KAAK,KAAK,IAClC,KAAK,IAAI,SAAS,UAAU,KAAK,GAAG,QAAQ,aAAa,CAAC,KAAK,CAAC;AAAA,IACxE;AAEA,KAAC,UAAU,OAAO,IAAI,CAAC,SAAS,QAAQ;AACxC,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,QAAM,UAAU,SAAS,WAAW,MAAM,KAAK;AAE/C,SAAQ,IAAI,WAAY,UAAU,SAAS,WAAW;AACxD;AAEA,SAAS,gBAAgB,MAAc,OAAuB;AAC5D,MAAI,SAAS,MAAM,UAAU,IAAI;AAC/B,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,CAAC,GAAG,IAAI;AAC1B,QAAM,aAAa,CAAC,GAAG,KAAK;AAC5B,MAAI,WAAW,IAAI,MAAc,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AAC9D,MAAI,UAAU,IAAI,MAAc,WAAW,SAAS,CAAC,EAAE,KAAK,CAAC;AAE7D,WAAS,YAAY,GAAG,aAAa,UAAU,QAAQ,aAAa,GAAG;AACrE,aAAS,aAAa,GAAG,cAAc,WAAW,QAAQ,cAAc,GAAG;AACzE,cAAQ,UAAU,IAChB,UAAU,YAAY,CAAC,MAAM,WAAW,aAAa,CAAC,KACjD,SAAS,aAAa,CAAC,KAAK,KAAK,IAClC,KAAK,IAAI,SAAS,UAAU,KAAK,GAAG,QAAQ,aAAa,CAAC,KAAK,CAAC;AAAA,IACxE;AAEA,KAAC,UAAU,OAAO,IAAI,CAAC,SAAS,QAAQ;AACxC,YAAQ,KAAK,CAAC;AAAA,EAChB;AAEA,UAAQ,SAAS,WAAW,MAAM,KAAK,KAAK,UAAU;AACxD;AAEA,SAAS,0BAA0B,MAAc,OAAuB;AACtE,QAAM,aAAa,WAAW,IAAI;AAClC,QAAM,cAAc,WAAW,KAAK;AACpC,MAAI,UAAU;AACd,MAAI,QAAQ;AAEZ,aAAW,CAAC,MAAM,SAAS,KAAK,YAAY;AAC1C,UAAM,aAAa,YAAY,IAAI,IAAI,KAAK;AAE5C,eAAW,KAAK,IAAI,WAAW,UAAU;AACzC,aAAS;AAAA,EACX;AAEA,SAAO,UAAU,IAAI,IAAI,UAAU;AACrC;AAEA,SAAS,WAAW,MAAmC;AACrD,QAAM,SAAS,oBAAI,IAAoB;AAEvC,aAAW,QAAQ,MAAM;AACvB,WAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,EAC9C;AAEA,SAAO;AACT;","names":[]}

package/dist/graph/evidence-selection/resolver.js

@@ -0,0 +1,303 @@
+import {
+  normalizeEvidenceDisplayText,
+  prepareEvidenceQuote,
+  scorePreparedEvidenceQuote
+} from "./quote-score.js";
+import { splitTextIntoSentences } from "./text.js";
+const DIRECT_ID_MIN_SCORE = 0.72;
+const DIRECT_ID_SUBSTRING_MIN_SCORE = 0.95;
+const AUTO_TOP_MIN_SCORE = 0.72;
+const AUTO_TOP_MIN_GAP = 0.15;
+const LOW_CONFIDENCE_MAX_SCORE = 0.45;
+const MAX_CANDIDATES = 5;
+function resolveEvidenceSelection(input) {
+  const quote = normalizeQuote(input.evidence.quote);
+  const sentenceId = normalizeSentenceId(input.evidence.sentence_id);
+  let directCandidateById;
+  if (quote === "") {
+    return [
+      void 0,
+      {
+        candidates: [],
+        code: "invalid",
+        message: "Evidence quote is missing or empty."
+      }
+    ];
+  }
+  const preparedQuote = prepareEvidenceQuote(quote);
+  if (sentenceId !== void 0) {
+    const directIndex = input.sentences.findIndex(
+      (sentence) => sentence.id === sentenceId
+    );
+    const directSentence = input.sentences[directIndex];
+    if (directSentence !== void 0) {
+      const directCandidate = createCandidate({
+        index: directIndex,
+        scored: scorePreparedEvidenceQuote({
+          preparedQuote,
+          sentence: directSentence.text
+        }),
+        sentence: directSentence,
+        sentences: input.sentences
+      });
+      directCandidateById = directCandidate;
+      if (isDirectExactCandidateTrusted(directCandidate)) {
+        return [
+          {
+            candidate: directCandidate,
+            confidence: directCandidate.score,
+            sentenceIds: [directCandidate.sentence.sentenceId],
+            strategy: `sentence_id+${directCandidate.strategy}`
+          },
+          void 0
+        ];
+      }
+    }
+  }
+  const candidates = rankTopEvidenceQuoteCandidates(
+    preparedQuote,
+    input.sentences,
+    MAX_CANDIDATES
+  );
+  if (sentenceId !== void 0) {
+    const directCandidate = candidates.find((candidate) => candidate.occurrenceId === sentenceId) ?? directCandidateById;
+    const topCandidate2 = candidates[0];
+    if (directCandidate !== void 0 && topCandidate2 !== void 0 && isDirectCandidateTrusted(directCandidate, topCandidate2)) {
+      return [
+        {
+          candidate: directCandidate,
+          confidence: directCandidate.score,
+          sentenceIds: [directCandidate.sentence.sentenceId],
+          strategy: `sentence_id+${directCandidate.strategy}`
+        },
+        void 0
+      ];
+    }
+  }
+  const topCandidate = candidates[0];
+  if (topCandidate === void 0) {
+    return [
+      void 0,
+      {
+        candidates: [],
+        code: "none",
+        message: "Evidence quote could not be matched: no candidates available."
+      }
+    ];
+  }
+  const secondScore = candidates[1]?.score ?? 0;
+  const gap = topCandidate.score - secondScore;
+  const boundaryHint = formatSentenceBoundaryHint(quote);
+  if (topCandidate.score < LOW_CONFIDENCE_MAX_SCORE) {
+    return [
+      void 0,
+      {
+        candidates: candidates.slice(0, MAX_CANDIDATES),
+        code: "low_confidence",
+        message: `Evidence quote could not be matched confidently. Best candidate score=${topCandidate.score.toFixed(3)}.` + boundaryHint
+      }
+    ];
+  }
+  if (topCandidate.score >= AUTO_TOP_MIN_SCORE && gap >= AUTO_TOP_MIN_GAP) {
+    return [
+      {
+        candidate: topCandidate,
+        confidence: topCandidate.score,
+        sentenceIds: [topCandidate.sentence.sentenceId],
+        strategy: `quote_auto_top1:${topCandidate.strategy}`
+      },
+      void 0
+    ];
+  }
+  return [
+    void 0,
+    {
+      candidates: candidates.slice(0, MAX_CANDIDATES),
+      code: "ambiguous",
+      message: "Evidence quote is ambiguous. Choose one candidate occurrence ID." + boundaryHint
+    }
+  ];
+}
+function formatSentenceBoundaryHint(quote) {
+  if (splitTextIntoSentences(quote).length <= 1) {
+    return "";
+  }
+  return " Evidence quote appears to contain more than one sentence. Each evidence item must stay within one source sentence. Recheck whether this evidence should be shortened, split into multiple evidence items, or removed.";
+}
+function resolveEvidenceSelectionList(input) {
+  const selections = normalizeEvidenceSelectionList(input.evidence);
+  if (selections.length === 0) {
+    return [
+      void 0,
+      {
+        candidates: [],
+        code: "invalid",
+        message: "Evidence selection list is empty."
+      }
+    ];
+  }
+  const sentenceIds = [];
+  const strategies = [];
+  let confidence = 1;
+  let candidate;
+  for (const selection of selections) {
+    const [resolution, failure] = resolveEvidenceSelection({
+      evidence: selection,
+      sentences: input.sentences
+    });
+    if (failure !== void 0) {
+      return [void 0, failure];
+    }
+    if (resolution === void 0) {
+      return [
+        void 0,
+        {
+          candidates: [],
+          code: "none",
+          message: "Evidence selection could not be resolved."
+        }
+      ];
+    }
+    candidate ??= resolution.candidate;
+    confidence = Math.min(confidence, resolution.confidence);
+    sentenceIds.push(...resolution.sentenceIds);
+    strategies.push(resolution.strategy);
+  }
+  if (candidate === void 0) {
+    return [
+      void 0,
+      {
+        candidates: [],
+        code: "none",
+        message: "Evidence selection could not be resolved."
+      }
+    ];
+  }
+  return [
+    {
+      candidate,
+      confidence,
+      sentenceIds: uniqueSentenceIds(sentenceIds),
+      strategy: `list:${strategies.join(",")}`
+    },
+    void 0
+  ];
+}
+function normalizeEvidenceSelectionList(evidence) {
+  if (isEvidenceSelectionArray(evidence)) {
+    return evidence;
+  }
+  return [evidence];
+}
+function isEvidenceSelectionArray(evidence) {
+  return Array.isArray(evidence);
+}
+function rankEvidenceQuote(quote, sentences) {
+  const preparedQuote = prepareEvidenceQuote(quote);
+  return sentences.map((sentence, index) => {
+    const scored = scorePreparedEvidenceQuote({
+      preparedQuote,
+      sentence: sentence.text
+    });
+    return createCandidate({
+      index,
+      scored,
+      sentence,
+      sentences
+    });
+  }).sort(compareCandidates);
+}
+function rankTopEvidenceQuoteCandidates(preparedQuote, sentences, limit) {
+  const candidates = [];
+  for (const [index, sentence] of sentences.entries()) {
+    const scored = scorePreparedEvidenceQuote({
+      preparedQuote,
+      sentence: sentence.text
+    });
+    const candidate = createCandidate({
+      index,
+      scored,
+      sentence,
+      sentences
+    });
+    insertCandidate(candidates, candidate, limit);
+  }
+  return candidates;
+}
+function insertCandidate(candidates, candidate, limit) {
+  const insertAt = candidates.findIndex(
+    (item) => compareCandidates(candidate, item) < 0
+  );
+  if (insertAt === -1) {
+    if (candidates.length < limit) {
+      candidates.push(candidate);
+    }
+    return;
+  }
+  candidates.splice(insertAt, 0, candidate);
+  if (candidates.length > limit) {
+    candidates.pop();
+  }
+}
+function createCandidate(input) {
+  return {
+    exactNormalized: input.scored.exactNormalized,
+    exactRaw: input.scored.exactRaw,
+    exactSubstring: input.scored.exactSubstring,
+    index: input.index,
+    nextText: input.sentences[input.index + 1]?.text ?? "",
+    occurrenceId: input.sentence.id,
+    prevText: input.sentences[input.index - 1]?.text ?? "",
+    score: input.scored.score,
+    sentence: input.sentence,
+    strategy: input.scored.strategy
+  };
+}
+function compareCandidates(left, right) {
+  if (left.score !== right.score) {
+    return right.score - left.score;
+  }
+  if (left.exactRaw !== right.exactRaw) {
+    return left.exactRaw ? -1 : 1;
+  }
+  if (left.exactSubstring !== right.exactSubstring) {
+    return left.exactSubstring ? -1 : 1;
+  }
+  if (left.exactNormalized !== right.exactNormalized) {
+    return left.exactNormalized ? -1 : 1;
+  }
+  return left.index - right.index;
+}
+function isDirectCandidateTrusted(candidate, topCandidate) {
+  const trustedScore = candidate.score >= DIRECT_ID_MIN_SCORE || candidate.exactSubstring && candidate.score >= DIRECT_ID_SUBSTRING_MIN_SCORE;
+  return trustedScore && (candidate.occurrenceId === topCandidate.occurrenceId || topCandidate.score - candidate.score < AUTO_TOP_MIN_GAP);
+}
+function isDirectExactCandidateTrusted(candidate) {
+  return candidate.score >= DIRECT_ID_SUBSTRING_MIN_SCORE && candidate.exactSubstring;
+}
+function normalizeQuote(value) {
+  return normalizeEvidenceDisplayText(value ?? "");
+}
+function normalizeSentenceId(value) {
+  const normalized = value?.trim();
+  return normalized === "" ? void 0 : normalized;
+}
+function uniqueSentenceIds(sentenceIds) {
+  const seen = /* @__PURE__ */ new Set();
+  const unique = [];
+  for (const sentenceId of sentenceIds) {
+    const key = sentenceId.join(":");
+    if (seen.has(key)) {
+      continue;
+    }
+    seen.add(key);
+    unique.push(sentenceId);
+  }
+  return unique;
+}
+export {
+  rankEvidenceQuote,
+  resolveEvidenceSelection,
+  resolveEvidenceSelectionList
+};
+//# sourceMappingURL=resolver.js.map

package/dist/graph/evidence-selection/resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/graph/evidence-selection/resolver.ts"],"sourcesContent":["import {\n  normalizeEvidenceDisplayText,\n  prepareEvidenceQuote,\n  scorePreparedEvidenceQuote,\n  type PreparedEvidenceQuote,\n  type EvidenceQuoteScore,\n} from \"./quote-score.js\";\nimport { splitTextIntoSentences } from \"./text.js\";\nimport type {\n  EvidenceSelection,\n  EvidenceSelectionCandidate,\n  EvidenceSelectionFailure,\n  EvidenceSelectionList,\n  EvidenceSelectionResolution,\n  EvidenceSelectionSentence,\n} from \"./types.js\";\n\nconst DIRECT_ID_MIN_SCORE = 0.72;\nconst DIRECT_ID_SUBSTRING_MIN_SCORE = 0.95;\nconst AUTO_TOP_MIN_SCORE = 0.72;\nconst AUTO_TOP_MIN_GAP = 0.15;\nconst LOW_CONFIDENCE_MAX_SCORE = 0.45;\nconst MAX_CANDIDATES = 5;\n\nexport function resolveEvidenceSelection(input: {\n  readonly evidence: EvidenceSelection;\n  readonly sentences: readonly EvidenceSelectionSentence[];\n}): readonly [\n  resolution: EvidenceSelectionResolution | undefined,\n  failure: EvidenceSelectionFailure | undefined,\n] {\n  const quote = normalizeQuote(input.evidence.quote);\n  const sentenceId = normalizeSentenceId(input.evidence.sentence_id);\n  let directCandidateById: EvidenceSelectionCandidate | undefined;\n\n  if (quote === \"\") {\n    return [\n      undefined,\n      {\n        candidates: [],\n        code: \"invalid\",\n        message: \"Evidence quote is missing or empty.\",\n      },\n    ];\n  }\n\n  const preparedQuote = prepareEvidenceQuote(quote);\n\n  if (sentenceId !== undefined) {\n    const directIndex = input.sentences.findIndex(\n      (sentence) => sentence.id === sentenceId,\n    );\n    const directSentence = input.sentences[directIndex];\n\n    if (directSentence !== undefined) {\n      const directCandidate = createCandidate({\n        index: directIndex,\n        scored: scorePreparedEvidenceQuote({\n          preparedQuote,\n          sentence: directSentence.text,\n        }),\n        sentence: directSentence,\n        sentences: input.sentences,\n      });\n      directCandidateById = directCandidate;\n\n      if (isDirectExactCandidateTrusted(directCandidate)) {\n        return [\n          {\n            candidate: directCandidate,\n            confidence: directCandidate.score,\n            sentenceIds: [directCandidate.sentence.sentenceId],\n            strategy: `sentence_id+${directCandidate.strategy}`,\n          },\n          undefined,\n        ];\n      }\n    }\n  }\n\n  const candidates = rankTopEvidenceQuoteCandidates(\n    preparedQuote,\n    input.sentences,\n    MAX_CANDIDATES,\n  );\n\n  if (sentenceId !== undefined) {\n    const directCandidate =\n      candidates.find((candidate) => candidate.occurrenceId === sentenceId) ??\n      directCandidateById;\n    const topCandidate = candidates[0];\n\n    if (\n      directCandidate !== undefined &&\n      topCandidate !== undefined &&\n      isDirectCandidateTrusted(directCandidate, topCandidate)\n    ) {\n      return [\n        {\n          candidate: directCandidate,\n          confidence: directCandidate.score,\n          sentenceIds: [directCandidate.sentence.sentenceId],\n          strategy: `sentence_id+${directCandidate.strategy}`,\n        },\n        undefined,\n      ];\n    }\n  }\n\n  const topCandidate = candidates[0];\n\n  if (topCandidate === undefined) {\n    return [\n      undefined,\n      {\n        candidates: [],\n        code: \"none\",\n        message:\n          \"Evidence quote could not be matched: no candidates available.\",\n      },\n    ];\n  }\n\n  const secondScore = candidates[1]?.score ?? 0;\n  const gap = topCandidate.score - secondScore;\n  const boundaryHint = formatSentenceBoundaryHint(quote);\n\n  if (topCandidate.score < LOW_CONFIDENCE_MAX_SCORE) {\n    return [\n      undefined,\n      {\n        candidates: candidates.slice(0, MAX_CANDIDATES),\n        code: \"low_confidence\",\n        message:\n          \"Evidence quote could not be matched confidently. \" +\n          `Best candidate score=${topCandidate.score.toFixed(3)}.` +\n          boundaryHint,\n      },\n    ];\n  }\n\n  if (topCandidate.score >= AUTO_TOP_MIN_SCORE && gap >= AUTO_TOP_MIN_GAP) {\n    return [\n      {\n        candidate: topCandidate,\n        confidence: topCandidate.score,\n        sentenceIds: [topCandidate.sentence.sentenceId],\n        strategy: `quote_auto_top1:${topCandidate.strategy}`,\n      },\n      undefined,\n    ];\n  }\n\n  return [\n    undefined,\n    {\n      candidates: candidates.slice(0, MAX_CANDIDATES),\n      code: \"ambiguous\",\n      message:\n        \"Evidence quote is ambiguous. Choose one candidate occurrence ID.\" +\n        boundaryHint,\n    },\n  ];\n}\n\nfunction formatSentenceBoundaryHint(quote: string): string {\n  if (splitTextIntoSentences(quote).length <= 1) {\n    return \"\";\n  }\n\n  return (\n    \" Evidence quote appears to contain more than one sentence. \" +\n    \"Each evidence item must stay within one source sentence. \" +\n    \"Recheck whether this evidence should be shortened, split into multiple evidence items, or removed.\"\n  );\n}\n\nexport function resolveEvidenceSelectionList(input: {\n  readonly evidence: EvidenceSelectionList;\n  readonly sentences: readonly EvidenceSelectionSentence[];\n}): readonly [\n  resolution: EvidenceSelectionResolution | undefined,\n  failure: EvidenceSelectionFailure | undefined,\n] {\n  const selections = normalizeEvidenceSelectionList(input.evidence);\n\n  if (selections.length === 0) {\n    return [\n      undefined,\n      {\n        candidates: [],\n        code: \"invalid\",\n        message: \"Evidence selection list is empty.\",\n      },\n    ];\n  }\n\n  const sentenceIds: EvidenceSelectionResolution[\"sentenceIds\"][number][] = [];\n  const strategies: string[] = [];\n  let confidence = 1;\n  let candidate: EvidenceSelectionCandidate | undefined;\n\n  for (const selection of selections) {\n    const [resolution, failure] = resolveEvidenceSelection({\n      evidence: selection,\n      sentences: input.sentences,\n    });\n\n    if (failure !== undefined) {\n      return [undefined, failure];\n    }\n\n    if (resolution === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          message: \"Evidence selection could not be resolved.\",\n        },\n      ];\n    }\n\n    candidate ??= resolution.candidate;\n    confidence = Math.min(confidence, resolution.confidence);\n    sentenceIds.push(...resolution.sentenceIds);\n    strategies.push(resolution.strategy);\n  }\n\n  if (candidate === undefined) {\n    return [\n      undefined,\n      {\n        candidates: [],\n        code: \"none\",\n        message: \"Evidence selection could not be resolved.\",\n      },\n    ];\n  }\n\n  return [\n    {\n      candidate,\n      confidence,\n      sentenceIds: uniqueSentenceIds(sentenceIds),\n      strategy: `list:${strategies.join(\",\")}`,\n    },\n    undefined,\n  ];\n}\n\nfunction normalizeEvidenceSelectionList(\n  evidence: EvidenceSelectionList,\n): readonly EvidenceSelection[] {\n  if (isEvidenceSelectionArray(evidence)) {\n    return evidence;\n  }\n\n  return [evidence];\n}\n\nfunction isEvidenceSelectionArray(\n  evidence: EvidenceSelectionList,\n): evidence is readonly EvidenceSelection[] {\n  return Array.isArray(evidence);\n}\n\nexport function rankEvidenceQuote(\n  quote: string,\n  sentences: readonly EvidenceSelectionSentence[],\n): EvidenceSelectionCandidate[] {\n  const preparedQuote = prepareEvidenceQuote(quote);\n\n  return sentences\n    .map((sentence, index) => {\n      const scored = scorePreparedEvidenceQuote({\n        preparedQuote,\n        sentence: sentence.text,\n      });\n\n      return createCandidate({\n        index,\n        scored,\n        sentence,\n        sentences,\n      });\n    })\n    .sort(compareCandidates);\n}\n\nfunction rankTopEvidenceQuoteCandidates(\n  preparedQuote: PreparedEvidenceQuote,\n  sentences: readonly EvidenceSelectionSentence[],\n  limit: number,\n): EvidenceSelectionCandidate[] {\n  const candidates: EvidenceSelectionCandidate[] = [];\n\n  for (const [index, sentence] of sentences.entries()) {\n    const scored = scorePreparedEvidenceQuote({\n      preparedQuote,\n      sentence: sentence.text,\n    });\n    const candidate = createCandidate({\n      index,\n      scored,\n      sentence,\n      sentences,\n    });\n\n    insertCandidate(candidates, candidate, limit);\n  }\n\n  return candidates;\n}\n\nfunction insertCandidate(\n  candidates: EvidenceSelectionCandidate[],\n  candidate: EvidenceSelectionCandidate,\n  limit: number,\n): void {\n  const insertAt = candidates.findIndex(\n    (item) => compareCandidates(candidate, item) < 0,\n  );\n\n  if (insertAt === -1) {\n    if (candidates.length < limit) {\n      candidates.push(candidate);\n    }\n    return;\n  }\n\n  candidates.splice(insertAt, 0, candidate);\n\n  if (candidates.length > limit) {\n    candidates.pop();\n  }\n}\n\nfunction createCandidate(input: {\n  readonly index: number;\n  readonly scored: EvidenceQuoteScore;\n  readonly sentence: EvidenceSelectionSentence;\n  readonly sentences: readonly EvidenceSelectionSentence[];\n}): EvidenceSelectionCandidate {\n  return {\n    exactNormalized: input.scored.exactNormalized,\n    exactRaw: input.scored.exactRaw,\n    exactSubstring: input.scored.exactSubstring,\n    index: input.index,\n    nextText: input.sentences[input.index + 1]?.text ?? \"\",\n    occurrenceId: input.sentence.id,\n    prevText: input.sentences[input.index - 1]?.text ?? \"\",\n    score: input.scored.score,\n    sentence: input.sentence,\n    strategy: input.scored.strategy,\n  };\n}\n\nfunction compareCandidates(\n  left: EvidenceSelectionCandidate,\n  right: EvidenceSelectionCandidate,\n): number {\n  if (left.score !== right.score) {\n    return right.score - left.score;\n  }\n  if (left.exactRaw !== right.exactRaw) {\n    return left.exactRaw ? -1 : 1;\n  }\n  if (left.exactSubstring !== right.exactSubstring) {\n    return left.exactSubstring ? -1 : 1;\n  }\n  if (left.exactNormalized !== right.exactNormalized) {\n    return left.exactNormalized ? -1 : 1;\n  }\n\n  return left.index - right.index;\n}\n\nfunction isDirectCandidateTrusted(\n  candidate: EvidenceSelectionCandidate,\n  topCandidate: EvidenceSelectionCandidate,\n): boolean {\n  const trustedScore =\n    candidate.score >= DIRECT_ID_MIN_SCORE ||\n    (candidate.exactSubstring &&\n      candidate.score >= DIRECT_ID_SUBSTRING_MIN_SCORE);\n\n  return (\n    trustedScore &&\n    (candidate.occurrenceId === topCandidate.occurrenceId ||\n      topCandidate.score - candidate.score < AUTO_TOP_MIN_GAP)\n  );\n}\n\nfunction isDirectExactCandidateTrusted(\n  candidate: EvidenceSelectionCandidate,\n): boolean {\n  return (\n    candidate.score >= DIRECT_ID_SUBSTRING_MIN_SCORE && candidate.exactSubstring\n  );\n}\n\nfunction normalizeQuote(value: string | undefined): string {\n  return normalizeEvidenceDisplayText(value ?? \"\");\n}\n\nfunction normalizeSentenceId(value: string | undefined): string | undefined {\n  const normalized = value?.trim();\n\n  return normalized === \"\" ? undefined : normalized;\n}\n\nfunction uniqueSentenceIds(\n  sentenceIds: EvidenceSelectionResolution[\"sentenceIds\"],\n): EvidenceSelectionResolution[\"sentenceIds\"] {\n  const seen = new Set<string>();\n  const unique: EvidenceSelectionResolution[\"sentenceIds\"][number][] = [];\n\n  for (const sentenceId of sentenceIds) {\n    const key = sentenceId.join(\":\");\n\n    if (seen.has(key)) {\n      continue;\n    }\n\n    seen.add(key);\n    unique.push(sentenceId);\n  }\n\n  return unique;\n}\n"],"mappings":"AAAA;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAGK;AACP,SAAS,8BAA8B;AAUvC,MAAM,sBAAsB;AAC5B,MAAM,gCAAgC;AACtC,MAAM,qBAAqB;AAC3B,MAAM,mBAAmB;AACzB,MAAM,2BAA2B;AACjC,MAAM,iBAAiB;AAEhB,SAAS,yBAAyB,OAMvC;AACA,QAAM,QAAQ,eAAe,MAAM,SAAS,KAAK;AACjD,QAAM,aAAa,oBAAoB,MAAM,SAAS,WAAW;AACjE,MAAI;AAEJ,MAAI,UAAU,IAAI;AAChB,WAAO;AAAA,MACL;AAAA,MACA;AAAA,QACE,YAAY,CAAC;AAAA,QACb,MAAM;AAAA,QACN,SAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAgB,qBAAqB,KAAK;AAEhD,MAAI,eAAe,QAAW;AAC5B,UAAM,cAAc,MAAM,UAAU;AAAA,MAClC,CAAC,aAAa,SAAS,OAAO;AAAA,IAChC;AACA,UAAM,iBAAiB,MAAM,UAAU,WAAW;AAElD,QAAI,mBAAmB,QAAW;AAChC,YAAM,kBAAkB,gBAAgB;AAAA,QACtC,OAAO;AAAA,QACP,QAAQ,2BAA2B;AAAA,UACjC;AAAA,UACA,UAAU,eAAe;AAAA,QAC3B,CAAC;AAAA,QACD,UAAU;AAAA,QACV,WAAW,MAAM;AAAA,MACnB,CAAC;AACD,4BAAsB;AAEtB,UAAI,8BAA8B,eAAe,GAAG;AAClD,eAAO;AAAA,UACL;AAAA,YACE,WAAW;AAAA,YACX,YAAY,gBAAgB;AAAA,YAC5B,aAAa,CAAC,gBAAgB,SAAS,UAAU;AAAA,YACjD,UAAU,eAAe,gBAAgB,QAAQ;AAAA,UACnD;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAa;AAAA,IACjB;AAAA,IACA,MAAM;AAAA,IACN;AAAA,EACF;AAEA,MAAI,eAAe,QAAW;AAC5B,UAAM,kBACJ,WAAW,KAAK,CAAC,cAAc,UAAU,iBAAiB,UAAU,KACpE;AACF,UAAMA,gBAAe,WAAW,CAAC;AAEjC,QACE,oBAAoB,UACpBA,kBAAiB,UACjB,yBAAyB,iBAAiBA,aAAY,GACtD;AACA,aAAO;AAAA,QACL;AAAA,UACE,WAAW;AAAA,UACX,YAAY,gBAAgB;AAAA,UAC5B,aAAa,CAAC,gBAAgB,SAAS,UAAU;AAAA,UACjD,UAAU,eAAe,gBAAgB,QAAQ;AAAA,QACnD;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,WAAW,CAAC;AAEjC,MAAI,iBAAiB,QAAW;AAC9B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,QACE,YAAY,CAAC;AAAA,QACb,MAAM;AAAA,QACN,SACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAAc,WAAW,CAAC,GAAG,SAAS;AAC5C,QAAM,MAAM,aAAa,QAAQ;AACjC,QAAM,eAAe,2BAA2B,KAAK;AAErD,MAAI,aAAa,QAAQ,0BAA0B;AACjD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,QACE,YAAY,WAAW,MAAM,GAAG,cAAc;AAAA,QAC9C,MAAM;AAAA,QACN,SACE,yEACwB,aAAa,MAAM,QAAQ,CAAC,CAAC,MACrD;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,sBAAsB,OAAO,kBAAkB;AACvE,WAAO;AAAA,MACL;AAAA,QACE,WAAW;AAAA,QACX,YAAY,aAAa;AAAA,QACzB,aAAa,CAAC,aAAa,SAAS,UAAU;AAAA,QAC9C,UAAU,mBAAmB,aAAa,QAAQ;AAAA,MACpD;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,MACE,YAAY,WAAW,MAAM,GAAG,cAAc;AAAA,MAC9C,MAAM;AAAA,MACN,SACE,qEACA;AAAA,IACJ;AAAA,EACF;AACF;AAEA,SAAS,2BAA2B,OAAuB;AACzD,MAAI,uBAAuB,KAAK,EAAE,UAAU,GAAG;AAC7C,WAAO;AAAA,EACT;AAEA,SACE;AAIJ;AAEO,SAAS,6BAA6B,OAM3C;AACA,QAAM,aAAa,+BAA+B,MAAM,QAAQ;AAEhE,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,QACE,YAAY,CAAC;AAAA,QACb,MAAM;AAAA,QACN,SAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAEA,QAAM,cAAoE,CAAC;AAC3E,QAAM,aAAuB,CAAC;AAC9B,MAAI,aAAa;AACjB,MAAI;AAEJ,aAAW,aAAa,YAAY;AAClC,UAAM,CAAC,YAAY,OAAO,IAAI,yBAAyB;AAAA,MACrD,UAAU;AAAA,MACV,WAAW,MAAM;AAAA,IACnB,CAAC;AAED,QAAI,YAAY,QAAW;AACzB,aAAO,CAAC,QAAW,OAAO;AAAA,IAC5B;AAEA,QAAI,eAAe,QAAW;AAC5B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,kBAAc,WAAW;AACzB,iBAAa,KAAK,IAAI,YAAY,WAAW,UAAU;AACvD,gBAAY,KAAK,GAAG,WAAW,WAAW;AAC1C,eAAW,KAAK,WAAW,QAAQ;AAAA,EACrC;AAEA,MAAI,cAAc,QAAW;AAC3B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,QACE,YAAY,CAAC;AAAA,QACb,MAAM;AAAA,QACN,SAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,MACE;AAAA,MACA;AAAA,MACA,aAAa,kBAAkB,WAAW;AAAA,MAC1C,UAAU,QAAQ,WAAW,KAAK,GAAG,CAAC;AAAA,IACxC;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,+BACP,UAC8B;AAC9B,MAAI,yBAAyB,QAAQ,GAAG;AACtC,WAAO;AAAA,EACT;AAEA,SAAO,CAAC,QAAQ;AAClB;AAEA,SAAS,yBACP,UAC0C;AAC1C,SAAO,MAAM,QAAQ,QAAQ;AAC/B;AAEO,SAAS,kBACd,OACA,WAC8B;AAC9B,QAAM,gBAAgB,qBAAqB,KAAK;AAEhD,SAAO,UACJ,IAAI,CAAC,UAAU,UAAU;AACxB,UAAM,SAAS,2BAA2B;AAAA,MACxC;AAAA,MACA,UAAU,SAAS;AAAA,IACrB,CAAC;AAED,WAAO,gBAAgB;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,CAAC,EACA,KAAK,iBAAiB;AAC3B;AAEA,SAAS,+BACP,eACA,WACA,OAC8B;AAC9B,QAAM,aAA2C,CAAC;AAElD,aAAW,CAAC,OAAO,QAAQ,KAAK,UAAU,QAAQ,GAAG;AACnD,UAAM,SAAS,2BAA2B;AAAA,MACxC;AAAA,MACA,UAAU,SAAS;AAAA,IACrB,CAAC;AACD,UAAM,YAAY,gBAAgB;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,oBAAgB,YAAY,WAAW,KAAK;AAAA,EAC9C;AAEA,SAAO;AACT;AAEA,SAAS,gBACP,YACA,WACA,OACM;AACN,QAAM,WAAW,WAAW;AAAA,IAC1B,CAAC,SAAS,kBAAkB,WAAW,IAAI,IAAI;AAAA,EACjD;AAEA,MAAI,aAAa,IAAI;AACnB,QAAI,WAAW,SAAS,OAAO;AAC7B,iBAAW,KAAK,SAAS;AAAA,IAC3B;AACA;AAAA,EACF;AAEA,aAAW,OAAO,UAAU,GAAG,SAAS;AAExC,MAAI,WAAW,SAAS,OAAO;AAC7B,eAAW,IAAI;AAAA,EACjB;AACF;AAEA,SAAS,gBAAgB,OAKM;AAC7B,SAAO;AAAA,IACL,iBAAiB,MAAM,OAAO;AAAA,IAC9B,UAAU,MAAM,OAAO;AAAA,IACvB,gBAAgB,MAAM,OAAO;AAAA,IAC7B,OAAO,MAAM;AAAA,IACb,UAAU,MAAM,UAAU,MAAM,QAAQ,CAAC,GAAG,QAAQ;AAAA,IACpD,cAAc,MAAM,SAAS;AAAA,IAC7B,UAAU,MAAM,UAAU,MAAM,QAAQ,CAAC,GAAG,QAAQ;AAAA,IACpD,OAAO,MAAM,OAAO;AAAA,IACpB,UAAU,MAAM;AAAA,IAChB,UAAU,MAAM,OAAO;AAAA,EACzB;AACF;AAEA,SAAS,kBACP,MACA,OACQ;AACR,MAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,WAAO,MAAM,QAAQ,KAAK;AAAA,EAC5B;AACA,MAAI,KAAK,aAAa,MAAM,UAAU;AACpC,WAAO,KAAK,WAAW,KAAK;AAAA,EAC9B;AACA,MAAI,KAAK,mBAAmB,MAAM,gBAAgB;AAChD,WAAO,KAAK,iBAAiB,KAAK;AAAA,EACpC;AACA,MAAI,KAAK,oBAAoB,MAAM,iBAAiB;AAClD,WAAO,KAAK,kBAAkB,KAAK;AAAA,EACrC;AAEA,SAAO,KAAK,QAAQ,MAAM;AAC5B;AAEA,SAAS,yBACP,WACA,cACS;AACT,QAAM,eACJ,UAAU,SAAS,uBAClB,UAAU,kBACT,UAAU,SAAS;AAEvB,SACE,iBACC,UAAU,iBAAiB,aAAa,gBACvC,aAAa,QAAQ,UAAU,QAAQ;AAE7C;AAEA,SAAS,8BACP,WACS;AACT,SACE,UAAU,SAAS,iCAAiC,UAAU;AAElE;AAEA,SAAS,eAAe,OAAmC;AACzD,SAAO,6BAA6B,SAAS,EAAE;AACjD;AAEA,SAAS,oBAAoB,OAA+C;AAC1E,QAAM,aAAa,OAAO,KAAK;AAE/B,SAAO,eAAe,KAAK,SAAY;AACzC;AAEA,SAAS,kBACP,aAC4C;AAC5C,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAA+D,CAAC;AAEtE,aAAW,cAAc,aAAa;AACpC,UAAM,MAAM,WAAW,KAAK,GAAG;AAE/B,QAAI,KAAK,IAAI,GAAG,GAAG;AACjB;AAAA,IACF;AAEA,SAAK,IAAI,GAAG;AACZ,WAAO,KAAK,UAAU;AAAA,EACxB;AAEA,SAAO;AACT;","names":["topCandidate"]}

package/dist/graph/evidence-selection/text.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/graph/evidence-selection/text.ts"],"sourcesContent":["const HYPHEN_FLAGS = new Set([\"‐\", \"‑\", \"‒\", \"–\", \"—\", \"―\"]);\nconst SENTENCE_SEGMENTER = new Intl.Segmenter(undefined, {\n  granularity: \"sentence\",\n});\n\nexport function splitTextIntoSentences(text: string): string[] {\n  const stripped = text.trim();\n\n  if (stripped === \"\") {\n    return [];\n  }\n\n  return Array.from(SENTENCE_SEGMENTER.segment(stripped))\n    .map((segment) => segment.segment.trim())\n    .filter((segment) => segment !== \"\");\n}\n\nexport function normalizeText(text: string): string {\n  const collapsed = text.replace(/\\s+/gu, \" \").trim();\n  const chars = processSpacesAndHyphens(collapsed);\n  let normalized = \"\";\n\n  for (const char of chars) {\n    if (isPunctuation(char)) {\n      continue;\n    }\n\n    if (!isLatinLetter(char)) {\n      normalized += char;\n      continue;\n    }\n\n    normalized += char.toLowerCase().normalize(\"NFD\").replace(/\\p{M}/gu, \"\");\n  }\n\n  return normalized;\n}\n\nfunction processSpacesAndHyphens(text: string): string[] {\n  const chars: string[] = [];\n  let index = 0;\n\n  while (index < text.length) {\n    const char = text[index];\n\n    if (char === undefined) {\n      break;\n    }\n\n    if (char !== \" \") {\n      chars.push(char);\n      index += 1;\n      continue;\n    }\n\n    if (\n      chars.length >= 2 &&\n      HYPHEN_FLAGS.has(chars[chars.length - 1] ?? \"\") &&\n      isLatinLetter(chars[chars.length - 2] ?? \"\") &&\n      index < text.length - 1 &&\n      isLatinLetter(text[index + 1] ?? \"\")\n    ) {\n      chars.pop();\n      index += 1;\n      continue;\n    }\n\n    const previousChar = chars[chars.length - 1] ?? \"\";\n    const nextChar = text[index + 1] ?? \"\";\n    const keepSpace =\n      previousChar !== \"\" &&\n      nextChar !== \"\" &&\n      isLatinLetter(previousChar) &&\n      isLatinLetter(nextChar);\n\n    if (keepSpace) {\n      chars.push(char);\n    }\n\n    index += 1;\n  }\n\n  return chars;\n}\n\nfunction isLatinLetter(char: string): boolean {\n  return char !== \"\" && /\\p{Script=Latin}/u.test(char) && /\\p{L}/u.test(char);\n}\n\nfunction isPunctuation(char: string): boolean {\n  return /[\\p{P}\\p{S}]/u.test(char);\n}\n"],"mappings":"AAAA,MAAM,eAAe,oBAAI,IAAI,CAAC,UAAK,UAAK,UAAK,UAAK,UAAK,QAAG,CAAC;AAC3D,MAAM,qBAAqB,IAAI,KAAK,UAAU,QAAW;AAAA,EACvD,aAAa;AACf,CAAC;AAEM,SAAS,uBAAuB,MAAwB;AAC7D,QAAM,WAAW,KAAK,KAAK;AAE3B,MAAI,aAAa,IAAI;AACnB,WAAO,CAAC;AAAA,EACV;AAEA,SAAO,MAAM,KAAK,mBAAmB,QAAQ,QAAQ,CAAC,EACnD,IAAI,CAAC,YAAY,QAAQ,QAAQ,KAAK,CAAC,EACvC,OAAO,CAAC,YAAY,YAAY,EAAE;AACvC;AAEO,SAAS,cAAc,MAAsB;AAClD,QAAM,YAAY,KAAK,QAAQ,SAAS,GAAG,EAAE,KAAK;AAClD,QAAM,QAAQ,wBAAwB,SAAS;AAC/C,MAAI,aAAa;AAEjB,aAAW,QAAQ,OAAO;AACxB,QAAI,cAAc,IAAI,GAAG;AACvB;AAAA,IACF;AAEA,QAAI,CAAC,cAAc,IAAI,GAAG;AACxB,oBAAc;AACd;AAAA,IACF;AAEA,kBAAc,KAAK,YAAY,EAAE,UAAU,KAAK,EAAE,QAAQ,WAAC,UAAM,IAAE,GAAE,EAAE;AAAA,EACzE;AAEA,SAAO;AACT;AAEA,SAAS,wBAAwB,MAAwB;AACvD,QAAM,QAAkB,CAAC;AACzB,MAAI,QAAQ;AAEZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,OAAO,KAAK,KAAK;AAEvB,QAAI,SAAS,QAAW;AACtB;AAAA,IACF;AAEA,QAAI,SAAS,KAAK;AAChB,YAAM,KAAK,IAAI;AACf,eAAS;AACT;AAAA,IACF;AAEA,QACE,MAAM,UAAU,KAChB,aAAa,IAAI,MAAM,MAAM,SAAS,CAAC,KAAK,EAAE,KAC9C,cAAc,MAAM,MAAM,SAAS,CAAC,KAAK,EAAE,KAC3C,QAAQ,KAAK,SAAS,KACtB,cAAc,KAAK,QAAQ,CAAC,KAAK,EAAE,GACnC;AACA,YAAM,IAAI;AACV,eAAS;AACT;AAAA,IACF;AAEA,UAAM,eAAe,MAAM,MAAM,SAAS,CAAC,KAAK;AAChD,UAAM,WAAW,KAAK,QAAQ,CAAC,KAAK;AACpC,UAAM,YACJ,iBAAiB,MACjB,aAAa,MACb,cAAc,YAAY,KAC1B,cAAc,QAAQ;AAExB,QAAI,WAAW;AACb,YAAM,KAAK,IAAI;AAAA,IACjB;AAEA,aAAS;AAAA,EACX;AAEA,SAAO;AACT;AAEA,SAAS,cAAc,MAAuB;AAC5C,SAAO,SAAS,MAAM,WAAC,qBAAiB,GAAC,EAAC,KAAK,IAAI,KAAK,WAAC,UAAM,GAAC,EAAC,KAAK,IAAI;AAC5E;AAEA,SAAS,cAAc,MAAuB;AAC5C,SAAO,gBAAgB,KAAK,IAAI;AAClC;","names":[]}

package/dist/graph/knowledge-build/artifact-io.d.ts

@@ -0,0 +1,12 @@
+import { MentionLinkRecord, MentionRecord } from '../../document/types.js';
+
+declare function validateChapterKnowledgeGraphArtifact(chapterId: number, records: {
+    readonly mentionLinks: readonly MentionLinkRecord[];
+    readonly mentions: readonly MentionRecord[];
+}): void;
+declare function writeJsonl<T>(path: string, records: AsyncIterable<T> | Iterable<T>, parseRecord: (record: unknown) => T): Promise<void>;
+declare function readJsonl<T>(path: string, parseRecord: (record: unknown) => T): Promise<T[]>;
+declare function parseMentionRecord(record: unknown): MentionRecord;
+declare function parseMentionLinkRecord(record: unknown): MentionLinkRecord;
+
+export { parseMentionLinkRecord, parseMentionRecord, readJsonl, validateChapterKnowledgeGraphArtifact, writeJsonl };

package/dist/graph/knowledge-build/artifact-io.js

@@ -0,0 +1,151 @@
+import { createReadStream, createWriteStream } from "fs";
+import { createInterface } from "readline";
+import { z } from "zod";
+const mentionRecordSchema = z.object({
+  id: z.string().min(1),
+  chapterId: z.number().int(),
+  sentenceIndex: z.number().int().nonnegative().optional(),
+  rangeStart: z.number().int().nonnegative(),
+  rangeEnd: z.number().int().nonnegative(),
+  surface: z.string().min(1),
+  qid: z.string().regex(/^Q[1-9][0-9]*$/),
+  confidence: z.number().min(0).max(1).optional(),
+  note: z.string().optional()
+});
+const sentenceIdSchema = z.tuple([z.number().int().nonnegative(), z.number().int().nonnegative()]).readonly();
+const mentionLinkRecordSchema = z.object({
+  id: z.string().min(1),
+  sourceMentionId: z.string().min(1),
+  targetMentionId: z.string().min(1),
+  predicate: z.string().min(1),
+  evidenceSentenceIds: z.array(sentenceIdSchema).min(1),
+  confidence: z.number().min(0).max(1).optional(),
+  note: z.string().optional()
+});
+function validateChapterKnowledgeGraphArtifact(chapterId, records) {
+  const mentionIds = /* @__PURE__ */ new Set();
+  for (const mention of records.mentions) {
+    if (mention.chapterId !== chapterId) {
+      throw new Error(
+        `Mention ${mention.id} belongs to chapter ${mention.chapterId}, expected chapter ${chapterId}.`
+      );
+    }
+    if (mention.rangeEnd <= mention.rangeStart) {
+      throw new Error(
+        `Mention ${mention.id} has invalid range [${mention.rangeStart}, ${mention.rangeEnd}).`
+      );
+    }
+    if (mentionIds.has(mention.id)) {
+      throw new Error(`Duplicate mention id ${mention.id}.`);
+    }
+    mentionIds.add(mention.id);
+  }
+  const linkIds = /* @__PURE__ */ new Set();
+  for (const link of records.mentionLinks) {
+    if (linkIds.has(link.id)) {
+      throw new Error(`Duplicate mention link id ${link.id}.`);
+    }
+    if (!mentionIds.has(link.sourceMentionId)) {
+      throw new Error(
+        `Mention link ${link.id} references unknown source mention ${link.sourceMentionId}.`
+      );
+    }
+    if (!mentionIds.has(link.targetMentionId)) {
+      throw new Error(
+        `Mention link ${link.id} references unknown target mention ${link.targetMentionId}.`
+      );
+    }
+    if (link.evidenceSentenceIds.length === 0) {
+      throw new Error(`Mention link ${link.id} has no evidence sentences.`);
+    }
+    for (const sentenceId of link.evidenceSentenceIds) {
+      if (sentenceId[0] !== chapterId) {
+        throw new Error(
+          `Mention link ${link.id} evidence sentence ${formatSentenceId(sentenceId)} is outside chapter ${chapterId}.`
+        );
+      }
+    }
+    linkIds.add(link.id);
+  }
+}
+function formatSentenceId(sentenceId) {
+  return sentenceId.join(":");
+}
+async function writeJsonl(path, records, parseRecord) {
+  const stream = createWriteStream(path, { encoding: "utf8", flags: "wx" });
+  try {
+    for await (const record of records) {
+      stream.write(`${JSON.stringify(parseRecord(record))}
+`);
+    }
+  } finally {
+    await closeWritableStream(stream);
+  }
+}
+async function readJsonl(path, parseRecord) {
+  const records = [];
+  const lines = createInterface({
+    crlfDelay: Infinity,
+    input: createReadStream(path, { encoding: "utf8" })
+  });
+  let lineNumber = 0;
+  for await (const line of lines) {
+    lineNumber += 1;
+    if (line.trim() === "") {
+      continue;
+    }
+    try {
+      records.push(parseRecord(JSON.parse(line)));
+    } catch (error) {
+      throw new Error(`Invalid JSONL record at ${path}:${lineNumber}`, {
+        cause: error
+      });
+    }
+  }
+  return records;
+}
+function parseMentionRecord(record) {
+  const parsed = mentionRecordSchema.parse(record);
+  return {
+    chapterId: parsed.chapterId,
+    ...parsed.confidence === void 0 ? {} : { confidence: parsed.confidence },
+    id: parsed.id,
+    ...parsed.note === void 0 ? {} : { note: parsed.note },
+    qid: parsed.qid,
+    rangeEnd: parsed.rangeEnd,
+    rangeStart: parsed.rangeStart,
+    ...parsed.sentenceIndex === void 0 ? {} : { sentenceIndex: parsed.sentenceIndex },
+    surface: parsed.surface
+  };
+}
+function parseMentionLinkRecord(record) {
+  const parsed = mentionLinkRecordSchema.parse(record);
+  return {
+    ...parsed.confidence === void 0 ? {} : { confidence: parsed.confidence },
+    evidenceSentenceIds: parsed.evidenceSentenceIds,
+    id: parsed.id,
+    ...parsed.note === void 0 ? {} : { note: parsed.note },
+    predicate: parsed.predicate,
+    sourceMentionId: parsed.sourceMentionId,
+    targetMentionId: parsed.targetMentionId
+  };
+}
+async function closeWritableStream(stream) {
+  await new Promise((resolveClose, rejectClose) => {
+    stream.end((error) => {
+      if (error !== void 0 && error !== null) {
+        rejectClose(error);
+        return;
+      }
+      resolveClose();
+    });
+  });
+}
+export {
+  parseMentionLinkRecord,
+  parseMentionRecord,
+  readJsonl,
+  validateChapterKnowledgeGraphArtifact,
+  writeJsonl
+};
+//# sourceMappingURL=artifact-io.js.map

package/dist/graph/knowledge-build/artifact-io.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/graph/knowledge-build/artifact-io.ts"],"sourcesContent":["import { createReadStream, createWriteStream } from \"fs\";\nimport { createInterface } from \"readline\";\nimport { z } from \"zod\";\n\nimport type {\n  MentionLinkRecord,\n  MentionRecord,\n  SentenceId,\n} from \"../../document/index.js\";\n\nconst mentionRecordSchema = z.object({\n  id: z.string().min(1),\n  chapterId: z.number().int(),\n  sentenceIndex: z.number().int().nonnegative().optional(),\n  rangeStart: z.number().int().nonnegative(),\n  rangeEnd: z.number().int().nonnegative(),\n  surface: z.string().min(1),\n  qid: z.string().regex(/^Q[1-9][0-9]*$/),\n  confidence: z.number().min(0).max(1).optional(),\n  note: z.string().optional(),\n});\n\nconst sentenceIdSchema = z\n  .tuple([z.number().int().nonnegative(), z.number().int().nonnegative()])\n  .readonly();\n\nconst mentionLinkRecordSchema = z.object({\n  id: z.string().min(1),\n  sourceMentionId: z.string().min(1),\n  targetMentionId: z.string().min(1),\n  predicate: z.string().min(1),\n  evidenceSentenceIds: z.array(sentenceIdSchema).min(1),\n  confidence: z.number().min(0).max(1).optional(),\n  note: z.string().optional(),\n});\n\nexport function validateChapterKnowledgeGraphArtifact(\n  chapterId: number,\n  records: {\n    readonly mentionLinks: readonly MentionLinkRecord[];\n    readonly mentions: readonly MentionRecord[];\n  },\n): void {\n  const mentionIds = new Set<string>();\n\n  for (const mention of records.mentions) {\n    if (mention.chapterId !== chapterId) {\n      throw new Error(\n        `Mention ${mention.id} belongs to chapter ${mention.chapterId}, expected chapter ${chapterId}.`,\n      );\n    }\n    if (mention.rangeEnd <= mention.rangeStart) {\n      throw new Error(\n        `Mention ${mention.id} has invalid range [${mention.rangeStart}, ${mention.rangeEnd}).`,\n      );\n    }\n    if (mentionIds.has(mention.id)) {\n      throw new Error(`Duplicate mention id ${mention.id}.`);\n    }\n\n    mentionIds.add(mention.id);\n  }\n\n  const linkIds = new Set<string>();\n\n  for (const link of records.mentionLinks) {\n    if (linkIds.has(link.id)) {\n      throw new Error(`Duplicate mention link id ${link.id}.`);\n    }\n    if (!mentionIds.has(link.sourceMentionId)) {\n      throw new Error(\n        `Mention link ${link.id} references unknown source mention ${link.sourceMentionId}.`,\n      );\n    }\n    if (!mentionIds.has(link.targetMentionId)) {\n      throw new Error(\n        `Mention link ${link.id} references unknown target mention ${link.targetMentionId}.`,\n      );\n    }\n    if (link.evidenceSentenceIds.length === 0) {\n      throw new Error(`Mention link ${link.id} has no evidence sentences.`);\n    }\n\n    for (const sentenceId of link.evidenceSentenceIds) {\n      if (sentenceId[0] !== chapterId) {\n        throw new Error(\n          `Mention link ${link.id} evidence sentence ${formatSentenceId(sentenceId)} is outside chapter ${chapterId}.`,\n        );\n      }\n    }\n\n    linkIds.add(link.id);\n  }\n}\n\nfunction formatSentenceId(sentenceId: SentenceId): string {\n  return sentenceId.join(\":\");\n}\n\nexport async function writeJsonl<T>(\n  path: string,\n  records: AsyncIterable<T> | Iterable<T>,\n  parseRecord: (record: unknown) => T,\n): Promise<void> {\n  const stream = createWriteStream(path, { encoding: \"utf8\", flags: \"wx\" });\n\n  try {\n    for await (const record of records) {\n      stream.write(`${JSON.stringify(parseRecord(record))}\\n`);\n    }\n  } finally {\n    await closeWritableStream(stream);\n  }\n}\n\nexport async function readJsonl<T>(\n  path: string,\n  parseRecord: (record: unknown) => T,\n): Promise<T[]> {\n  const records: T[] = [];\n  const lines = createInterface({\n    crlfDelay: Infinity,\n    input: createReadStream(path, { encoding: \"utf8\" }),\n  });\n  let lineNumber = 0;\n\n  for await (const line of lines) {\n    lineNumber += 1;\n    if (line.trim() === \"\") {\n      continue;\n    }\n\n    try {\n      records.push(parseRecord(JSON.parse(line)));\n    } catch (error) {\n      throw new Error(`Invalid JSONL record at ${path}:${lineNumber}`, {\n        cause: error,\n      });\n    }\n  }\n\n  return records;\n}\n\nexport function parseMentionRecord(record: unknown): MentionRecord {\n  const parsed = mentionRecordSchema.parse(record);\n\n  return {\n    chapterId: parsed.chapterId,\n    ...(parsed.confidence === undefined\n      ? {}\n      : { confidence: parsed.confidence }),\n    id: parsed.id,\n    ...(parsed.note === undefined ? {} : { note: parsed.note }),\n    qid: parsed.qid,\n    rangeEnd: parsed.rangeEnd,\n    rangeStart: parsed.rangeStart,\n    ...(parsed.sentenceIndex === undefined\n      ? {}\n      : { sentenceIndex: parsed.sentenceIndex }),\n    surface: parsed.surface,\n  };\n}\n\nexport function parseMentionLinkRecord(record: unknown): MentionLinkRecord {\n  const parsed = mentionLinkRecordSchema.parse(record);\n\n  return {\n    ...(parsed.confidence === undefined\n      ? {}\n      : { confidence: parsed.confidence }),\n    evidenceSentenceIds: parsed.evidenceSentenceIds,\n    id: parsed.id,\n    ...(parsed.note === undefined ? {} : { note: parsed.note }),\n    predicate: parsed.predicate,\n    sourceMentionId: parsed.sourceMentionId,\n    targetMentionId: parsed.targetMentionId,\n  };\n}\n\nasync function closeWritableStream(\n  stream: NodeJS.WritableStream,\n): Promise<void> {\n  await new Promise<void>((resolveClose, rejectClose) => {\n    stream.end((error?: Error | null) => {\n      if (error !== undefined && error !== null) {\n        rejectClose(error);\n        return;\n      }\n\n      resolveClose();\n    });\n  });\n}\n"],"mappings":"AAAA,SAAS,kBAAkB,yBAAyB;AACpD,SAAS,uBAAuB;AAChC,SAAS,SAAS;AAQlB,MAAM,sBAAsB,EAAE,OAAO;AAAA,EACnC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,WAAW,EAAE,OAAO,EAAE,IAAI;AAAA,EAC1B,eAAe,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS;AAAA,EACvD,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACzC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY;AAAA,EACvC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,KAAK,EAAE,OAAO,EAAE,MAAM,gBAAgB;AAAA,EACtC,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,MAAM,EAAE,OAAO,EAAE,SAAS;AAC5B,CAAC;AAED,MAAM,mBAAmB,EACtB,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,EACtE,SAAS;AAEZ,MAAM,0BAA0B,EAAE,OAAO;AAAA,EACvC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACpB,iBAAiB,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACjC,iBAAiB,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACjC,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,qBAAqB,EAAE,MAAM,gBAAgB,EAAE,IAAI,CAAC;AAAA,EACpD,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,MAAM,EAAE,OAAO,EAAE,SAAS;AAC5B,CAAC;AAEM,SAAS,sCACd,WACA,SAIM;AACN,QAAM,aAAa,oBAAI,IAAY;AAEnC,aAAW,WAAW,QAAQ,UAAU;AACtC,QAAI,QAAQ,cAAc,WAAW;AACnC,YAAM,IAAI;AAAA,QACR,WAAW,QAAQ,EAAE,uBAAuB,QAAQ,SAAS,sBAAsB,SAAS;AAAA,MAC9F;AAAA,IACF;AACA,QAAI,QAAQ,YAAY,QAAQ,YAAY;AAC1C,YAAM,IAAI;AAAA,QACR,WAAW,QAAQ,EAAE,uBAAuB,QAAQ,UAAU,KAAK,QAAQ,QAAQ;AAAA,MACrF;AAAA,IACF;AACA,QAAI,WAAW,IAAI,QAAQ,EAAE,GAAG;AAC9B,YAAM,IAAI,MAAM,wBAAwB,QAAQ,EAAE,GAAG;AAAA,IACvD;AAEA,eAAW,IAAI,QAAQ,EAAE;AAAA,EAC3B;AAEA,QAAM,UAAU,oBAAI,IAAY;AAEhC,aAAW,QAAQ,QAAQ,cAAc;AACvC,QAAI,QAAQ,IAAI,KAAK,EAAE,GAAG;AACxB,YAAM,IAAI,MAAM,6BAA6B,KAAK,EAAE,GAAG;AAAA,IACzD;AACA,QAAI,CAAC,WAAW,IAAI,KAAK,eAAe,GAAG;AACzC,YAAM,IAAI;AAAA,QACR,gBAAgB,KAAK,EAAE,sCAAsC,KAAK,eAAe;AAAA,MACnF;AAAA,IACF;AACA,QAAI,CAAC,WAAW,IAAI,KAAK,eAAe,GAAG;AACzC,YAAM,IAAI;AAAA,QACR,gBAAgB,KAAK,EAAE,sCAAsC,KAAK,eAAe;AAAA,MACnF;AAAA,IACF;AACA,QAAI,KAAK,oBAAoB,WAAW,GAAG;AACzC,YAAM,IAAI,MAAM,gBAAgB,KAAK,EAAE,6BAA6B;AAAA,IACtE;AAEA,eAAW,cAAc,KAAK,qBAAqB;AACjD,UAAI,WAAW,CAAC,MAAM,WAAW;AAC/B,cAAM,IAAI;AAAA,UACR,gBAAgB,KAAK,EAAE,sBAAsB,iBAAiB,UAAU,CAAC,uBAAuB,SAAS;AAAA,QAC3G;AAAA,MACF;AAAA,IACF;AAEA,YAAQ,IAAI,KAAK,EAAE;AAAA,EACrB;AACF;AAEA,SAAS,iBAAiB,YAAgC;AACxD,SAAO,WAAW,KAAK,GAAG;AAC5B;AAEA,eAAsB,WACpB,MACA,SACA,aACe;AACf,QAAM,SAAS,kBAAkB,MAAM,EAAE,UAAU,QAAQ,OAAO,KAAK,CAAC;AAExE,MAAI;AACF,qBAAiB,UAAU,SAAS;AAClC,aAAO,MAAM,GAAG,KAAK,UAAU,YAAY,MAAM,CAAC,CAAC;AAAA,CAAI;AAAA,IACzD;AAAA,EACF,UAAE;AACA,UAAM,oBAAoB,MAAM;AAAA,EAClC;AACF;AAEA,eAAsB,UACpB,MACA,aACc;AACd,QAAM,UAAe,CAAC;AACtB,QAAM,QAAQ,gBAAgB;AAAA,IAC5B,WAAW;AAAA,IACX,OAAO,iBAAiB,MAAM,EAAE,UAAU,OAAO,CAAC;AAAA,EACpD,CAAC;AACD,MAAI,aAAa;AAEjB,mBAAiB,QAAQ,OAAO;AAC9B,kBAAc;AACd,QAAI,KAAK,KAAK,MAAM,IAAI;AACtB;AAAA,IACF;AAEA,QAAI;AACF,cAAQ,KAAK,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC;AAAA,IAC5C,SAAS,OAAO;AACd,YAAM,IAAI,MAAM,2BAA2B,IAAI,IAAI,UAAU,IAAI;AAAA,QAC/D,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,mBAAmB,QAAgC;AACjE,QAAM,SAAS,oBAAoB,MAAM,MAAM;AAE/C,SAAO;AAAA,IACL,WAAW,OAAO;AAAA,IAClB,GAAI,OAAO,eAAe,SACtB,CAAC,IACD,EAAE,YAAY,OAAO,WAAW;AAAA,IACpC,IAAI,OAAO;AAAA,IACX,GAAI,OAAO,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,OAAO,KAAK;AAAA,IACzD,KAAK,OAAO;AAAA,IACZ,UAAU,OAAO;AAAA,IACjB,YAAY,OAAO;AAAA,IACnB,GAAI,OAAO,kBAAkB,SACzB,CAAC,IACD,EAAE,eAAe,OAAO,cAAc;AAAA,IAC1C,SAAS,OAAO;AAAA,EAClB;AACF;AAEO,SAAS,uBAAuB,QAAoC;AACzE,QAAM,SAAS,wBAAwB,MAAM,MAAM;AAEnD,SAAO;AAAA,IACL,GAAI,OAAO,eAAe,SACtB,CAAC,IACD,EAAE,YAAY,OAAO,WAAW;AAAA,IACpC,qBAAqB,OAAO;AAAA,IAC5B,IAAI,OAAO;AAAA,IACX,GAAI,OAAO,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,OAAO,KAAK;AAAA,IACzD,WAAW,OAAO;AAAA,IAClB,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,EAC1B;AACF;AAEA,eAAe,oBACb,QACe;AACf,QAAM,IAAI,QAAc,CAAC,cAAc,gBAAgB;AACrD,WAAO,IAAI,CAAC,UAAyB;AACnC,UAAI,UAAU,UAAa,UAAU,MAAM;AACzC,oBAAY,KAAK;AACjB;AAAA,MACF;AAEA,mBAAa;AAAA,IACf,CAAC;AAAA,EACH,CAAC;AACH;","names":[]}

package/dist/graph/knowledge-build/artifact.d.ts

@@ -0,0 +1,17 @@
+import { BuildChapterKnowledgeGraphArtifactOptions, ChapterKnowledgeGraphBuildArtifact } from './types.js';
+import '../../document/types.js';
+import '../../external/guaranteed/types.js';
+import '../../external/llm/types.js';
+import 'ai';
+import 'zod';
+import '../../external/wikipage/types.js';
+import '../../external/wikipage/wikimedia-client/wiki.js';
+import '../../external/wikipage/fetch-log.js';
+import '../../external/wikimatch/wikispine.js';
+import '../../external/wikimatch/types.js';
+import '../../runtime/jobs/types.js';
+import '../../document/chapter/types.js';
+
+declare function buildChapterKnowledgeGraphArtifact(chapterId: number, options: BuildChapterKnowledgeGraphArtifactOptions): Promise<ChapterKnowledgeGraphBuildArtifact>;
+
+export { buildChapterKnowledgeGraphArtifact };