wiki-graph-core 0.3.1

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/evidence-selection/anchor-resolver.ts"],"sourcesContent":["import type { SentenceId } from \"../document/index.js\";\nimport type {\n  EvidenceResolutionFailure,\n  EvidenceResolutionResult,\n  RankedSentenceCandidate,\n} from \"./anchor-types.js\";\nimport { normalizeText, splitTextIntoSentences } from \"./text.js\";\n\nconst MIN_AUTO_RESOLVE_GAP = 0.07;\nconst MIN_AUTO_RESOLVE_SCORE = 0.9;\nconst MIN_BOUNDARY_BONUS_LENGTH = 12;\nconst MIN_CANDIDATE_SCORE = 0.55;\nconst VERY_HIGH_CONFIDENCE_SCORE = 0.97;\nconst MAX_BOUNDARY_BONUS = 0.08;\nconst MAX_CANDIDATE_DISPLAY = 3;\n\ninterface AnchorSpec {\n  readonly mode: \"full\" | \"head_tail\";\n  readonly text?: string;\n  readonly head?: string;\n  readonly tail?: string;\n}\n\ninterface TextMatchScore {\n  readonly score: number;\n  readonly exactRaw: boolean;\n  readonly exactNormalized: boolean;\n  readonly exactSubstring: boolean;\n  readonly matchStart: number;\n  readonly matchEnd: number;\n}\n\nexport class EvidenceResolver {\n  public resolve(\n    evidence: Record<string, unknown>,\n    candidateSentenceIds: readonly SentenceId[],\n    candidateTexts: readonly string[],\n  ): readonly [\n    result: EvidenceResolutionResult | undefined,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    const startValue = evidence.start_anchor ?? evidence.start;\n    const endValue = evidence.end_anchor ?? evidence.end;\n\n    const [startAnchor, startFailure] = this.parseAnchor(\n      startValue,\n      \"start_anchor\",\n    );\n\n    if (startFailure !== undefined) {\n      return [undefined, startFailure];\n    }\n\n    let endAnchor: AnchorSpec | undefined;\n\n    if (endValue !== undefined) {\n      const [parsedEndAnchor, endFailure] = this.parseAnchor(\n        endValue,\n        \"end_anchor\",\n      );\n\n      if (endFailure !== undefined) {\n        return [undefined, endFailure];\n      }\n\n      endAnchor = parsedEndAnchor;\n    }\n\n    const [startCandidate, startStrategy, startResolveFailure] =\n      this.resolveAnchor({\n        anchor: startAnchor,\n        candidateSentenceIds,\n        candidateTexts,\n        label: \"start_anchor\",\n      });\n\n    if (startResolveFailure !== undefined) {\n      return [undefined, startResolveFailure];\n    }\n\n    if (startCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"start_anchor\",\n          message: \"start_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endAnchor === undefined) {\n      return [\n        {\n          confidence: startCandidate.score,\n          sentenceIds: [startCandidate.sentenceId],\n          strategy: startStrategy,\n        },\n        undefined,\n      ];\n    }\n\n    const [endCandidate, endStrategy, endResolveFailure] = this.resolveAnchor({\n      anchor: endAnchor,\n      candidateSentenceIds,\n      candidateTexts,\n      label: \"end_anchor\",\n      minIndex: startCandidate.index,\n    });\n\n    if (endResolveFailure !== undefined) {\n      return [undefined, endResolveFailure];\n    }\n\n    if (endCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"end_anchor\",\n          message: \"end_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endCandidate.index < startCandidate.index) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"invalid_range\",\n          fieldName: \"end_anchor\",\n          message:\n            \"Invalid evidence range: end_anchor resolved before start_anchor \" +\n            `(${startCandidate.occurrenceId} -> ${endCandidate.occurrenceId}).`,\n        },\n      ];\n    }\n\n    return [\n      {\n        confidence: Math.min(startCandidate.score, endCandidate.score),\n        sentenceIds: candidateSentenceIds.slice(\n          startCandidate.index,\n          endCandidate.index + 1,\n        ),\n        strategy: `${startStrategy}+${endStrategy}`,\n      },\n      undefined,\n    ];\n  }\n\n  public resolveWithOverrides(input: {\n    evidence: Record<string, unknown>;\n    candidateSentenceIds: readonly SentenceId[];\n    candidateTexts: readonly string[];\n    overrides: Partial<\n      Readonly<Record<\"start_anchor\" | \"end_anchor\", RankedSentenceCandidate>>\n    >;\n  }): readonly [\n    result: EvidenceResolutionResult | undefined,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    const startValue = input.evidence.start_anchor ?? input.evidence.start;\n    const endValue = input.evidence.end_anchor ?? input.evidence.end;\n\n    const [startAnchor, startFailure] = this.parseAnchor(\n      startValue,\n      \"start_anchor\",\n    );\n\n    if (startFailure !== undefined) {\n      return [undefined, startFailure];\n    }\n\n    const startCandidateOverride = input.overrides.start_anchor;\n    const [startCandidate, startStrategy, startResolveFailure] =\n      startCandidateOverride === undefined\n        ? this.resolveAnchor({\n            anchor: startAnchor,\n            candidateSentenceIds: input.candidateSentenceIds,\n            candidateTexts: input.candidateTexts,\n            label: \"start_anchor\",\n          })\n        : [startCandidateOverride, \"choice_final\", undefined];\n\n    if (startResolveFailure !== undefined) {\n      return [undefined, startResolveFailure];\n    }\n\n    if (startCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"start_anchor\",\n          message: \"start_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endValue === undefined) {\n      return [\n        {\n          confidence: startCandidate.score,\n          sentenceIds: [startCandidate.sentenceId],\n          strategy: startStrategy,\n        },\n        undefined,\n      ];\n    }\n\n    const [endAnchor, endFailure] = this.parseAnchor(endValue, \"end_anchor\");\n\n    if (endFailure !== undefined) {\n      return [undefined, endFailure];\n    }\n\n    const endCandidateOverride = input.overrides.end_anchor;\n    const [endCandidate, endStrategy, endResolveFailure] =\n      endCandidateOverride === undefined\n        ? this.resolveAnchor({\n            anchor: endAnchor,\n            candidateSentenceIds: input.candidateSentenceIds,\n            candidateTexts: input.candidateTexts,\n            label: \"end_anchor\",\n            minIndex: startCandidate.index,\n          })\n        : [endCandidateOverride, \"choice_final\", undefined];\n\n    if (endResolveFailure !== undefined) {\n      return [undefined, endResolveFailure];\n    }\n\n    if (endCandidate === undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: \"end_anchor\",\n          message: \"end_anchor could not be matched: no candidate selected\",\n        },\n      ];\n    }\n\n    if (endCandidate.index < startCandidate.index) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"invalid_range\",\n          fieldName: \"end_anchor\",\n          message:\n            \"Invalid evidence range: end_anchor resolved before start_anchor \" +\n            `(${startCandidate.occurrenceId} -> ${endCandidate.occurrenceId}).`,\n        },\n      ];\n    }\n\n    return [\n      {\n        confidence: Math.min(startCandidate.score, endCandidate.score),\n        sentenceIds: input.candidateSentenceIds.slice(\n          startCandidate.index,\n          endCandidate.index + 1,\n        ),\n        strategy: `${startStrategy}+${endStrategy}`,\n      },\n      undefined,\n    ];\n  }\n\n  public parseAnchor(\n    value: unknown,\n    fieldName: string,\n  ): readonly [\n    anchor: AnchorSpec | undefined,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    const [anchor, error] = this.#parseAnchor(value);\n\n    if (error !== undefined) {\n      return [\n        undefined,\n        {\n          candidates: [],\n          code: \"invalid_anchor\",\n          fieldName,\n          message: `Invalid evidence.${fieldName}: ${error}`,\n        },\n      ];\n    }\n\n    return [this.#normalizeAnchor(anchor, fieldName), undefined];\n  }\n\n  public resolveAnchor(input: {\n    anchor: AnchorSpec | undefined;\n    candidateSentenceIds: readonly SentenceId[];\n    candidateTexts: readonly string[];\n    label: string;\n    minIndex?: number;\n  }): readonly [\n    candidate: RankedSentenceCandidate | undefined,\n    strategy: string,\n    failure: EvidenceResolutionFailure | undefined,\n  ] {\n    if (input.anchor === undefined) {\n      return [\n        undefined,\n        \"invalid\",\n        {\n          candidates: [],\n          code: \"invalid\",\n          fieldName: input.label,\n          message: `${input.label} is missing`,\n        },\n      ];\n    }\n\n    let candidates = this.rankAnchor(\n      input.anchor,\n      input.candidateSentenceIds,\n      input.candidateTexts,\n      input.label,\n    );\n\n    const minIndex = input.minIndex;\n\n    if (minIndex !== undefined) {\n      candidates = candidates.filter(\n        (candidate) => candidate.index >= minIndex,\n      );\n    }\n\n    if (candidates.length === 0) {\n      return [\n        undefined,\n        \"none\",\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: input.label,\n          message: `${input.label} could not be matched: no candidates available`,\n        },\n      ];\n    }\n\n    const exactRaw = candidates.filter((candidate) => candidate.exactRaw);\n\n    if (exactRaw.length === 1) {\n      return [exactRaw[0], \"exact_raw\", undefined];\n    }\n\n    if (exactRaw.length > 1) {\n      return [\n        undefined,\n        \"ambiguous_exact_raw\",\n        this.#buildAmbiguousFailure(\n          input.label,\n          \"ambiguous_exact_raw\",\n          exactRaw,\n        ),\n      ];\n    }\n\n    const exactSubstring = candidates.filter(\n      (candidate) => candidate.exactSubstring,\n    );\n\n    if (exactSubstring.length === 1 && this.#anchorLength(input.anchor) >= 8) {\n      return [exactSubstring[0], \"exact_substring\", undefined];\n    }\n\n    if (exactSubstring.length > 1 && this.#anchorLength(input.anchor) >= 8) {\n      const selected = this.#tryAutoSelectScoredDuplicates(exactSubstring);\n\n      if (selected !== undefined) {\n        return [selected, \"exact_substring_scored\", undefined];\n      }\n\n      return [\n        undefined,\n        \"ambiguous_exact_substring\",\n        this.#buildAmbiguousFailure(\n          input.label,\n          \"ambiguous_exact_substring\",\n          exactSubstring,\n        ),\n      ];\n    }\n\n    const exactNormalized = candidates.filter(\n      (candidate) => candidate.exactNormalized,\n    );\n\n    if (exactNormalized.length === 1) {\n      return [exactNormalized[0], \"exact_normalized\", undefined];\n    }\n\n    if (exactNormalized.length > 1) {\n      const selected = this.#tryAutoSelectScoredDuplicates(exactNormalized);\n\n      if (selected !== undefined) {\n        return [selected, \"exact_normalized_scored\", undefined];\n      }\n\n      return [\n        undefined,\n        \"ambiguous_exact_normalized\",\n        this.#buildAmbiguousFailure(\n          input.label,\n          \"ambiguous_exact_normalized\",\n          exactNormalized,\n        ),\n      ];\n    }\n\n    const topCandidate = candidates[0];\n\n    if (topCandidate === undefined) {\n      return [\n        undefined,\n        \"none\",\n        {\n          candidates: [],\n          code: \"none\",\n          fieldName: input.label,\n          message: `${input.label} 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\n    if (topCandidate.score < MIN_CANDIDATE_SCORE) {\n      return [\n        undefined,\n        \"low_confidence\",\n        {\n          candidates: candidates.slice(0, MAX_CANDIDATE_DISPLAY),\n          code: \"low_confidence\",\n          fieldName: input.label,\n          message:\n            `${input.label} could not be matched confidently. ` +\n            `Best candidate score=${topCandidate.score.toFixed(3)}.`,\n        },\n      ];\n    }\n\n    if (candidates.length === 1) {\n      return [topCandidate, \"auto_top1_single_candidate\", undefined];\n    }\n\n    if (topCandidate.score >= VERY_HIGH_CONFIDENCE_SCORE) {\n      return [topCandidate, \"auto_top1_very_high\", undefined];\n    }\n\n    if (\n      topCandidate.score >= MIN_AUTO_RESOLVE_SCORE &&\n      gap >= MIN_AUTO_RESOLVE_GAP\n    ) {\n      return [topCandidate, \"auto_top1\", undefined];\n    }\n\n    return [\n      undefined,\n      \"ambiguous_ranked\",\n      this.#buildAmbiguousFailure(input.label, \"ambiguous_ranked\", candidates),\n    ];\n  }\n\n  public rankAnchor(\n    anchor: AnchorSpec,\n    candidateSentenceIds: readonly SentenceId[],\n    candidateTexts: readonly string[],\n    label: string,\n  ): RankedSentenceCandidate[] {\n    const ranked: RankedSentenceCandidate[] = [];\n\n    for (const [index, sentenceId] of candidateSentenceIds.entries()) {\n      const text = candidateTexts[index] ?? \"\";\n      const prevText = index > 0 ? (candidateTexts[index - 1] ?? \"\") : \"\";\n      const nextText =\n        index < candidateTexts.length - 1\n          ? (candidateTexts[index + 1] ?? \"\")\n          : \"\";\n      const match = this.#scoreAnchor(anchor, text, label);\n\n      ranked.push({\n        exactNormalized: match.exactNormalized,\n        exactRaw: match.exactRaw,\n        exactSubstring: match.exactSubstring,\n        index,\n        nextText,\n        occurrenceId: `S${index + 1}`,\n        prevText,\n        score: match.score,\n        sentenceId,\n        text,\n      });\n    }\n\n    ranked.sort((left, right) => {\n      if (left.score !== right.score) {\n        return right.score - left.score;\n      }\n\n      if (left.exactRaw !== right.exactRaw) {\n        return left.exactRaw ? -1 : 1;\n      }\n\n      if (left.exactSubstring !== right.exactSubstring) {\n        return left.exactSubstring ? -1 : 1;\n      }\n\n      if (left.exactNormalized !== right.exactNormalized) {\n        return left.exactNormalized ? -1 : 1;\n      }\n\n      return left.index - right.index;\n    });\n\n    return ranked;\n  }\n\n  #scoreAnchor(\n    anchor: AnchorSpec,\n    candidateText: string,\n    label: string,\n  ): TextMatchScore {\n    if (anchor.mode === \"head_tail\") {\n      return this.#scoreHeadTail(anchor, candidateText);\n    }\n\n    return this.#scoreTextQuery(anchor.text ?? \"\", candidateText, label);\n  }\n\n  #scoreHeadTail(anchor: AnchorSpec, candidateText: string): TextMatchScore {\n    const head = anchor.head ?? \"\";\n    const tail = anchor.tail ?? \"\";\n    const candidateNormalized = normalizeText(candidateText);\n    const headNormalized = normalizeText(head);\n    const tailNormalized = normalizeText(tail);\n\n    if (headNormalized === \"\" || tailNormalized === \"\") {\n      return createEmptyTextMatchScore();\n    }\n\n    const headPosition = candidateNormalized.indexOf(headNormalized);\n    const tailPosition = candidateNormalized.lastIndexOf(tailNormalized);\n\n    if (\n      headPosition !== -1 &&\n      tailPosition !== -1 &&\n      headPosition <= tailPosition\n    ) {\n      const coveredChars = headNormalized.length + tailNormalized.length;\n      const coverage = Math.min(\n        1,\n        coveredChars / Math.max(1, candidateNormalized.length),\n      );\n\n      return {\n        exactNormalized: false,\n        exactRaw: false,\n        exactSubstring: true,\n        matchEnd: tailPosition + tailNormalized.length,\n        matchStart: headPosition,\n        score: 0.82 + 0.18 * coverage,\n      };\n    }\n\n    const headMatch = this.#scoreTextQuery(head, candidateText, \"start_anchor\");\n    const tailMatch = this.#scoreTextQuery(tail, candidateText, \"end_anchor\");\n    const ordered = headMatch.matchStart <= tailMatch.matchStart ? 1 : 0.85;\n\n    return {\n      exactNormalized: false,\n      exactRaw: false,\n      exactSubstring: false,\n      matchEnd: Math.max(headMatch.matchEnd, tailMatch.matchEnd),\n      matchStart: Math.min(headMatch.matchStart, tailMatch.matchStart),\n      score: ((headMatch.score + tailMatch.score) / 2) * ordered,\n    };\n  }\n\n  #scoreTextQuery(\n    queryText: string,\n    candidateText: string,\n    label: string,\n  ): TextMatchScore {\n    const queryRaw = queryText.trim();\n    const candidateRaw = candidateText.trim();\n    const queryNormalized = normalizeText(queryRaw);\n    const candidateNormalized = normalizeText(candidateRaw);\n\n    if (queryNormalized === \"\" || candidateNormalized === \"\") {\n      return createEmptyTextMatchScore();\n    }\n\n    if (queryRaw === candidateRaw) {\n      return {\n        exactNormalized: true,\n        exactRaw: true,\n        exactSubstring: true,\n        matchEnd: candidateNormalized.length,\n        matchStart: 0,\n        score: 1,\n      };\n    }\n\n    if (queryNormalized === candidateNormalized) {\n      return {\n        exactNormalized: true,\n        exactRaw: false,\n        exactSubstring: false,\n        matchEnd: candidateNormalized.length,\n        matchStart: 0,\n        score: 0.995,\n      };\n    }\n\n    if (candidateNormalized.includes(queryNormalized)) {\n      const matchStart = candidateNormalized.indexOf(queryNormalized);\n      const coverage =\n        queryNormalized.length / Math.max(1, candidateNormalized.length);\n      const boundaryBonus = this.#boundaryBonus({\n        candidateNormalized,\n        label,\n        matchEnd: matchStart + queryNormalized.length,\n        matchStart,\n        queryNormalized,\n      });\n\n      return {\n        exactNormalized: false,\n        exactRaw: false,\n        exactSubstring: true,\n        matchEnd: matchStart + queryNormalized.length,\n        matchStart,\n        score: Math.min(1, 0.75 + 0.25 * coverage + boundaryBonus),\n      };\n    }\n\n    if (queryNormalized.includes(candidateNormalized)) {\n      const coverage =\n        candidateNormalized.length / Math.max(1, queryNormalized.length);\n\n      return {\n        exactNormalized: false,\n        exactRaw: false,\n        exactSubstring: false,\n        matchEnd: candidateNormalized.length,\n        matchStart: 0,\n        score: Math.min(0.92, 0.78 + 0.14 * coverage),\n      };\n    }\n\n    let bestScore = 0;\n    let bestStart = -1;\n    let bestEnd = -1;\n    const maxWindow = Math.min(\n      candidateNormalized.length,\n      Math.max(\n        queryNormalized.length,\n        Math.floor(queryNormalized.length * 1.2),\n      ),\n    );\n    const minWindow = Math.min(\n      maxWindow,\n      Math.max(1, Math.floor(queryNormalized.length * 0.8)),\n    );\n    const queryChars = new Set(queryNormalized);\n\n    for (let windowSize = minWindow; windowSize <= maxWindow; windowSize += 1) {\n      for (\n        let start = 0;\n        start <= candidateNormalized.length - windowSize;\n        start += 1\n      ) {\n        const window = candidateNormalized.slice(start, start + windowSize);\n        const windowChars = new Set(window);\n        const unionSize = new Set([...queryChars, ...windowChars]).size;\n        const overlapSize = [...queryChars].filter((char) =>\n          windowChars.has(char),\n        ).length;\n        const jaccard = unionSize === 0 ? 0 : overlapSize / unionSize;\n\n        if (jaccard < 0.35) {\n          continue;\n        }\n\n        const totalScore =\n          0.35 * charNgramScore(queryNormalized, window) +\n          0.35 * sequenceSimilarity(queryNormalized, window) +\n          0.2 * levenshteinSimilarity(queryNormalized, window) +\n          0.1 * lengthPenalty(queryNormalized, window) +\n          this.#boundaryBonus({\n            candidateNormalized,\n            label,\n            matchEnd: start + windowSize,\n            matchStart: start,\n            queryNormalized,\n          });\n\n        if (totalScore > bestScore) {\n          bestScore = Math.min(1, totalScore);\n          bestStart = start;\n          bestEnd = start + windowSize;\n        }\n      }\n    }\n\n    return {\n      exactNormalized: false,\n      exactRaw: false,\n      exactSubstring: false,\n      matchEnd: bestEnd,\n      matchStart: bestStart,\n      score: bestScore,\n    };\n  }\n\n  #parseAnchor(\n    value: unknown,\n  ): readonly [anchor: AnchorSpec | undefined, error: string | undefined] {\n    if (value === undefined || value === null) {\n      return [undefined, \"anchor is required\"];\n    }\n\n    if (typeof value === \"string\") {\n      const stripped = value.trim();\n\n      if (stripped === \"\") {\n        return [undefined, \"anchor string is empty\"];\n      }\n\n      if (stripped.includes(\"...\")) {\n        const parts = stripped\n          .split(\"...\")\n          .map((part) => part.trim())\n          .filter((part) => part !== \"\");\n\n        if (parts.length >= 2) {\n          const head = parts[0];\n          const tail = parts[parts.length - 1];\n\n          if (head === undefined || tail === undefined) {\n            return [undefined, \"anchor string is empty\"];\n          }\n\n          return [\n            {\n              head,\n              mode: \"head_tail\",\n              tail,\n            },\n            undefined,\n          ];\n        }\n      }\n\n      return [{ mode: \"full\", text: stripped }, undefined];\n    }\n\n    if (typeof value !== \"object\") {\n      return [undefined, `expected string or object, got ${typeof value}`];\n    }\n\n    const rawValue = value as Record<string, unknown>;\n    const mode =\n      rawValue.mode === \"head_tail\" || rawValue.head !== undefined\n        ? \"head_tail\"\n        : \"full\";\n\n    if (mode === \"full\") {\n      const text =\n        typeof rawValue.text === \"string\" ? rawValue.text.trim() : \"\";\n\n      if (text === \"\") {\n        return [undefined, \"full anchor requires non-empty 'text'\"];\n      }\n\n      return [{ mode: \"full\", text }, undefined];\n    }\n\n    const head = typeof rawValue.head === \"string\" ? rawValue.head.trim() : \"\";\n    const tail = typeof rawValue.tail === \"string\" ? rawValue.tail.trim() : \"\";\n\n    if (head !== \"\" && tail === \"\") {\n      return [{ mode: \"full\", text: head }, undefined];\n    }\n\n    if (head === \"\" && tail !== \"\") {\n      return [{ mode: \"full\", text: tail }, undefined];\n    }\n\n    if (head === \"\" || tail === \"\") {\n      return [\n        undefined,\n        \"head_tail anchor requires non-empty 'head' and 'tail'\",\n      ];\n    }\n\n    return [{ head, mode: \"head_tail\", tail }, undefined];\n  }\n\n  #normalizeAnchor(\n    anchor: AnchorSpec | undefined,\n    fieldName: string,\n  ): AnchorSpec | undefined {\n    if (anchor === undefined) {\n      return undefined;\n    }\n\n    if (anchor.mode === \"head_tail\") {\n      const boundaryText =\n        fieldName === \"end_anchor\"\n          ? this.#selectBoundarySentence(anchor.tail ?? \"\", \"end_anchor\")\n          : this.#selectBoundarySentence(anchor.head ?? \"\", \"start_anchor\");\n\n      return boundaryText === \"\"\n        ? undefined\n        : {\n            mode: \"full\",\n            text: boundaryText,\n          };\n    }\n\n    const normalizedText = this.#selectBoundarySentence(\n      anchor.text ?? \"\",\n      fieldName,\n    );\n\n    return {\n      mode: \"full\",\n      text: normalizedText,\n    };\n  }\n\n  #selectBoundarySentence(text: string, fieldName: string): string {\n    const sentences = splitTextIntoSentences(text);\n\n    if (sentences.length <= 1) {\n      return text.trim();\n    }\n\n    return fieldName === \"end_anchor\"\n      ? (sentences[sentences.length - 1] ?? text.trim())\n      : (sentences[0] ?? text.trim());\n  }\n\n  #boundaryBonus(input: {\n    label: string;\n    queryNormalized: string;\n    candidateNormalized: string;\n    matchStart: number;\n    matchEnd: number;\n  }): number {\n    if (input.matchStart < 0 || input.matchEnd < 0) {\n      return 0;\n    }\n\n    if (input.queryNormalized.length < MIN_BOUNDARY_BONUS_LENGTH) {\n      return 0;\n    }\n\n    if (input.label === \"start_anchor\" && input.matchStart !== 0) {\n      return 0;\n    }\n\n    if (\n      input.label === \"end_anchor\" &&\n      input.matchEnd !== input.candidateNormalized.length\n    ) {\n      return 0;\n    }\n\n    const coverage =\n      input.queryNormalized.length /\n      Math.max(1, input.candidateNormalized.length);\n\n    return MAX_BOUNDARY_BONUS * (0.5 + 0.5 * Math.min(1, coverage));\n  }\n\n  #tryAutoSelectScoredDuplicates(\n    candidates: readonly RankedSentenceCandidate[],\n  ): RankedSentenceCandidate | undefined {\n    if (candidates.length === 0) {\n      return undefined;\n    }\n\n    if (candidates.length === 1) {\n      return candidates[0];\n    }\n\n    const topCandidate = candidates[0];\n\n    if (topCandidate === undefined) {\n      return undefined;\n    }\n\n    const secondScore = candidates[1]?.score ?? 0;\n\n    if (\n      topCandidate.score >= MIN_AUTO_RESOLVE_SCORE &&\n      topCandidate.score - secondScore >= MIN_AUTO_RESOLVE_GAP\n    ) {\n      return topCandidate;\n    }\n\n    return undefined;\n  }\n\n  #buildAmbiguousFailure(\n    label: string,\n    code: string,\n    candidates: readonly RankedSentenceCandidate[],\n  ): EvidenceResolutionFailure {\n    const topCandidates = candidates.slice(0, MAX_CANDIDATE_DISPLAY);\n    const formatted = topCandidates\n      .map((candidate) => formatCandidate(candidate))\n      .join(\"\\n\");\n\n    return {\n      candidates: topCandidates,\n      code,\n      fieldName: label,\n      message:\n        `${label} is ambiguous. Top candidates:\\n${formatted}\\n` +\n        \"Please provide a more specific anchor or surrounding context.\",\n    };\n  }\n\n  #anchorLength(anchor: AnchorSpec): number {\n    if (anchor.mode === \"head_tail\") {\n      return (\n        normalizeText(anchor.head ?? \"\").length +\n        normalizeText(anchor.tail ?? \"\").length\n      );\n    }\n\n    return normalizeText(anchor.text ?? \"\").length;\n  }\n}\n\nfunction createEmptyTextMatchScore(): TextMatchScore {\n  return {\n    exactNormalized: false,\n    exactRaw: false,\n    exactSubstring: false,\n    matchEnd: -1,\n    matchStart: -1,\n    score: 0,\n  };\n}\n\nfunction charNgramScore(left: string, right: string): number {\n  const leftBigrams = charNgrams(left, 2);\n  const rightBigrams = charNgrams(right, 2);\n  const leftTrigrams = charNgrams(left, 3);\n  const rightTrigrams = charNgrams(right, 3);\n\n  return (\n    (diceCoefficient(leftBigrams, rightBigrams) +\n      diceCoefficient(leftTrigrams, rightTrigrams)) /\n    2\n  );\n}\n\nfunction charNgrams(text: string, size: number): Set<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 levenshteinSimilarity(left: string, right: string): number {\n  if (left === right) {\n    return 1;\n  }\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\n  for (const [leftIndex, leftChar] of [...left].entries()) {\n    current[0] = leftIndex + 1;\n\n    for (const [rightIndex, rightChar] of [...right].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[right.length] ?? Math.max(left.length, right.length);\n\n  return 1 - distance / Math.max(left.length, right.length);\n}\n\nfunction lengthPenalty(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 sequenceSimilarity(left: string, right: string): number {\n  if (left === right) {\n    return 1;\n  }\n\n  const leftLength = left.length;\n  const rightLength = right.length;\n\n  if (leftLength === 0 || rightLength === 0) {\n    return 0;\n  }\n\n  const matrix = Array.from({ length: leftLength + 1 }, () =>\n    new Array<number>(rightLength + 1).fill(0),\n  );\n  let longest = 0;\n\n  for (let leftIndex = 1; leftIndex <= leftLength; leftIndex += 1) {\n    for (let rightIndex = 1; rightIndex <= rightLength; rightIndex += 1) {\n      if (left[leftIndex - 1] !== right[rightIndex - 1]) {\n        continue;\n      }\n\n      const currentRow = matrix[leftIndex];\n\n      if (currentRow === undefined) {\n        continue;\n      }\n\n      currentRow[rightIndex] =\n        (matrix[leftIndex - 1]?.[rightIndex - 1] ?? 0) + 1;\n      longest = Math.max(longest, currentRow[rightIndex] ?? 0);\n    }\n  }\n\n  return (2 * longest) / (leftLength + rightLength);\n}\n\nfunction formatCandidate(candidate: RankedSentenceCandidate): string {\n  return (\n    `  - ${candidate.occurrenceId} score=${candidate.score.toFixed(3)}\\n` +\n    `    prev: ${truncate(candidate.prevText)}\\n` +\n    `    text: ${truncate(candidate.text, 120)}\\n` +\n    `    next: ${truncate(candidate.nextText)}`\n  );\n}\n\nfunction truncate(text: string, limit = 80): string {\n  const stripped = text.replace(/\\s+/gu, \" \").trim();\n\n  if (stripped === \"\") {\n    return \"(none)\";\n  }\n\n  if (stripped.length <= limit) {\n    return stripped;\n  }\n\n  return `${stripped.slice(0, limit - 3)}...`;\n}\n"],"mappings":"AAMA,SAAS,eAAe,8BAA8B;AAEtD,MAAM,uBAAuB;AAC7B,MAAM,yBAAyB;AAC/B,MAAM,4BAA4B;AAClC,MAAM,sBAAsB;AAC5B,MAAM,6BAA6B;AACnC,MAAM,qBAAqB;AAC3B,MAAM,wBAAwB;AAkBvB,MAAM,iBAAiB;AAAA,EACrB,QACL,UACA,sBACA,gBAIA;AACA,UAAM,aAAa,SAAS,gBAAgB,SAAS;AACrD,UAAM,WAAW,SAAS,cAAc,SAAS;AAEjD,UAAM,CAAC,aAAa,YAAY,IAAI,KAAK;AAAA,MACvC;AAAA,MACA;AAAA,IACF;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO,CAAC,QAAW,YAAY;AAAA,IACjC;AAEA,QAAI;AAEJ,QAAI,aAAa,QAAW;AAC1B,YAAM,CAAC,iBAAiB,UAAU,IAAI,KAAK;AAAA,QACzC;AAAA,QACA;AAAA,MACF;AAEA,UAAI,eAAe,QAAW;AAC5B,eAAO,CAAC,QAAW,UAAU;AAAA,MAC/B;AAEA,kBAAY;AAAA,IACd;AAEA,UAAM,CAAC,gBAAgB,eAAe,mBAAmB,IACvD,KAAK,cAAc;AAAA,MACjB,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AAEH,QAAI,wBAAwB,QAAW;AACrC,aAAO,CAAC,QAAW,mBAAmB;AAAA,IACxC;AAEA,QAAI,mBAAmB,QAAW;AAChC,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,QACL;AAAA,UACE,YAAY,eAAe;AAAA,UAC3B,aAAa,CAAC,eAAe,UAAU;AAAA,UACvC,UAAU;AAAA,QACZ;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,CAAC,cAAc,aAAa,iBAAiB,IAAI,KAAK,cAAc;AAAA,MACxE,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,UAAU,eAAe;AAAA,IAC3B,CAAC;AAED,QAAI,sBAAsB,QAAW;AACnC,aAAO,CAAC,QAAW,iBAAiB;AAAA,IACtC;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,QAAQ,eAAe,OAAO;AAC7C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SACE,oEACI,eAAe,YAAY,OAAO,aAAa,YAAY;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,QACE,YAAY,KAAK,IAAI,eAAe,OAAO,aAAa,KAAK;AAAA,QAC7D,aAAa,qBAAqB;AAAA,UAChC,eAAe;AAAA,UACf,aAAa,QAAQ;AAAA,QACvB;AAAA,QACA,UAAU,GAAG,aAAa,IAAI,WAAW;AAAA,MAC3C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEO,qBAAqB,OAU1B;AACA,UAAM,aAAa,MAAM,SAAS,gBAAgB,MAAM,SAAS;AACjE,UAAM,WAAW,MAAM,SAAS,cAAc,MAAM,SAAS;AAE7D,UAAM,CAAC,aAAa,YAAY,IAAI,KAAK;AAAA,MACvC;AAAA,MACA;AAAA,IACF;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO,CAAC,QAAW,YAAY;AAAA,IACjC;AAEA,UAAM,yBAAyB,MAAM,UAAU;AAC/C,UAAM,CAAC,gBAAgB,eAAe,mBAAmB,IACvD,2BAA2B,SACvB,KAAK,cAAc;AAAA,MACjB,QAAQ;AAAA,MACR,sBAAsB,MAAM;AAAA,MAC5B,gBAAgB,MAAM;AAAA,MACtB,OAAO;AAAA,IACT,CAAC,IACD,CAAC,wBAAwB,gBAAgB,MAAS;AAExD,QAAI,wBAAwB,QAAW;AACrC,aAAO,CAAC,QAAW,mBAAmB;AAAA,IACxC;AAEA,QAAI,mBAAmB,QAAW;AAChC,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,QAAW;AAC1B,aAAO;AAAA,QACL;AAAA,UACE,YAAY,eAAe;AAAA,UAC3B,aAAa,CAAC,eAAe,UAAU;AAAA,UACvC,UAAU;AAAA,QACZ;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,CAAC,WAAW,UAAU,IAAI,KAAK,YAAY,UAAU,YAAY;AAEvE,QAAI,eAAe,QAAW;AAC5B,aAAO,CAAC,QAAW,UAAU;AAAA,IAC/B;AAEA,UAAM,uBAAuB,MAAM,UAAU;AAC7C,UAAM,CAAC,cAAc,aAAa,iBAAiB,IACjD,yBAAyB,SACrB,KAAK,cAAc;AAAA,MACjB,QAAQ;AAAA,MACR,sBAAsB,MAAM;AAAA,MAC5B,gBAAgB,MAAM;AAAA,MACtB,OAAO;AAAA,MACP,UAAU,eAAe;AAAA,IAC3B,CAAC,IACD,CAAC,sBAAsB,gBAAgB,MAAS;AAEtD,QAAI,sBAAsB,QAAW;AACnC,aAAO,CAAC,QAAW,iBAAiB;AAAA,IACtC;AAEA,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,QAAQ,eAAe,OAAO;AAC7C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SACE,oEACI,eAAe,YAAY,OAAO,aAAa,YAAY;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,QACE,YAAY,KAAK,IAAI,eAAe,OAAO,aAAa,KAAK;AAAA,QAC7D,aAAa,MAAM,qBAAqB;AAAA,UACtC,eAAe;AAAA,UACf,aAAa,QAAQ;AAAA,QACvB;AAAA,QACA,UAAU,GAAG,aAAa,IAAI,WAAW;AAAA,MAC3C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEO,YACL,OACA,WAIA;AACA,UAAM,CAAC,QAAQ,KAAK,IAAI,KAAK,aAAa,KAAK;AAE/C,QAAI,UAAU,QAAW;AACvB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN;AAAA,UACA,SAAS,oBAAoB,SAAS,KAAK,KAAK;AAAA,QAClD;AAAA,MACF;AAAA,IACF;AAEA,WAAO,CAAC,KAAK,iBAAiB,QAAQ,SAAS,GAAG,MAAS;AAAA,EAC7D;AAAA,EAEO,cAAc,OAUnB;AACA,QAAI,MAAM,WAAW,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SAAS,GAAG,MAAM,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,aAAa,KAAK;AAAA,MACpB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAEA,UAAM,WAAW,MAAM;AAEvB,QAAI,aAAa,QAAW;AAC1B,mBAAa,WAAW;AAAA,QACtB,CAAC,cAAc,UAAU,SAAS;AAAA,MACpC;AAAA,IACF;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SAAS,GAAG,MAAM,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,WAAW,WAAW,OAAO,CAAC,cAAc,UAAU,QAAQ;AAEpE,QAAI,SAAS,WAAW,GAAG;AACzB,aAAO,CAAC,SAAS,CAAC,GAAG,aAAa,MAAS;AAAA,IAC7C;AAEA,QAAI,SAAS,SAAS,GAAG;AACvB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,iBAAiB,WAAW;AAAA,MAChC,CAAC,cAAc,UAAU;AAAA,IAC3B;AAEA,QAAI,eAAe,WAAW,KAAK,KAAK,cAAc,MAAM,MAAM,KAAK,GAAG;AACxE,aAAO,CAAC,eAAe,CAAC,GAAG,mBAAmB,MAAS;AAAA,IACzD;AAEA,QAAI,eAAe,SAAS,KAAK,KAAK,cAAc,MAAM,MAAM,KAAK,GAAG;AACtE,YAAM,WAAW,KAAK,+BAA+B,cAAc;AAEnE,UAAI,aAAa,QAAW;AAC1B,eAAO,CAAC,UAAU,0BAA0B,MAAS;AAAA,MACvD;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,kBAAkB,WAAW;AAAA,MACjC,CAAC,cAAc,UAAU;AAAA,IAC3B;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,CAAC,gBAAgB,CAAC,GAAG,oBAAoB,MAAS;AAAA,IAC3D;AAEA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,YAAM,WAAW,KAAK,+BAA+B,eAAe;AAEpE,UAAI,aAAa,QAAW;AAC1B,eAAO,CAAC,UAAU,2BAA2B,MAAS;AAAA,MACxD;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,eAAe,WAAW,CAAC;AAEjC,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,CAAC;AAAA,UACb,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SAAS,GAAG,MAAM,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,cAAc,WAAW,CAAC,GAAG,SAAS;AAC5C,UAAM,MAAM,aAAa,QAAQ;AAEjC,QAAI,aAAa,QAAQ,qBAAqB;AAC5C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,UACE,YAAY,WAAW,MAAM,GAAG,qBAAqB;AAAA,UACrD,MAAM;AAAA,UACN,WAAW,MAAM;AAAA,UACjB,SACE,GAAG,MAAM,KAAK,2DACU,aAAa,MAAM,QAAQ,CAAC,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO,CAAC,cAAc,8BAA8B,MAAS;AAAA,IAC/D;AAEA,QAAI,aAAa,SAAS,4BAA4B;AACpD,aAAO,CAAC,cAAc,uBAAuB,MAAS;AAAA,IACxD;AAEA,QACE,aAAa,SAAS,0BACtB,OAAO,sBACP;AACA,aAAO,CAAC,cAAc,aAAa,MAAS;AAAA,IAC9C;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,KAAK,uBAAuB,MAAM,OAAO,oBAAoB,UAAU;AAAA,IACzE;AAAA,EACF;AAAA,EAEO,WACL,QACA,sBACA,gBACA,OAC2B;AAC3B,UAAM,SAAoC,CAAC;AAE3C,eAAW,CAAC,OAAO,UAAU,KAAK,qBAAqB,QAAQ,GAAG;AAChE,YAAM,OAAO,eAAe,KAAK,KAAK;AACtC,YAAM,WAAW,QAAQ,IAAK,eAAe,QAAQ,CAAC,KAAK,KAAM;AACjE,YAAM,WACJ,QAAQ,eAAe,SAAS,IAC3B,eAAe,QAAQ,CAAC,KAAK,KAC9B;AACN,YAAM,QAAQ,KAAK,aAAa,QAAQ,MAAM,KAAK;AAEnD,aAAO,KAAK;AAAA,QACV,iBAAiB,MAAM;AAAA,QACvB,UAAU,MAAM;AAAA,QAChB,gBAAgB,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA,cAAc,IAAI,QAAQ,CAAC;AAAA,QAC3B;AAAA,QACA,OAAO,MAAM;AAAA,QACb;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAEA,WAAO,KAAK,CAAC,MAAM,UAAU;AAC3B,UAAI,KAAK,UAAU,MAAM,OAAO;AAC9B,eAAO,MAAM,QAAQ,KAAK;AAAA,MAC5B;AAEA,UAAI,KAAK,aAAa,MAAM,UAAU;AACpC,eAAO,KAAK,WAAW,KAAK;AAAA,MAC9B;AAEA,UAAI,KAAK,mBAAmB,MAAM,gBAAgB;AAChD,eAAO,KAAK,iBAAiB,KAAK;AAAA,MACpC;AAEA,UAAI,KAAK,oBAAoB,MAAM,iBAAiB;AAClD,eAAO,KAAK,kBAAkB,KAAK;AAAA,MACrC;AAEA,aAAO,KAAK,QAAQ,MAAM;AAAA,IAC5B,CAAC;AAED,WAAO;AAAA,EACT;AAAA,EAEA,aACE,QACA,eACA,OACgB;AAChB,QAAI,OAAO,SAAS,aAAa;AAC/B,aAAO,KAAK,eAAe,QAAQ,aAAa;AAAA,IAClD;AAEA,WAAO,KAAK,gBAAgB,OAAO,QAAQ,IAAI,eAAe,KAAK;AAAA,EACrE;AAAA,EAEA,eAAe,QAAoB,eAAuC;AACxE,UAAM,OAAO,OAAO,QAAQ;AAC5B,UAAM,OAAO,OAAO,QAAQ;AAC5B,UAAM,sBAAsB,cAAc,aAAa;AACvD,UAAM,iBAAiB,cAAc,IAAI;AACzC,UAAM,iBAAiB,cAAc,IAAI;AAEzC,QAAI,mBAAmB,MAAM,mBAAmB,IAAI;AAClD,aAAO,0BAA0B;AAAA,IACnC;AAEA,UAAM,eAAe,oBAAoB,QAAQ,cAAc;AAC/D,UAAM,eAAe,oBAAoB,YAAY,cAAc;AAEnE,QACE,iBAAiB,MACjB,iBAAiB,MACjB,gBAAgB,cAChB;AACA,YAAM,eAAe,eAAe,SAAS,eAAe;AAC5D,YAAM,WAAW,KAAK;AAAA,QACpB;AAAA,QACA,eAAe,KAAK,IAAI,GAAG,oBAAoB,MAAM;AAAA,MACvD;AAEA,aAAO;AAAA,QACL,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,UAAU,eAAe,eAAe;AAAA,QACxC,YAAY;AAAA,QACZ,OAAO,OAAO,OAAO;AAAA,MACvB;AAAA,IACF;AAEA,UAAM,YAAY,KAAK,gBAAgB,MAAM,eAAe,cAAc;AAC1E,UAAM,YAAY,KAAK,gBAAgB,MAAM,eAAe,YAAY;AACxE,UAAM,UAAU,UAAU,cAAc,UAAU,aAAa,IAAI;AAEnE,WAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,UAAU,KAAK,IAAI,UAAU,UAAU,UAAU,QAAQ;AAAA,MACzD,YAAY,KAAK,IAAI,UAAU,YAAY,UAAU,UAAU;AAAA,MAC/D,QAAS,UAAU,QAAQ,UAAU,SAAS,IAAK;AAAA,IACrD;AAAA,EACF;AAAA,EAEA,gBACE,WACA,eACA,OACgB;AAChB,UAAM,WAAW,UAAU,KAAK;AAChC,UAAM,eAAe,cAAc,KAAK;AACxC,UAAM,kBAAkB,cAAc,QAAQ;AAC9C,UAAM,sBAAsB,cAAc,YAAY;AAEtD,QAAI,oBAAoB,MAAM,wBAAwB,IAAI;AACxD,aAAO,0BAA0B;AAAA,IACnC;AAEA,QAAI,aAAa,cAAc;AAC7B,aAAO;AAAA,QACL,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,UAAU,oBAAoB;AAAA,QAC9B,YAAY;AAAA,QACZ,OAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,oBAAoB,qBAAqB;AAC3C,aAAO;AAAA,QACL,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,UAAU,oBAAoB;AAAA,QAC9B,YAAY;AAAA,QACZ,OAAO;AAAA,MACT;AAAA,IACF;AAEA,QAAI,oBAAoB,SAAS,eAAe,GAAG;AACjD,YAAM,aAAa,oBAAoB,QAAQ,eAAe;AAC9D,YAAM,WACJ,gBAAgB,SAAS,KAAK,IAAI,GAAG,oBAAoB,MAAM;AACjE,YAAM,gBAAgB,KAAK,eAAe;AAAA,QACxC;AAAA,QACA;AAAA,QACA,UAAU,aAAa,gBAAgB;AAAA,QACvC;AAAA,QACA;AAAA,MACF,CAAC;AAED,aAAO;AAAA,QACL,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,UAAU,aAAa,gBAAgB;AAAA,QACvC;AAAA,QACA,OAAO,KAAK,IAAI,GAAG,OAAO,OAAO,WAAW,aAAa;AAAA,MAC3D;AAAA,IACF;AAEA,QAAI,gBAAgB,SAAS,mBAAmB,GAAG;AACjD,YAAM,WACJ,oBAAoB,SAAS,KAAK,IAAI,GAAG,gBAAgB,MAAM;AAEjE,aAAO;AAAA,QACL,iBAAiB;AAAA,QACjB,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,UAAU,oBAAoB;AAAA,QAC9B,YAAY;AAAA,QACZ,OAAO,KAAK,IAAI,MAAM,OAAO,OAAO,QAAQ;AAAA,MAC9C;AAAA,IACF;AAEA,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,QAAI,UAAU;AACd,UAAM,YAAY,KAAK;AAAA,MACrB,oBAAoB;AAAA,MACpB,KAAK;AAAA,QACH,gBAAgB;AAAA,QAChB,KAAK,MAAM,gBAAgB,SAAS,GAAG;AAAA,MACzC;AAAA,IACF;AACA,UAAM,YAAY,KAAK;AAAA,MACrB;AAAA,MACA,KAAK,IAAI,GAAG,KAAK,MAAM,gBAAgB,SAAS,GAAG,CAAC;AAAA,IACtD;AACA,UAAM,aAAa,IAAI,IAAI,eAAe;AAE1C,aAAS,aAAa,WAAW,cAAc,WAAW,cAAc,GAAG;AACzE,eACM,QAAQ,GACZ,SAAS,oBAAoB,SAAS,YACtC,SAAS,GACT;AACA,cAAM,SAAS,oBAAoB,MAAM,OAAO,QAAQ,UAAU;AAClE,cAAM,cAAc,IAAI,IAAI,MAAM;AAClC,cAAM,aAAY,oBAAI,IAAI,CAAC,GAAG,YAAY,GAAG,WAAW,CAAC,GAAE;AAC3D,cAAM,cAAc,CAAC,GAAG,UAAU,EAAE;AAAA,UAAO,CAAC,SAC1C,YAAY,IAAI,IAAI;AAAA,QACtB,EAAE;AACF,cAAM,UAAU,cAAc,IAAI,IAAI,cAAc;AAEpD,YAAI,UAAU,MAAM;AAClB;AAAA,QACF;AAEA,cAAM,aACJ,OAAO,eAAe,iBAAiB,MAAM,IAC7C,OAAO,mBAAmB,iBAAiB,MAAM,IACjD,MAAM,sBAAsB,iBAAiB,MAAM,IACnD,MAAM,cAAc,iBAAiB,MAAM,IAC3C,KAAK,eAAe;AAAA,UAClB;AAAA,UACA;AAAA,UACA,UAAU,QAAQ;AAAA,UAClB,YAAY;AAAA,UACZ;AAAA,QACF,CAAC;AAEH,YAAI,aAAa,WAAW;AAC1B,sBAAY,KAAK,IAAI,GAAG,UAAU;AAClC,sBAAY;AACZ,oBAAU,QAAQ;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,OAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,aACE,OACsE;AACtE,QAAI,UAAU,UAAa,UAAU,MAAM;AACzC,aAAO,CAAC,QAAW,oBAAoB;AAAA,IACzC;AAEA,QAAI,OAAO,UAAU,UAAU;AAC7B,YAAM,WAAW,MAAM,KAAK;AAE5B,UAAI,aAAa,IAAI;AACnB,eAAO,CAAC,QAAW,wBAAwB;AAAA,MAC7C;AAEA,UAAI,SAAS,SAAS,KAAK,GAAG;AAC5B,cAAM,QAAQ,SACX,MAAM,KAAK,EACX,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,SAAS,EAAE;AAE/B,YAAI,MAAM,UAAU,GAAG;AACrB,gBAAMA,QAAO,MAAM,CAAC;AACpB,gBAAMC,QAAO,MAAM,MAAM,SAAS,CAAC;AAEnC,cAAID,UAAS,UAAaC,UAAS,QAAW;AAC5C,mBAAO,CAAC,QAAW,wBAAwB;AAAA,UAC7C;AAEA,iBAAO;AAAA,YACL;AAAA,cACE,MAAAD;AAAA,cACA,MAAM;AAAA,cACN,MAAAC;AAAA,YACF;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO,CAAC,EAAE,MAAM,QAAQ,MAAM,SAAS,GAAG,MAAS;AAAA,IACrD;AAEA,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,CAAC,QAAW,kCAAkC,OAAO,KAAK,EAAE;AAAA,IACrE;AAEA,UAAM,WAAW;AACjB,UAAM,OACJ,SAAS,SAAS,eAAe,SAAS,SAAS,SAC/C,cACA;AAEN,QAAI,SAAS,QAAQ;AACnB,YAAM,OACJ,OAAO,SAAS,SAAS,WAAW,SAAS,KAAK,KAAK,IAAI;AAE7D,UAAI,SAAS,IAAI;AACf,eAAO,CAAC,QAAW,uCAAuC;AAAA,MAC5D;AAEA,aAAO,CAAC,EAAE,MAAM,QAAQ,KAAK,GAAG,MAAS;AAAA,IAC3C;AAEA,UAAM,OAAO,OAAO,SAAS,SAAS,WAAW,SAAS,KAAK,KAAK,IAAI;AACxE,UAAM,OAAO,OAAO,SAAS,SAAS,WAAW,SAAS,KAAK,KAAK,IAAI;AAExE,QAAI,SAAS,MAAM,SAAS,IAAI;AAC9B,aAAO,CAAC,EAAE,MAAM,QAAQ,MAAM,KAAK,GAAG,MAAS;AAAA,IACjD;AAEA,QAAI,SAAS,MAAM,SAAS,IAAI;AAC9B,aAAO,CAAC,EAAE,MAAM,QAAQ,MAAM,KAAK,GAAG,MAAS;AAAA,IACjD;AAEA,QAAI,SAAS,MAAM,SAAS,IAAI;AAC9B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,WAAO,CAAC,EAAE,MAAM,MAAM,aAAa,KAAK,GAAG,MAAS;AAAA,EACtD;AAAA,EAEA,iBACE,QACA,WACwB;AACxB,QAAI,WAAW,QAAW;AACxB,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,SAAS,aAAa;AAC/B,YAAM,eACJ,cAAc,eACV,KAAK,wBAAwB,OAAO,QAAQ,IAAI,YAAY,IAC5D,KAAK,wBAAwB,OAAO,QAAQ,IAAI,cAAc;AAEpE,aAAO,iBAAiB,KACpB,SACA;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,IACN;AAEA,UAAM,iBAAiB,KAAK;AAAA,MAC1B,OAAO,QAAQ;AAAA,MACf;AAAA,IACF;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,wBAAwB,MAAc,WAA2B;AAC/D,UAAM,YAAY,uBAAuB,IAAI;AAE7C,QAAI,UAAU,UAAU,GAAG;AACzB,aAAO,KAAK,KAAK;AAAA,IACnB;AAEA,WAAO,cAAc,eAChB,UAAU,UAAU,SAAS,CAAC,KAAK,KAAK,KAAK,IAC7C,UAAU,CAAC,KAAK,KAAK,KAAK;AAAA,EACjC;AAAA,EAEA,eAAe,OAMJ;AACT,QAAI,MAAM,aAAa,KAAK,MAAM,WAAW,GAAG;AAC9C,aAAO;AAAA,IACT;AAEA,QAAI,MAAM,gBAAgB,SAAS,2BAA2B;AAC5D,aAAO;AAAA,IACT;AAEA,QAAI,MAAM,UAAU,kBAAkB,MAAM,eAAe,GAAG;AAC5D,aAAO;AAAA,IACT;AAEA,QACE,MAAM,UAAU,gBAChB,MAAM,aAAa,MAAM,oBAAoB,QAC7C;AACA,aAAO;AAAA,IACT;AAEA,UAAM,WACJ,MAAM,gBAAgB,SACtB,KAAK,IAAI,GAAG,MAAM,oBAAoB,MAAM;AAE9C,WAAO,sBAAsB,MAAM,MAAM,KAAK,IAAI,GAAG,QAAQ;AAAA,EAC/D;AAAA,EAEA,+BACE,YACqC;AACrC,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,IACT;AAEA,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO,WAAW,CAAC;AAAA,IACrB;AAEA,UAAM,eAAe,WAAW,CAAC;AAEjC,QAAI,iBAAiB,QAAW;AAC9B,aAAO;AAAA,IACT;AAEA,UAAM,cAAc,WAAW,CAAC,GAAG,SAAS;AAE5C,QACE,aAAa,SAAS,0BACtB,aAAa,QAAQ,eAAe,sBACpC;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,uBACE,OACA,MACA,YAC2B;AAC3B,UAAM,gBAAgB,WAAW,MAAM,GAAG,qBAAqB;AAC/D,UAAM,YAAY,cACf,IAAI,CAAC,cAAc,gBAAgB,SAAS,CAAC,EAC7C,KAAK,IAAI;AAEZ,WAAO;AAAA,MACL,YAAY;AAAA,MACZ;AAAA,MACA,WAAW;AAAA,MACX,SACE,GAAG,KAAK;AAAA,EAAmC,SAAS;AAAA;AAAA,IAExD;AAAA,EACF;AAAA,EAEA,cAAc,QAA4B;AACxC,QAAI,OAAO,SAAS,aAAa;AAC/B,aACE,cAAc,OAAO,QAAQ,EAAE,EAAE,SACjC,cAAc,OAAO,QAAQ,EAAE,EAAE;AAAA,IAErC;AAEA,WAAO,cAAc,OAAO,QAAQ,EAAE,EAAE;AAAA,EAC1C;AACF;AAEA,SAAS,4BAA4C;AACnD,SAAO;AAAA,IACL,iBAAiB;AAAA,IACjB,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,OAAO;AAAA,EACT;AACF;AAEA,SAAS,eAAe,MAAc,OAAuB;AAC3D,QAAM,cAAc,WAAW,MAAM,CAAC;AACtC,QAAM,eAAe,WAAW,OAAO,CAAC;AACxC,QAAM,eAAe,WAAW,MAAM,CAAC;AACvC,QAAM,gBAAgB,WAAW,OAAO,CAAC;AAEzC,UACG,gBAAgB,aAAa,YAAY,IACxC,gBAAgB,cAAc,aAAa,KAC7C;AAEJ;AAEA,SAAS,WAAW,MAAc,MAA2B;AAC3D,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,sBAAsB,MAAc,OAAuB;AAClE,MAAI,SAAS,OAAO;AAClB,WAAO;AAAA,EACT;AAEA,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;AAExD,aAAW,CAAC,WAAW,QAAQ,KAAK,CAAC,GAAG,IAAI,EAAE,QAAQ,GAAG;AACvD,YAAQ,CAAC,IAAI,YAAY;AAEzB,eAAW,CAAC,YAAY,SAAS,KAAK,CAAC,GAAG,KAAK,EAAE,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,MAAM,MAAM,KAAK,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAE9D,SAAO,IAAI,WAAW,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAC1D;AAEA,SAAS,cAAc,MAAc,OAAuB;AAC1D,SACE,IACA,KAAK,IAAI,KAAK,SAAS,MAAM,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAE7E;AAEA,SAAS,mBAAmB,MAAc,OAAuB;AAC/D,MAAI,SAAS,OAAO;AAClB,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,KAAK;AACxB,QAAM,cAAc,MAAM;AAE1B,MAAI,eAAe,KAAK,gBAAgB,GAAG;AACzC,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,MAAM;AAAA,IAAK,EAAE,QAAQ,aAAa,EAAE;AAAA,IAAG,MACpD,IAAI,MAAc,cAAc,CAAC,EAAE,KAAK,CAAC;AAAA,EAC3C;AACA,MAAI,UAAU;AAEd,WAAS,YAAY,GAAG,aAAa,YAAY,aAAa,GAAG;AAC/D,aAAS,aAAa,GAAG,cAAc,aAAa,cAAc,GAAG;AACnE,UAAI,KAAK,YAAY,CAAC,MAAM,MAAM,aAAa,CAAC,GAAG;AACjD;AAAA,MACF;AAEA,YAAM,aAAa,OAAO,SAAS;AAEnC,UAAI,eAAe,QAAW;AAC5B;AAAA,MACF;AAEA,iBAAW,UAAU,KAClB,OAAO,YAAY,CAAC,IAAI,aAAa,CAAC,KAAK,KAAK;AACnD,gBAAU,KAAK,IAAI,SAAS,WAAW,UAAU,KAAK,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,SAAQ,IAAI,WAAY,aAAa;AACvC;AAEA,SAAS,gBAAgB,WAA4C;AACnE,SACE,OAAO,UAAU,YAAY,UAAU,UAAU,MAAM,QAAQ,CAAC,CAAC;AAAA,YACpD,SAAS,UAAU,QAAQ,CAAC;AAAA,YAC5B,SAAS,UAAU,MAAM,GAAG,CAAC;AAAA,YAC7B,SAAS,UAAU,QAAQ,CAAC;AAE7C;AAEA,SAAS,SAAS,MAAc,QAAQ,IAAY;AAClD,QAAM,WAAW,KAAK,QAAQ,SAAS,GAAG,EAAE,KAAK;AAEjD,MAAI,aAAa,IAAI;AACnB,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,UAAU,OAAO;AAC5B,WAAO;AAAA,EACT;AAEA,SAAO,GAAG,SAAS,MAAM,GAAG,QAAQ,CAAC,CAAC;AACxC;","names":["head","tail"]}

package/dist/evidence-selection/anchor-types.d.ts

@@ -0,0 +1,27 @@
+import { SentenceId } from '../document/types.js';
+
+interface RankedSentenceCandidate {
+    readonly occurrenceId: string;
+    readonly sentenceId: SentenceId;
+    readonly index: number;
+    readonly text: string;
+    readonly prevText: string;
+    readonly nextText: string;
+    readonly score: number;
+    readonly exactRaw: boolean;
+    readonly exactNormalized: boolean;
+    readonly exactSubstring: boolean;
+}
+interface EvidenceResolutionResult {
+    readonly sentenceIds: SentenceId[];
+    readonly strategy: string;
+    readonly confidence: number;
+}
+interface EvidenceResolutionFailure {
+    readonly fieldName: string;
+    readonly code: string;
+    readonly message: string;
+    readonly candidates: readonly RankedSentenceCandidate[];
+}
+
+export type { EvidenceResolutionFailure, EvidenceResolutionResult, RankedSentenceCandidate };

package/dist/evidence-selection/anchor-types.js

@@ -0,0 +1 @@
+//# sourceMappingURL=anchor-types.js.map

package/dist/evidence-selection/anchor-types.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/evidence-selection/index.d.ts

@@ -0,0 +1,8 @@
+export { EvidenceResolver } from './anchor-resolver.js';
+export { EvidenceResolutionFailure, EvidenceResolutionResult, RankedSentenceCandidate } from './anchor-types.js';
+export { EVIDENCE_SELECTION_JSON_SHAPE, EVIDENCE_SELECTION_PROMPT_FRAGMENT, formatEvidenceSelectionChoicePrompt } from './prompt.js';
+export { EvidenceQuoteMatchStrategy, EvidenceQuoteScore, normalizeEvidenceDisplayText, normalizeEvidenceText, scoreEvidenceQuote } from './quote-score.js';
+export { rankEvidenceQuote, resolveEvidenceSelection, resolveEvidenceSelectionList } from './selection-resolver.js';
+export { normalizeText, splitTextIntoSentences } from './text.js';
+export { EvidenceSelection, EvidenceSelectionCandidate, EvidenceSelectionFailure, EvidenceSelectionList, EvidenceSelectionResolution, EvidenceSelectionSentence, EvidenceSentenceId } from './types.js';
+import '../document/types.js';

package/dist/evidence-selection/index.js

@@ -0,0 +1,32 @@
+import { EvidenceResolver } from "./anchor-resolver.js";
+import {
+  EVIDENCE_SELECTION_JSON_SHAPE,
+  EVIDENCE_SELECTION_PROMPT_FRAGMENT,
+  formatEvidenceSelectionChoicePrompt
+} from "./prompt.js";
+import {
+  normalizeEvidenceDisplayText,
+  normalizeEvidenceText,
+  scoreEvidenceQuote
+} from "./quote-score.js";
+import {
+  rankEvidenceQuote,
+  resolveEvidenceSelection,
+  resolveEvidenceSelectionList
+} from "./selection-resolver.js";
+import { normalizeText, splitTextIntoSentences } from "./text.js";
+export {
+  EVIDENCE_SELECTION_JSON_SHAPE,
+  EVIDENCE_SELECTION_PROMPT_FRAGMENT,
+  EvidenceResolver,
+  formatEvidenceSelectionChoicePrompt,
+  normalizeEvidenceDisplayText,
+  normalizeEvidenceText,
+  normalizeText,
+  rankEvidenceQuote,
+  resolveEvidenceSelection,
+  resolveEvidenceSelectionList,
+  scoreEvidenceQuote,
+  splitTextIntoSentences
+};
+//# sourceMappingURL=index.js.map

package/dist/evidence-selection/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/evidence-selection/index.ts"],"sourcesContent":["export { EvidenceResolver } from \"./anchor-resolver.js\";\nexport type {\n  EvidenceResolutionFailure,\n  EvidenceResolutionResult,\n  RankedSentenceCandidate,\n} from \"./anchor-types.js\";\nexport {\n  EVIDENCE_SELECTION_JSON_SHAPE,\n  EVIDENCE_SELECTION_PROMPT_FRAGMENT,\n  formatEvidenceSelectionChoicePrompt,\n} from \"./prompt.js\";\nexport {\n  normalizeEvidenceDisplayText,\n  normalizeEvidenceText,\n  scoreEvidenceQuote,\n  type EvidenceQuoteMatchStrategy,\n  type EvidenceQuoteScore,\n} from \"./quote-score.js\";\nexport {\n  rankEvidenceQuote,\n  resolveEvidenceSelection,\n  resolveEvidenceSelectionList,\n} from \"./selection-resolver.js\";\nexport { normalizeText, splitTextIntoSentences } from \"./text.js\";\nexport type {\n  EvidenceSelection,\n  EvidenceSelectionCandidate,\n  EvidenceSelectionFailure,\n  EvidenceSelectionList,\n  EvidenceSelectionResolution,\n  EvidenceSelectionSentence,\n  EvidenceSentenceId,\n} from \"./types.js\";\n"],"mappings":"AAAA,SAAS,wBAAwB;AAMjC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAGK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,eAAe,8BAA8B;","names":[]}

package/dist/evidence-selection/prompt.d.ts

@@ -0,0 +1,18 @@
+declare const EVIDENCE_SELECTION_PROMPT_FRAGMENT: string;
+declare const EVIDENCE_SELECTION_JSON_SHAPE: readonly [{
+    readonly quote: "exact short source quote copied from the selected sentence";
+    readonly sentence_id: "sentence id from the source context, such as S1";
+}];
+declare function formatEvidenceSelectionChoicePrompt(input: {
+    readonly evidenceLabel: string;
+    readonly generatedEvidence: unknown;
+    readonly candidates: readonly {
+        readonly nextText: string;
+        readonly occurrenceId: string;
+        readonly prevText: string;
+        readonly score: number;
+        readonly text: string;
+    }[];
+}): string;
+
+export { EVIDENCE_SELECTION_JSON_SHAPE, EVIDENCE_SELECTION_PROMPT_FRAGMENT, formatEvidenceSelectionChoicePrompt };

package/dist/evidence-selection/prompt.js

@@ -0,0 +1,54 @@
+const EVIDENCE_SELECTION_PROMPT_FRAGMENT = [
+  "Evidence selection:",
+  '- Return evidence as [{"sentence_id":"S1","quote":"exact short source quote"}].',
+  "- evidence.quote is a locator for the source sentence, not a proof excerpt.",
+  "- Choose the shortest exact quote that still uniquely identifies the intended sentence.",
+  "- If the quote is too short, it may match multiple sentences; if it is too long, it may include unnecessary text or cross sentence boundaries.",
+  "- Do not use a whole sentence by default.",
+  "- evidence is an array. Use multiple items when the claim needs multiple source sentences.",
+  "- A source sentence means exactly one displayed source line labeled S1, S2, S3, etc.",
+  "- Each evidence item must point to exactly one source sentence.",
+  "- Each evidence item must quote one continuous span from exactly one labeled source line, for example only from S2.",
+  "- Never merge text from two labeled source lines into one evidence quote.",
+  "- sentence_id must be one of the sentence IDs shown in the source context.",
+  "- quote must be copied from the untagged original source sentence.",
+  "- If the source context contains XML-like tags, do not copy the tags into quote; copy only the visible text."
+].join("\n");
+const EVIDENCE_SELECTION_JSON_SHAPE = [
+  {
+    quote: "exact short source quote copied from the selected sentence",
+    sentence_id: "sentence id from the source context, such as S1"
+  }
+];
+function formatEvidenceSelectionChoicePrompt(input) {
+  return [
+    `Resolve only this evidence selection: ${input.evidenceLabel}.`,
+    "The generated evidence did not match its sentence_id and quote confidently.",
+    "Choose exactly one candidate occurrence ID from the list below.",
+    'Return JSON only: {"choice":"S1"}',
+    "",
+    "Generated evidence:",
+    JSON.stringify(input.generatedEvidence, null, 2),
+    "",
+    "Candidates:",
+    input.candidates.map(formatChoiceCandidate).join("\n")
+  ].join("\n");
+}
+function formatChoiceCandidate(input) {
+  return [
+    `${input.occurrenceId} score=${input.score.toFixed(3)}`,
+    `prev: ${formatChoiceText(input.prevText)}`,
+    `text: ${formatChoiceText(input.text)}`,
+    `next: ${formatChoiceText(input.nextText)}`
+  ].join("\n");
+}
+function formatChoiceText(text) {
+  const collapsed = text.replace(/\s+/gu, " ").trim();
+  return collapsed === "" ? "(none)" : collapsed;
+}
+export {
+  EVIDENCE_SELECTION_JSON_SHAPE,
+  EVIDENCE_SELECTION_PROMPT_FRAGMENT,
+  formatEvidenceSelectionChoicePrompt
+};
+//# sourceMappingURL=prompt.js.map

package/dist/evidence-selection/prompt.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/evidence-selection/prompt.ts"],"sourcesContent":["export const EVIDENCE_SELECTION_PROMPT_FRAGMENT = [\n  \"Evidence selection:\",\n  '- Return evidence as [{\"sentence_id\":\"S1\",\"quote\":\"exact short source quote\"}].',\n  \"- evidence.quote is a locator for the source sentence, not a proof excerpt.\",\n  \"- Choose the shortest exact quote that still uniquely identifies the intended sentence.\",\n  \"- If the quote is too short, it may match multiple sentences; if it is too long, it may include unnecessary text or cross sentence boundaries.\",\n  \"- Do not use a whole sentence by default.\",\n  \"- evidence is an array. Use multiple items when the claim needs multiple source sentences.\",\n  \"- A source sentence means exactly one displayed source line labeled S1, S2, S3, etc.\",\n  \"- Each evidence item must point to exactly one source sentence.\",\n  \"- Each evidence item must quote one continuous span from exactly one labeled source line, for example only from S2.\",\n  \"- Never merge text from two labeled source lines into one evidence quote.\",\n  \"- sentence_id must be one of the sentence IDs shown in the source context.\",\n  \"- quote must be copied from the untagged original source sentence.\",\n  \"- If the source context contains XML-like tags, do not copy the tags into quote; copy only the visible text.\",\n].join(\"\\n\");\n\nexport const EVIDENCE_SELECTION_JSON_SHAPE = [\n  {\n    quote: \"exact short source quote copied from the selected sentence\",\n    sentence_id: \"sentence id from the source context, such as S1\",\n  },\n] as const;\n\nexport function formatEvidenceSelectionChoicePrompt(input: {\n  readonly evidenceLabel: string;\n  readonly generatedEvidence: unknown;\n  readonly candidates: readonly {\n    readonly nextText: string;\n    readonly occurrenceId: string;\n    readonly prevText: string;\n    readonly score: number;\n    readonly text: string;\n  }[];\n}): string {\n  return [\n    `Resolve only this evidence selection: ${input.evidenceLabel}.`,\n    \"The generated evidence did not match its sentence_id and quote confidently.\",\n    \"Choose exactly one candidate occurrence ID from the list below.\",\n    'Return JSON only: {\"choice\":\"S1\"}',\n    \"\",\n    \"Generated evidence:\",\n    JSON.stringify(input.generatedEvidence, null, 2),\n    \"\",\n    \"Candidates:\",\n    input.candidates.map(formatChoiceCandidate).join(\"\\n\"),\n  ].join(\"\\n\");\n}\n\nfunction formatChoiceCandidate(input: {\n  readonly nextText: string;\n  readonly occurrenceId: string;\n  readonly prevText: string;\n  readonly score: number;\n  readonly text: string;\n}): string {\n  return [\n    `${input.occurrenceId} score=${input.score.toFixed(3)}`,\n    `prev: ${formatChoiceText(input.prevText)}`,\n    `text: ${formatChoiceText(input.text)}`,\n    `next: ${formatChoiceText(input.nextText)}`,\n  ].join(\"\\n\");\n}\n\nfunction formatChoiceText(text: string): string {\n  const collapsed = text.replace(/\\s+/gu, \" \").trim();\n\n  return collapsed === \"\" ? \"(none)\" : collapsed;\n}\n"],"mappings":"AAAO,MAAM,qCAAqC;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AAEJ,MAAM,gCAAgC;AAAA,EAC3C;AAAA,IACE,OAAO;AAAA,IACP,aAAa;AAAA,EACf;AACF;AAEO,SAAS,oCAAoC,OAUzC;AACT,SAAO;AAAA,IACL,yCAAyC,MAAM,aAAa;AAAA,IAC5D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,UAAU,MAAM,mBAAmB,MAAM,CAAC;AAAA,IAC/C;AAAA,IACA;AAAA,IACA,MAAM,WAAW,IAAI,qBAAqB,EAAE,KAAK,IAAI;AAAA,EACvD,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,sBAAsB,OAMpB;AACT,SAAO;AAAA,IACL,GAAG,MAAM,YAAY,UAAU,MAAM,MAAM,QAAQ,CAAC,CAAC;AAAA,IACrD,SAAS,iBAAiB,MAAM,QAAQ,CAAC;AAAA,IACzC,SAAS,iBAAiB,MAAM,IAAI,CAAC;AAAA,IACrC,SAAS,iBAAiB,MAAM,QAAQ,CAAC;AAAA,EAC3C,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,iBAAiB,MAAsB;AAC9C,QAAM,YAAY,KAAK,QAAQ,SAAS,GAAG,EAAE,KAAK;AAElD,SAAO,cAAc,KAAK,WAAW;AACvC;","names":[]}

package/dist/evidence-selection/quote-score.d.ts

@@ -0,0 +1,29 @@
+type EvidenceQuoteMatchStrategy = "empty" | "exact" | "normalized_exact" | "normalized_substring" | "fuzzy_window";
+interface EvidenceQuoteScore {
+    readonly exactRaw: boolean;
+    readonly exactNormalized: boolean;
+    readonly exactSubstring: boolean;
+    readonly matchEnd: number;
+    readonly matchStart: number;
+    readonly normalizedQuote: string;
+    readonly normalizedSentence: string;
+    readonly score: number;
+    readonly strategy: EvidenceQuoteMatchStrategy;
+}
+interface PreparedEvidenceQuote {
+    readonly normalizedQuote: string;
+    readonly quoteRaw: string;
+}
+declare function normalizeEvidenceDisplayText(text: string): string;
+declare function normalizeEvidenceText(text: string): string;
+declare function scoreEvidenceQuote(input: {
+    readonly quote: string;
+    readonly sentence: string;
+}): EvidenceQuoteScore;
+declare function prepareEvidenceQuote(quote: string): PreparedEvidenceQuote;
+declare function scorePreparedEvidenceQuote(input: {
+    readonly preparedQuote: PreparedEvidenceQuote;
+    readonly sentence: string;
+}): EvidenceQuoteScore;
+
+export { type EvidenceQuoteMatchStrategy, type EvidenceQuoteScore, type PreparedEvidenceQuote, normalizeEvidenceDisplayText, normalizeEvidenceText, prepareEvidenceQuote, scoreEvidenceQuote, scorePreparedEvidenceQuote };

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

@@ -0,0 +1,331 @@
+const EXACT_SCORE = 1;
+const NORMALIZED_EXACT_SCORE = 0.995;
+const SUBSTRING_BASE_SCORE = 0.95;
+const SUBSTRING_COVERAGE_BONUS = 0.04;
+const FUZZY_MIN_WINDOW_RATIO = 0.72;
+const FUZZY_MAX_WINDOW_RATIO = 2.25;
+const UNORDERED_PENALTY_THRESHOLD = 0.75;
+const LOW_ORDERED_PENALTY_THRESHOLD = 0.45;
+const CASE_FOLDING_OVERRIDES = /* @__PURE__ */ new Map([
+  ["\xDF", "ss"],
+  ["\u1E9E", "ss"],
+  ["\u03C2", "\u03C3"]
+]);
+function normalizeEvidenceDisplayText(text) {
+  return text.replace(new RegExp("\\p{Default_Ignorable_Code_Point}", "gu"), "").normalize("NFKC").replace(/\s+/gu, " ").trim();
+}
+function normalizeEvidenceText(text) {
+  const separated = replaceSeparatorsWithSpace(text);
+  const stripped = separated.replace(new RegExp("\\p{Default_Ignorable_Code_Point}", "gu"), "");
+  const compatible = stripped.normalize("NFKC");
+  const folded = caseFold(compatible);
+  const decomposed = folded.normalize("NFD").replace(new RegExp("\\p{M}", "gu"), "");
+  const reseparated = replaceSeparatorsWithSpace(decomposed);
+  return reseparated.replace(/ +/gu, " ").trim();
+}
+function scoreEvidenceQuote(input) {
+  return scorePreparedEvidenceQuote({
+    preparedQuote: prepareEvidenceQuote(input.quote),
+    sentence: input.sentence
+  });
+}
+function prepareEvidenceQuote(quote) {
+  const quoteRaw = stripMarkup(quote).trim();
+  return {
+    normalizedQuote: normalizeEvidenceText(quoteRaw),
+    quoteRaw
+  };
+}
+function scorePreparedEvidenceQuote(input) {
+  const { normalizedQuote, quoteRaw } = input.preparedQuote;
+  const sentenceRaw = stripMarkup(input.sentence).trim();
+  const normalizedSentence = normalizeEvidenceText(sentenceRaw);
+  if (normalizedQuote === "" || normalizedSentence === "") {
+    return createEmptyScore(normalizedQuote, normalizedSentence);
+  }
+  if (quoteRaw === sentenceRaw) {
+    return {
+      exactNormalized: true,
+      exactRaw: true,
+      exactSubstring: true,
+      matchEnd: normalizedSentence.length,
+      matchStart: 0,
+      normalizedQuote,
+      normalizedSentence,
+      score: EXACT_SCORE,
+      strategy: "exact"
+    };
+  }
+  if (normalizedQuote === normalizedSentence) {
+    return {
+      exactNormalized: true,
+      exactRaw: false,
+      exactSubstring: true,
+      matchEnd: normalizedSentence.length,
+      matchStart: 0,
+      normalizedQuote,
+      normalizedSentence,
+      score: NORMALIZED_EXACT_SCORE,
+      strategy: "normalized_exact"
+    };
+  }
+  const substringStart = normalizedSentence.indexOf(normalizedQuote);
+  if (substringStart !== -1) {
+    const coverage = normalizedQuote.length / Math.max(1, normalizedSentence.length);
+    return {
+      exactNormalized: false,
+      exactRaw: false,
+      exactSubstring: true,
+      matchEnd: substringStart + normalizedQuote.length,
+      matchStart: substringStart,
+      normalizedQuote,
+      normalizedSentence,
+      score: Math.min(
+        0.99,
+        SUBSTRING_BASE_SCORE + SUBSTRING_COVERAGE_BONUS * coverage
+      ),
+      strategy: "normalized_substring"
+    };
+  }
+  return scoreBestFuzzyWindow(normalizedQuote, normalizedSentence);
+}
+function scoreBestFuzzyWindow(normalizedQuote, normalizedSentence) {
+  const minWindow = Math.max(
+    1,
+    Math.floor(normalizedQuote.length * FUZZY_MIN_WINDOW_RATIO)
+  );
+  const maxWindow = Math.min(
+    normalizedSentence.length,
+    Math.max(
+      minWindow,
+      Math.ceil(normalizedQuote.length * FUZZY_MAX_WINDOW_RATIO)
+    )
+  );
+  let best = createEmptyScore(
+    normalizedQuote,
+    normalizedSentence
+  );
+  for (let windowSize = minWindow; windowSize <= maxWindow; windowSize += 1) {
+    for (let start = 0; start <= normalizedSentence.length - windowSize; start += 1) {
+      const window = normalizedSentence.slice(start, start + windowSize);
+      const score = scoreWindow(normalizedQuote, window);
+      if (score <= best.score) {
+        continue;
+      }
+      best = {
+        exactNormalized: false,
+        exactRaw: false,
+        exactSubstring: false,
+        matchEnd: start + windowSize,
+        matchStart: start,
+        normalizedQuote,
+        normalizedSentence,
+        score,
+        strategy: "fuzzy_window"
+      };
+    }
+  }
+  return best;
+}
+function scoreWindow(quote, window) {
+  const editScore = levenshteinSimilarity(quote, window);
+  const substringScore = longestCommonSubstringScore(quote, window);
+  const subsequenceScore = longestCommonSubsequenceScore(quote, window);
+  const orderedCoverageScore = orderedCoverage(quote, window);
+  const ngramScore = charNgramScore(quote, window);
+  const lengthScore = lengthSimilarity(quote, window);
+  const unorderedScore = unorderedCharOverlapScore(quote, window);
+  const orderedScore = Math.max(
+    editScore,
+    substringScore,
+    subsequenceScore,
+    orderedCoverageScore
+  );
+  let score = 0.2 * editScore + 0.18 * substringScore + 0.24 * subsequenceScore + 0.2 * orderedCoverageScore + 0.08 * ngramScore + 0.05 * lengthScore + 0.05 * unorderedScore;
+  if (unorderedScore >= UNORDERED_PENALTY_THRESHOLD && orderedScore < LOW_ORDERED_PENALTY_THRESHOLD) {
+    score *= 0.65;
+  }
+  return Math.max(0, Math.min(1, score));
+}
+function normalizeScalar(char) {
+  return CASE_FOLDING_OVERRIDES.get(char) ?? char.toLocaleLowerCase("und");
+}
+function caseFold(text) {
+  let folded = "";
+  for (const char of text) {
+    folded += normalizeScalar(char);
+  }
+  return folded;
+}
+function replaceSeparatorsWithSpace(text) {
+  let output = "";
+  for (const char of text) {
+    output += isPreservedSymbol(char) || !isSeparator(char) ? char : " ";
+  }
+  return output;
+}
+function isPreservedSymbol(char) {
+  return char === "+" || char === "#" || char === "&";
+}
+function isSeparator(char) {
+  return /\s/u.test(char) || new RegExp("\\p{Separator}", "u").test(char) || /[\p{Dash_Punctuation}\p{Connector_Punctuation}\p{Initial_Punctuation}\p{Final_Punctuation}\p{Open_Punctuation}\p{Close_Punctuation}\p{Other_Punctuation}]/u.test(
+    char
+  ) || /[\\/.。．｡、，,：:；;！!？?·・•|]/u.test(char);
+}
+function stripMarkup(text) {
+  return text.replace(/<\/?(?:mention|quote)\b[^>]*>/giu, "");
+}
+function createEmptyScore(normalizedQuote, normalizedSentence) {
+  return {
+    exactNormalized: false,
+    exactRaw: false,
+    exactSubstring: false,
+    matchEnd: -1,
+    matchStart: -1,
+    normalizedQuote,
+    normalizedSentence,
+    score: 0,
+    strategy: "empty"
+  };
+}
+function charNgramScore(left, right) {
+  const bigramScore = diceCoefficient(
+    charNgrams(left, 2),
+    charNgrams(right, 2)
+  );
+  const trigramScore = diceCoefficient(
+    charNgrams(left, 3),
+    charNgrams(right, 3)
+  );
+  return (bigramScore + trigramScore) / 2;
+}
+function charNgrams(text, size) {
+  if (text.length <= size) {
+    return text === "" ? /* @__PURE__ */ new Set() : /* @__PURE__ */ new Set([text]);
+  }
+  const result = /* @__PURE__ */ new Set();
+  for (let index = 0; index <= text.length - size; index += 1) {
+    result.add(text.slice(index, index + size));
+  }
+  return result;
+}
+function diceCoefficient(left, right) {
+  if (left.size === 0 || right.size === 0) {
+    return 0;
+  }
+  let overlap = 0;
+  for (const value of left) {
+    if (right.has(value)) {
+      overlap += 1;
+    }
+  }
+  return 2 * overlap / (left.size + right.size);
+}
+function lengthSimilarity(left, right) {
+  return 1 - Math.abs(left.length - right.length) / Math.max(left.length, right.length);
+}
+function levenshteinSimilarity(left, right) {
+  if (left === right) {
+    return 1;
+  }
+  if (left === "" || right === "") {
+    return 0;
+  }
+  let previous = Array.from({ length: right.length + 1 }, (_, index) => index);
+  let current = new Array(right.length + 1).fill(0);
+  const leftChars = [...left];
+  const rightChars = [...right];
+  for (const [leftIndex, leftChar] of leftChars.entries()) {
+    current[0] = leftIndex + 1;
+    for (const [rightIndex, rightChar] of rightChars.entries()) {
+      const insertCost = (current[rightIndex] ?? 0) + 1;
+      const deleteCost = (previous[rightIndex + 1] ?? 0) + 1;
+      const replaceCost = (previous[rightIndex] ?? 0) + (leftChar === rightChar ? 0 : 1);
+      current[rightIndex + 1] = Math.min(insertCost, deleteCost, replaceCost);
+    }
+    [previous, current] = [current, previous];
+  }
+  const distance = previous[rightChars.length] ?? Math.max(left.length, right.length);
+  return 1 - distance / Math.max(left.length, right.length);
+}
+function longestCommonSubstringScore(left, right) {
+  if (left === "" || right === "") {
+    return 0;
+  }
+  const leftChars = [...left];
+  const rightChars = [...right];
+  let previous = new Array(rightChars.length + 1).fill(0);
+  let current = new Array(rightChars.length + 1).fill(0);
+  let longest = 0;
+  for (let leftIndex = 1; leftIndex <= leftChars.length; leftIndex += 1) {
+    for (let rightIndex = 1; rightIndex <= rightChars.length; rightIndex += 1) {
+      current[rightIndex] = leftChars[leftIndex - 1] === rightChars[rightIndex - 1] ? (previous[rightIndex - 1] ?? 0) + 1 : 0;
+      longest = Math.max(longest, current[rightIndex] ?? 0);
+    }
+    [previous, current] = [current, previous];
+    current.fill(0);
+  }
+  return 2 * longest / (leftChars.length + rightChars.length);
+}
+function longestCommonSubsequenceScore(left, right) {
+  if (left === "" || right === "") {
+    return 0;
+  }
+  const leftChars = [...left];
+  const rightChars = [...right];
+  let previous = new Array(rightChars.length + 1).fill(0);
+  let current = new Array(rightChars.length + 1).fill(0);
+  for (let leftIndex = 1; leftIndex <= leftChars.length; leftIndex += 1) {
+    for (let rightIndex = 1; rightIndex <= rightChars.length; rightIndex += 1) {
+      current[rightIndex] = leftChars[leftIndex - 1] === rightChars[rightIndex - 1] ? (previous[rightIndex - 1] ?? 0) + 1 : Math.max(previous[rightIndex] ?? 0, current[rightIndex - 1] ?? 0);
+    }
+    [previous, current] = [current, previous];
+    current.fill(0);
+  }
+  const longest = previous[rightChars.length] ?? 0;
+  return 2 * longest / (leftChars.length + rightChars.length);
+}
+function orderedCoverage(left, right) {
+  if (left === "" || right === "") {
+    return 0;
+  }
+  const leftChars = [...left];
+  const rightChars = [...right];
+  let previous = new Array(rightChars.length + 1).fill(0);
+  let current = new Array(rightChars.length + 1).fill(0);
+  for (let leftIndex = 1; leftIndex <= leftChars.length; leftIndex += 1) {
+    for (let rightIndex = 1; rightIndex <= rightChars.length; rightIndex += 1) {
+      current[rightIndex] = leftChars[leftIndex - 1] === rightChars[rightIndex - 1] ? (previous[rightIndex - 1] ?? 0) + 1 : Math.max(previous[rightIndex] ?? 0, current[rightIndex - 1] ?? 0);
+    }
+    [previous, current] = [current, previous];
+    current.fill(0);
+  }
+  return (previous[rightChars.length] ?? 0) / leftChars.length;
+}
+function unorderedCharOverlapScore(left, right) {
+  const leftCounts = countChars(left);
+  const rightCounts = countChars(right);
+  let overlap = 0;
+  let total = 0;
+  for (const [char, leftCount] of leftCounts) {
+    const rightCount = rightCounts.get(char) ?? 0;
+    overlap += Math.min(leftCount, rightCount);
+    total += leftCount;
+  }
+  return total === 0 ? 0 : overlap / total;
+}
+function countChars(text) {
+  const counts = /* @__PURE__ */ new Map();
+  for (const char of text) {
+    counts.set(char, (counts.get(char) ?? 0) + 1);
+  }
+  return counts;
+}
+export {
+  normalizeEvidenceDisplayText,
+  normalizeEvidenceText,
+  prepareEvidenceQuote,
+  scoreEvidenceQuote,
+  scorePreparedEvidenceQuote
+};
+//# sourceMappingURL=quote-score.js.map