wiki-graph-core 0.3.1 → 0.4.0

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

@@ -1 +0,0 @@
-{"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

@@ -1,27 +0,0 @@
-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

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

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

@@ -1,8 +0,0 @@
-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

@@ -1,32 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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.js.map

@@ -1 +0,0 @@
-{"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.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/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/evidence-selection/selection-resolver.js

@@ -1,303 +0,0 @@
-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=selection-resolver.js.map

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

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/evidence-selection/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/evidence-selection/text.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/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":[]}