@claritylabs/cl-sdk 3.1.6 → 3.1.7

package/dist/index.js

@@ -11757,7 +11757,6 @@ Return JSON for the operational profile.`;
 var VISUAL_TABLE_REPAIR_MAX_TABLES = 4;
 var VISUAL_TABLE_REPAIR_MAX_ROWS = 28;
 var VISUAL_TABLE_REPAIR_MAX_CELLS = 140;
-var VISUAL_TABLE_REPAIR_KEYWORDS = /\b(coverage|limit|limits?|deductible|retroactive|premium|tax|fee|sublimit|sub-limit|aggregate|claim|occurrence|retention|declarations?)\b/i;
 function isSourceTreeHeaderRow(row) {
   return row.metadata?.isHeader === true || row.metadata?.isHeader === "true";
 }
@@ -11803,13 +11802,11 @@ function primaryHeaderColumnCount(rows) {
   if (header) return header.cells.length;
   return Math.max(0, ...rows.map(({ cells }) => cells.length));
 }
-function shouldRepairVisualTable(candidate) {
+function visualTableRepairScore(candidate) {
   const rows = candidate.rows;
-  if (rows.length < 3) return false;
-  const tableText = rows.map(({ row, cells }) => tableRowTextForPrompt(row, cells)).join(" ");
-  if (!VISUAL_TABLE_REPAIR_KEYWORDS.test(tableText)) return false;
+  if (rows.length < 3) return 0;
   const headerCount = primaryHeaderColumnCount(rows);
-  if (headerCount < 2) return false;
+  if (headerCount < 2) return 0;
   const firstHeaderIndex = rows.findIndex(({ row, cells }) => isSourceTreeHeaderRow(row) && cells.length > 1);
   const repeatedHeader = firstHeaderIndex >= 0 && rows.some(({ row }, index) => index > firstHeaderIndex && isSourceTreeHeaderRow(row));
   const shortContinuation = rows.some(
@@ -11821,7 +11818,7 @@ function shouldRepairVisualTable(candidate) {
   const danglingSlash = rows.some(
     ({ row, cells }) => !isSourceTreeHeaderRow(row) && /\/\s*$/.test(tableRowTextForPrompt(row, cells))
   );
-  return repeatedHeader || shortContinuation || genericDataLabels || danglingSlash;
+  return (repeatedHeader ? 4 : 0) + (danglingSlash ? 3 : 0) + (shortContinuation ? 3 : 0) + (genericDataLabels ? 2 : 0);
 }
 function visualTableCandidates(sourceTree) {
   const byParent = nodesByParent(sourceTree);
@@ -11829,9 +11826,9 @@ function visualTableCandidates(sourceTree) {
     table,
     page: table.pageStart,
     rows: tableRowsWithCells(table, byParent)
-  })).filter(shouldRepairVisualTable).sort(
-    (left, right) => left.page - right.page || left.table.order - right.table.order || left.table.id.localeCompare(right.table.id)
-  ).slice(0, VISUAL_TABLE_REPAIR_MAX_TABLES);
+  })).map((candidate) => ({ ...candidate, repairScore: visualTableRepairScore(candidate) })).filter((candidate) => candidate.repairScore > 0).sort(
+    (left, right) => right.repairScore - left.repairScore || left.page - right.page || left.table.order - right.table.order || left.table.id.localeCompare(right.table.id)
+  ).slice(0, VISUAL_TABLE_REPAIR_MAX_TABLES).map(({ repairScore: _repairScore, ...candidate }) => candidate);
 }
 function compactVisualTableCandidate(candidate) {
   let cellCount = 0;