28:null 29:["$","title",null,{"children":"PhagesDB — New Name Verification | WabushOnce | Observable"}] 2e:T8fb,downloadPhageNamesButton = { const wrap = html`

`; // Instruction text shown immediately const info = html`

1. Click the button to download the PhagesDB phage names:

`; // Download button placeholder const btn = html``; // Enable the button when names are ready (async () => { const names = await existingPhageNames; if (!names || names.length === 0) { btn.textContent = "⚠️ Phage names not loaded"; btn.style.cursor = "not-allowed"; btn.style.opacity = ".7"; btn.disabled = true; return; } btn.textContent = "⬇️ Download PhagesDB Phage Names"; btn.style.cursor = "pointer"; btn.style.opacity = "1"; btn.disabled = false; btn.onclick = () => { // Format the filename timestamp: DD-MMM-YYYY_HHMMAM/PM const now = new Date(); const pad = (n) => String(n).padStart(2, "0"); const months = [ "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" ]; let hours = now.getHours(); const minutes = pad(now.getMinutes()); const ampm = hours >= 12 ? "PM" : "AM"; hours = hours % 12 || 12; const hh = pad(hours); const timestamp = `${pad(now.getDate())}-${ months[now.getMonth()] }-${now.getFullYear()}_${hh}${minutes}${ampm}`; // Save as comma-delimited text (.txt) const textContent = names.map((n) => `"${n}"`).join(", "); const blob = new Blob([textContent], { type: "text/plain" }); const url = URL.createObjectURL(blob); const a = document.createElement("a"); a.href = url; a.download = `PhagesDB_phage_names_${timestamp}.txt`; document.body.appendChild(a); a.click(); a.remove(); URL.revokeObjectURL(url); }; })(); wrap.append(info, btn); return wrap; }2f:T1a9d,aiPromptPanel = { const wrap = html`

`; const step2 = html`

2. Upload the list to your AI of choice.

`; const step3 = html`

3. Copy, paste, and submit the prompt below into the AI:

`; const prompt = `I will enter proposed bacteriophage names one at a time. For each proposed name, perform ALL of the checks below. Do not approve a name until every check has been completed. 1. EXISTING PHAGE NAME CHECK Compare the proposed name against the uploaded list of existing phage names. Check for: - Exact duplicates, case-insensitively. - Very similar spellings. - Homophones and near-homophones. - Names that would likely be pronounced the same even though they are spelled differently. For example, "Phord" should be considered phonetically equivalent to "Ford" if they would normally be pronounced the same way. Report any potentially conflicting existing phage names. 2. CELEBRITY AND REAL-PERSON CHECK — IMPORTANT Do NOT rely only on whether you recognize the proposed name. For EVERY proposed name, actively search the web to determine whether: - The exact name belongs to a celebrity, musician, singer, actor, athlete, politician, historical figure, internet personality, or other notable person. - The proposed name is an alternate or creative spelling of a notable person's name. - The proposed name is a homophone or near-homophone of a notable person's full name. - Dividing the proposed phage name into words could produce a notable person's name. Before searching, generate reasonable phonetic interpretations and possible word divisions of the proposed name. For example: "PerryPhord" → "Perry Phord" → sounds like "Perry Ford" A web search revealing that Perry Ford was a pop singer means "PerryPhord" should be rejected even though the spelling is different. Search both the proposed spelling AND reasonable phonetic equivalents. If a plausible phonetic equivalent corresponds to a notable person's full name, flag the proposed phage name and explain the match. Do not reject a name merely because one component happens to be a common first name or surname. The concern is a recognizable person's full name or an obvious phonetic or spelling imitation of one. 3. POLITICAL, CONTROVERSIAL, OR VIOLENT REFERENCES Check for: - Political candidates, campaigns, slogans, or political movements. - Highly controversial people, organizations, or events. - Violent terminology, violent organizations, or explicit references to violence. For example, "Romney2012" would not be acceptable as a political campaign reference, while a word such as "Romney" should not automatically be rejected without considering its context. If a possible reference is ambiguous, flag it for review rather than assuming intent. 4. BASIC FORMATTING REQUIREMENTS Verify that the proposed name: - Is 4–14 characters long. - Starts with a capital letter. - Does not start with a lowercase letter or number. - Is not written entirely in capital letters. - Contains letters and numbers only. - Contains no spaces, punctuation, hyphens, underscores, or other symbols. - Does not begin with "The" or an equivalent construction. 5. PRONOUNCEABILITY The name should be reasonably pronounceable by an English speaker. Reject names that resemble arbitrary strings of letters and numbers, such as: "ALX65Tb" Creative spellings are acceptable if there is a reasonably obvious pronunciation. 6. BIOLOGY-RELATED TERMINOLOGY Reject names containing or obviously derived from biology or phage terminology such as: - phage - pham - cluster - virus - capsid - myco Also check deliberate misspellings and homophones, such as: - fage - vyrus Do not approve a name simply because a prohibited biological word has been disguised through alternate spelling. 7. DISEASE-LIKE NAMES Reject names that sound like diseases or medical conditions, particularly names constructed with endings such as: - -itis - -algia - -lepsy 8. SENTENCE-LIKE NAMES Reject names that read like a sentence or phrase compressed into a single word. For example: "IEatBeans" → reject A noun-style alternative such as "BeanEater" may be acceptable if it passes all other checks. 9. SYSTEMATIC NAMING Reject names that appear to be part of a systematic series rather than independently chosen names. Examples: "BubblesA" / "BubblesB" "Name1" / "Name2" 10. FINAL VERDICT For each proposed name, report: [Proposed name] — PASS / DOES NOT PASS / REVIEW Then briefly report: - Existing phage: No conflict found, or identify the conflicting name. - Celebrity/person search: No conflict found, or identify the person and explain the exact or phonetic match. - Other rules: Identify any other violations or concerns. - Verdict: PASS, DOES NOT PASS, or REVIEW. Use REVIEW when there is a plausible but uncertain conflict that requires human judgment. A name can receive PASS only after BOTH: 1. The uploaded existing-phage list has been checked for duplicates and homophones. 2. A web-based celebrity/person search, including reasonable phonetic equivalents, has been performed. Be conservative about obvious homophones of notable people's full names, but do not reject names based on remote or contrived similarities. After reading these instructions, confirm that you understand them and let me know when you are ready for me to enter the first proposed phage name.`; const promptBox = html`

${prompt}

`; const copyBtn = html``; copyBtn.onclick = async () => { try { await navigator.clipboard.writeText(prompt); copyBtn.textContent = "Copied!"; setTimeout(() => (copyBtn.textContent = "Copy prompt"), 1200); } catch { promptBox.select(); document.execCommand?.("copy"); copyBtn.textContent = "Copied!"; setTimeout(() => (copyBtn.textContent = "Copy prompt"), 1200); } }; const step4 = html`

4. After submitting the AI prompt, enter your proposed phage name into the AI chat for analysis.

`; wrap.append(step2, step3, promptBox, copyBtn, step4); return wrap; }30:T18cc,evaluatePhageNameAgainstRules = (name, existing) => { const rows = []; const n = (name || "").trim(); // Rule 1: Duplicate const dupFail = (existing || []).some( (e) => e.toLowerCase() === n.toLowerCase() ); rows.push({ num: 1, key: "dup", text: phageNamingRules.find((r) => r.key === "dup").text, status: dupFail ? "fail" : "pass", details: dupFail ? "Name already exists in the PhagesDB dataset." : "" }); // Rule 2: 4–14 characters const len = n.length; const lenFail = len < 4 || len > 14; rows.push({ num: 2, key: "lengthRange", text: phageNamingRules.find((r) => r.key === "lengthRange").text, status: lenFail ? "fail" : "pass", details: lenFail ? `Your name has ${len} characters.` : "" }); // Rule 3: Allowed chars const charsetFail = !/^[A-Za-z0-9]+$/.test(n); rows.push({ num: 3, key: "charset", text: phageNamingRules.find((r) => r.key === "charset").text, status: charsetFail ? "fail" : "pass", details: charsetFail ? "Contains disallowed characters or spaces." : "" }); // Rule 4: Starts with capital const capFail = !/^[A-Z]/.test(n); rows.push({ num: 4, key: "capital", text: phageNamingRules.find((r) => r.key === "capital").text, status: capFail ? "fail" : "pass", details: capFail ? "Does not start with a capital letter." : "" }); // Rule 5: No spaces const spaceFail = /\s/.test(n); rows.push({ num: 5, key: "spaces", text: phageNamingRules.find((r) => r.key === "spaces").text, status: spaceFail ? "fail" : "pass", details: spaceFail ? "Contains spaces." : "" }); // Rule 6: Pronounceable & not ALL CAPS { const allCaps = n === n.toUpperCase(); const p = isPronounceableName ? isPronounceableName(n) : { ok: true, issues: [] }; const problems = []; if (allCaps) problems.push("Name is all uppercase."); if (!p.ok) problems.push(...p.issues); rows.push({ num: 6, key: "pronounce", text: phageNamingRules.find((r) => r.key === "pronounce").text, status: allCaps || !p.ok ? "fail" : "pass", details: problems.join(" ") }); } // Rule 7: Biology words / homophones const bioFail = containsForbiddenBioHomophone ? containsForbiddenBioHomophone(n) : false; rows.push({ num: 7, key: "bio", text: phageNamingRules.find((r) => r.key === "bio").text, status: bioFail ? "fail" : "pass", details: bioFail ? "Contains or sounds like a restricted biological term." : "" }); // Rule 8: Disease-like const diseaseFail = /(itis|algia|lepsy)$/i.test(n); rows.push({ num: 8, key: "disease", text: phageNamingRules.find((r) => r.key === "disease").text, status: diseaseFail ? "fail" : "pass", details: diseaseFail ? "Ends with a disease-like suffix." : "" }); // Rule 9: Case consistency across uses { const exactExists = (existing || []).includes(n); const lowerMatch = (existing || []).some( (e) => e.toLowerCase() === n.toLowerCase() ); const caseMismatch = lowerMatch && !exactExists; rows.push({ num: 9, key: "casecons", text: phageNamingRules.find((r) => r.key === "casecons").text, status: caseMismatch ? "fail" : "pass", details: caseMismatch ? "Name differs only by capitalization from an existing phage name. Use the official case format exactly." : "" }); } // Rule 10: Cannot start with "The" const theFail = /^The/i.test(n); rows.push({ num: 10, key: "the", text: phageNamingRules.find((r) => r.key === "the").text, status: theFail ? "fail" : "pass", details: theFail ? "Begins with 'The'." : "" }); // Rule 11: Sentence-like names (IEatBeans) { const sent = checkSentenceLikeName ? checkSentenceLikeName(n) : { status: "pass", details: "" }; rows.push({ num: 11, key: "sentence", text: phageNamingRules.find((r) => r.key === "sentence").text, status: sent.status, details: sent.details }); } // Rule 12: Systematic / series-like names { const sys = checkSystematicSeries ? checkSystematicSeries(n, existing) : { status: "pass", details: "" }; rows.push({ num: 12, key: "systematic", text: phageNamingRules.find((r) => r.key === "systematic").text, status: sys.status, details: sys.details }); } // Rule 13 block: { const nearConflicts = findNearConflicts ? findNearConflicts(n, existing, SIMILARITY) : { metaphone: [], vowelStripped: [], leetOrNormalized: [], prefixConflicts: [] }; const strong = [ ...(nearConflicts.metaphone || []), ...(nearConflicts.vowelStripped || []) ]; const weak = [ ...(nearConflicts.leetOrNormalized || []), ...(nearConflicts.prefixConflicts || []) ]; // de-dup + status, annotate, etc. (same as your original) const seen = new Set(); const uniq = (arr) => arr.filter((x) => (seen.has(x) ? false : (seen.add(x), true))); const strongUniq = uniq(strong); const weakUniq = uniq(weak); const status = strongUniq.length ? "fail" : weakUniq.length ? "warn" : "pass"; const annotate = (label, list) => { if (!list || !list.length) return null; const shown = list.slice(0, SIMILARITY.maxExamples).map((hit) => { const why = explainSimilarity ? explainSimilarity(n, hit) : ""; return why ? `${hit} — ${why}` : hit; }); return `${label}: ${shown.join("; ")}`; }; const parts = []; const p1 = annotate( "Possible Phonetic Similarity to", nearConflicts.metaphone || [] ); const p2 = annotate( "Vowel-stripped similar", nearConflicts.vowelStripped || [] ); const p3 = annotate( "Normalized similar", nearConflicts.leetOrNormalized || [] ); const p4 = annotate( "Shortened form of", nearConflicts.prefixConflicts || [] ); [p1, p2, p3, p4].forEach((p) => p && parts.push(p)); rows.push({ num: 13, key: "homo", text: phageNamingRules.find((r) => r.key === "homo").text, status, details: parts.join(". ") }); } return rows; }31:T5eb,phageNamingRules = [ { num: 1, key: "dup", text: "Must be a new name. Duplicate names will be rejected." }, { num: 2, key: "lengthRange", text: "Name must be between 4 and 14 characters in length." }, { num: 3, key: "charset", text: "Numbers and letters only (no symbols)." }, { num: 4, key: "capital", text: "Must start with a capital letter (not a lowercase letter or number)." }, { num: 5, key: "spaces", text: "Don’t include spaces. CamelCaps is okay." }, { num: 6, key: "pronounce", text: "Avoid ALL CAPS and/or no pronounceable parts." }, { num: 7, key: "bio", text: "Avoid biology words (phage, pham, cluster, virus, capsid, myco) or their homophones (e.g., fage, vyrus)." }, { num: 8, key: "disease", text: "Avoid disease-sounding names (e.g., -itis, -algia, -lepsy)." }, { num: 9, key: "casecons", text: "Case-sensitive consistency across uses (RedRock ≠ redrock ≠ Redrock)." }, { num: 10, key: "the", text: "Phage names cannot begin with “The” (or equivalents)." }, { num: 11, key: "sentence", text: "Avoid things that are squeezing sentences into phage names (e.g., IEatBeans)." }, { num: 12, key: "systematic", text: "Avoid names that appear systematic (e.g., BubblesA/BubblesB or Name1/Name2)." }, { num: 13, key: "homo", text: "No homophones or very-similar names (no leetspeak or doubled-letter cheating)." } ]32:T486,(button.onclick = async () => { const raw = viewof phageName.value || ""; const name = raw.trim(); const existing = await existingPhageNames; if (!name) { output.textContent = "Enter a name."; output.style.color = "#b00020"; rulesBox.innerHTML = ""; return; } const checklist = evaluatePhageNameAgainstRules(name, existing); // High-level summary (valid/invalid) const hasFail = checklist.some((r) => r.status === "fail"); const passes = checklist.filter((r) => r.status === "pass").length; const fails = checklist.filter((r) => r.status === "fail").length; const manuals = checklist.filter((r) => r.status === "manual").length; const header = `Checking: "${name}"\n${passes} passed, ${fails} failed, ${manuals} manual`; if (!hasFail) { output.textContent = `${header}\n✅ This name passes all automatic checks.`; output.style.color = "#136f2a"; } else { output.textContent = `${header}\n❌ See failed rules below.`; output.style.color = "#b00020"; } // Detailed rule-by-rule list with ✅ / ❌ / ⚪ rulesBox.innerHTML = ""; rulesBox.appendChild(renderRuleChecklist(checklist)); })33:T442,function checkSentenceLikeName(name) { const n = (name || "").trim(); if (!n) return { status: "pass", details: "" }; const tokens = splitCamel(n); if (tokens.length < 2) return { status: "pass", details: "" }; const first = tokens[0]; const second = tokens[1]; // Special cases like IAmX, ImX if ( first === "I" && (second === "Am" || second === "Im" || second === "Iam") ) { return { status: "fail", details: `Looks like a sentence (“${first}${second}…”). Prefer a noun-like form (e.g., “BeanEater”).` }; } // Pronoun + verb-like if (pronouns.has(first) && looksLikeVerb(second)) { if (tokens.length >= 3) { return { status: "fail", details: `Looks like a sentence (“${tokens.join( "" )}”). Prefer a noun-like form (e.g., “BeanEater” instead of “IEatBeans”).` }; } return { status: "warn", details: `Starts like a sentence (“${first}${second}”). Consider a noun-like alternative.` }; } return { status: "pass", details: "" }; }34:T961,checkSystematicSeries = (name, existing) => { const n = (name || "").trim(); const list = existing || []; if (!n) return { status: "pass", details: "" }; // helper: escape a string for use in a RegExp const esc = (s) => s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"); // Pattern for series-like suffixes: a single capital letter OR 1–2 digits const seriesSuffix = /^(.*?)([A-Z]|\d{1,2})$/; const m = n.match(seriesSuffix); // Branch A: candidate HAS a series-like suffix (e.g., Quartzite22, BubblesA) if (m) { const [, rawRoot, token] = m; const root = rawRoot; if (root.length < 3) return { status: "pass", details: "" }; // ignore tiny roots // Does the bare root already exist? (e.g., "Quartzite" is already in DB) const rootExists = list.includes(root); // Collect siblings with SAME root but DIFFERENT token const siblings = []; for (const ex of list) { const mm = ex.match(seriesSuffix); if (!mm) continue; const [, exRoot, exTok] = mm; if (exRoot === root && exTok !== token) siblings.push(ex); } // If any sibling exists OR the bare root exists, this appears systematic → FAIL if (rootExists || siblings.length >= 1) { const parts = []; if (rootExists) parts.push(`shares root “${root}” (bare root exists)`); if (siblings.length) parts.push( `siblings: ${siblings.slice(0, 5).join(", ")}${ siblings.length > 5 ? "…" : "" }` ); return { status: "fail", details: `Appears systematic — ${parts.join("; ")}.` }; } // Otherwise, this is the FIRST entry with that root+suffix → PASS // (so "Quartzite22" can be the first, but will block "Quartzite23" or "Quartzite" later) return { status: "pass", details: "" }; } // Branch B: candidate DOES NOT have a series-like suffix (e.g., Quartzite) // If there are existing names like "QuartziteA" or "Quartzite22", then adding the bare root now implies a series → FAIL const rootHasSeriesInDB = list.some((ex) => new RegExp(`^${esc(n)}([A-Z]|\\d{1,2})$`).test(ex) ); if (rootHasSeriesInDB) { return { status: "fail", details: `Appears systematic — names with this root already exist (e.g., ${n}A / ${n}1).` }; } // Otherwise, no series pattern detected return { status: "pass", details: "" }; }35:T547,function doubleMetaphone(s) { s = (s || "").toUpperCase(); const isVowel = (c) => "AEIOUY".includes(c); let primary = "", secondary = ""; for (let i = 0; i < s.length; i++) { const c = s[i]; if (isVowel(c)) { if (i === 0) { primary += c; secondary += c; } continue; } switch (c) { case "P": case "F": case "V": primary += "F"; secondary += "F"; break; case "G": case "K": case "C": primary += "K"; secondary += "K"; break; case "S": case "Z": primary += "S"; secondary += "S"; break; case "T": case "D": primary += "T"; secondary += "T"; break; case "M": primary += "M"; secondary += "N"; break; case "N": primary += "N"; secondary += "M"; break; case "J": case "Y": primary += "Y"; secondary += "Y"; break; case "Q": primary += "K"; secondary += "K"; break; case "X": primary += "KS"; secondary += "KS"; break; case "H": case "W": break; default: primary += c; secondary += c; break; } } return [primary, secondary]; }36:T483,function findNearConflicts(name, existing) { const targetP = phoneticNormalizer(name); // e.g., "zuki" const targetL = basicNormalizeLeet(name); const metaphone = []; // now: exact normalized matches only const vowelStripped = []; // DISABLED (too many false positives) const leetOrNormalized = []; // only exact leet/normalized equality const prefixConflicts = []; // DISABLED (was noisy for this use case) const seen = new Set(); const add = (arr, v) => { if (!seen.has(v)) { arr.push(v); seen.add(v); } }; for (const nm of existing || []) { if (!nm || typeof nm !== "string") continue; if (nm === name) continue; // handled by Rule 1 const p = phoneticNormalizer(nm); const l = basicNormalizeLeet(nm); // strict phonetic: EXACT match only if (p === targetP) { add(metaphone, nm); continue; } // strict leet/normalized: EXACT match only if (l === targetL) { add(leetOrNormalized, nm); continue; } // (no vowelStripped or prefix channels in this strict mode) } return { metaphone, vowelStripped, leetOrNormalized, prefixConflicts }; }37:T4c3,function renderRuleChecklist(rows) { const icon = (status) => status === "pass" ? "✅" : status === "fail" ? "❌" : "⚪"; const color = (status) => status === "pass" ? "#136f2a" : status === "fail" ? "#b00020" : "#6b7280"; const wrap = document.createElement("div"); wrap.style.font = "14px/1.4 system-ui, -apple-system, Segoe UI, Roboto, sans-serif"; wrap.style.background = "#fff"; wrap.style.border = "1px solid #eee"; wrap.style.borderRadius = "8px"; wrap.style.padding = "12px"; rows.forEach((r) => { const line = document.createElement("div"); line.style.display = "flex"; line.style.gap = "8px"; line.style.margin = "6px 0"; const badge = document.createElement("span"); badge.textContent = icon(r.status); badge.style.color = color(r.status); const text = document.createElement("span"); text.textContent = `${r.num}. ${r.text}`; line.appendChild(badge); line.appendChild(text); if (r.details) { const d = document.createElement("div"); d.style.marginLeft = "28px"; d.style.color = "#6b7280"; d.textContent = r.details; line.appendChild(d); } wrap.appendChild(line); }); return wrap; }38:Tdb7,function validatePhageName(name, existing) { const issues = []; const warnings = []; // Basic presence if (!name) return { issues: ["Enter a name."], warnings }; // Length 4..14 if (name.length < 4 || name.length > 14) { issues.push("Name must be between 4 and 14 characters."); } // Letters & digits only if (!/^[A-Za-z0-9]+$/.test(name)) { issues.push( "Name must contain only letters and numbers (no spaces or special characters)." ); } // Starts with capital letter if (!/^[A-Z]/.test(name)) { issues.push("Name must start with a capital letter."); } // Must not start with 'The' if (/^The/.test(name)) { issues.push("Name must not start with 'The'."); } // Avoid ALL CAPS if (name === name.toUpperCase()) { issues.push("Avoid ALL CAPS names."); } // Systematic/robotic heuristics (warnings) const digitRatio = (name.match(/[0-9]/g) || []).length / name.length; if (digitRatio > 0.4) warnings.push("High digit ratio — consider fewer numbers."); if (/^[A-Z]{2,}\d{1,}$/u.test(name)) warnings.push( "Looks systematic (letters+digits block). Prefer pet-like names." ); if (/[^aeiouAEIOU]{4,}/.test(name)) warnings.push("Long consonant cluster — might be hard to pronounce."); // Pronounceability if (!isPronounceableName(name)) warnings.push("Name may be hard to pronounce."); // Forbidden bio terms / homophones if (containsForbiddenBioHomophone(name)) { issues.push( "Name contains or sounds like a forbidden biological term (e.g., phage, virus, capsid, etc.)." ); } // Nicolas Cage rule if ( /nicolas\s*cage/i.test(name) || /^cage$/i.test(name) || /^nicolas$/i.test(name) || /nick.?cage/i.test(name) ) { issues.push("Per rules, do not name your phage after Nicolas Cage."); } // Duplicate (case-insensitive) if (existing.some((n) => n.toLowerCase() === name.toLowerCase())) { issues.push("Name already exists (duplicate)."); } // Similarity to existing names (homophones / cheating / shortened forms) const near = findNearConflicts(name, existing); if (near.prefixConflicts.length) { issues.push( `Appears to be a shortened form of existing name(s): ${near.prefixConflicts .slice(0, 5) .join(", ")}${near.prefixConflicts.length > 5 ? "…" : ""}` ); } if (near.leetOrNormalized.length) { issues.push( `Too similar after normalization (anti-‘leet’/double-letters): ${near.leetOrNormalized .slice(0, 5) .join(", ")}${near.leetOrNormalized.length > 5 ? "…" : ""}` ); } if (near.metaphone.length) { issues.push( `Phonetic (homophone) conflict with: ${near.metaphone .slice(0, 5) .join(", ")}${near.metaphone.length > 5 ? "…" : ""}` ); } if (near.exactCaseDiff.length) { warnings.push( `Case-only variant exists: ${near.exactCaseDiff.slice(0, 5).join(", ")}${ near.exactCaseDiff.length > 5 ? "…" : "" }` ); } if (near.levenshtein.length) { warnings.push( `Very similar (edit distance ≤2) to: ${near.levenshtein .slice(0, 5) .join(", ")}${near.levenshtein.length > 5 ? "…" : ""}` ); } // Optional note on mythology/religion (not blocking) if (/^(anubis|zeus|athena|odin|amun)$/i.test(name)) { warnings.push( "Mythology/religion reference — usually fine, but be aware of connotation." ); } return { issues, warnings }; }39:T594,function phoneticNormalizer(raw) { let s = (raw || "") .toLowerCase() .normalize("NFKD") .replace(/[^a-z0-9]/g, ""); // orthography → phonetics s = s .replace(/ph/g, "f") .replace(/ck/g, "k") .replace(/qu/g, "k") .replace(/x/g, "ks"); // vowel families (global) s = s .replace(/oo|ou/g, "u") // coo/cou → cu .replace(/ee|ea|ie|ei|iy|yy/g, "i"); // leek/lea/lie/lei/liy/lyy → i // context-sensitive consonants s = s.replace(/c(?=[eiy])/g, "s").replace(/c/g, "k"); // c→s before e/i/y; else k s = s.replace(/g(?=[eiy])/g, "j"); // g→j before e/i/y // *** NEW: treat 'y' as a vowel when between consonants → 'i' // e.g., aDoLynn → adolinn → aligns with '...lin' s = s.replace( /([bcdfghjklmnpqrstvwxyz])y(?=[bcdfghjklmnpqrstvwxyz])/g, "$1i" ); // *** NEW: collapse common 'lyn' endings to 'lin' (lynn, lynne → lin) s = s.replace(/(lynne|lynn|lyn)$/g, "lin"); // *** NEW: drop terminal silent 'e' after a consonant (e.g., 'line' → 'lin') s = s.replace(/([bcdfghjklmnpqrstvwxyz])e$/g, "$1"); // restore critical end-of-word collapses s = s.replace(/(key|kee|kie|ki|ky)$/g, "ki"); // ...key/kee/kie/ki/ky → ki s = s.replace(/(ey|y)$/g, "i"); // ...ey / ...y → i // s/z collapse and double-letter collapse s = s.replace(/[sz]/g, "z"); // s ↔ z s = s.replace(/(.)\1+/g, "$1"); // aa → a, zzz → z return s; }3a:[] 2c:{"id":"73c71e94a64a4469","slug":"verify-phagesdb-name","title":"PhagesDB — New Name Verification","thumbnail":"cce89f9fe96561e023bc3fcda5d0fb6ecca4d82b0fc90ebb95d3614b36e3b353","access_level":"public","create_time":"$D2025-10-03T19:16:30.262Z","update_time":"$D2026-09-17T14:59:53.352Z","view_time":null,"first_public_time":"$D2025-10-10T19:10:43.806Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"d1dfc5f860fb8699","login":"phage","name":"WabushOnce","avatar_url":"https://avatars-next.observableusercontent.com/9303f26b98fd8f7e04b66a6ac3218bfd2ca7e146f15ba24ca32ffac15f802763","tier":"starter_2024"},"version":756,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"3035ce62f81ebcd9","login":"phage","name":"WabushOnce","avatar_url":"https://avatars-next.observableusercontent.com/9303f26b98fd8f7e04b66a6ac3218bfd2ca7e146f15ba24ca32ffac15f802763","tier":null}],"members":[{"type":"individual","id":"3035ce62f81ebcd9","login":"phage","name":"WabushOnce","avatar_url":"https://avatars-next.observableusercontent.com/9303f26b98fd8f7e04b66a6ac3218bfd2ca7e146f15ba24ca32ffac15f802763","tier":null,"role":"editor"},{"type":"team","id":"d1dfc5f860fb8699","login":"phage","name":"WabushOnce","avatar_url":"https://avatars-next.observableusercontent.com/9303f26b98fd8f7e04b66a6ac3218bfd2ca7e146f15ba24ca32ffac15f802763","tier":"starter_2024","role":"editor"}],"comments":[],"custom_thumbnail":true,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"PhagesDB — New Name Verification","cells":[{"id":360,"value":"# PhagesDB — New Name Verification\nBefore submitting a new phage name to your professor for verification, ensure it follows the \nPhagesDB Naming Rules using either the AI or Non-AI script below.\n\n---\n## AI Name Check\nUse AI to check your proposed phage name against the list of existing PhagesDB names.\n\n- Note: If your AI tool can’t upload the full PhagesDB list (common with free versions), use the Non-AI tool in the next section.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":623,"value":"$2e","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":684,"value":"$2f","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":718,"value":"---\n## Non-AI Name Check\nEnter your phage name in the box below. Then also perform the following manual checks:\n- Verify that a celebrity's name or a person’s full name are not used \n
Example: “NicolasCage” or “GrahamHatfull” ❌ \n Acceptable alternatives: “Graham”, “Hatfull”, or “Gratfull”.\n- Also stay away from political, controversial, or violent names.\n
For example, “Romney2012” was rejected, but “Romney” was okay.\n

\nEnter your proposed phage name below:\n","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":89,"value":"viewof phageName = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":91,"value":"button = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":109,"value":"## Results","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":93,"value":"outputWrap = {\n const pre = html`

`;\n\n const wrap = html`

`;\n wrap.append(pre);\n // keep a reference so the next cell can expose the same `output` API you already use\n wrap._pre = pre;\n return wrap;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":232,"value":"rulesBox = html`

`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":48,"value":"---\n# Code","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":389,"value":"output = outputWrap._pre","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":7,"value":"//Get the most recent list of phage names from PhagesDB\nexistingPhageNames = (async () => {\n const url = \"https://phagesdb.org/data/?set=all&type=simple\";\n try {\n const res = await fetch(url);\n if (!res.ok) throw new Error(`HTTP ${res.status}`);\n const text = await res.text();\n const lines = text.trim().split(\"\\n\").slice(1); // skip header\n return lines.map((line) => line.split(\"\\t\")[0]);\n } catch (err) {\n console.warn(\"Failed to fetch PhagesDB list:\", err);\n return []; // allow local rule checks to run\n }\n})()","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":219,"value":"$30","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":216,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":102,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":43,"value":"html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":283,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":261,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":306,"value":"consonantKey = (s) => {\n const norm =\n typeof normalizeWord === \"function\"\n ? normalizeWord(s)\n : s\n .toLowerCase()\n .normalize(\"NFKD\")\n .replace(/\\p{Diacritic}/gu, \"\")\n .replace(/ph/g, \"f\")\n .replace(/v/g, \"f\")\n .replace(/y/g, \"i\")\n .replace(/[35]/g, \"s\")\n .replace(/[1|!]/g, \"i\")\n .replace(/0/g, \"o\")\n .replace(/(.)\\1+/g, \"$1\");\n const skel = norm.replace(/[aeiouhw]/g, \"\");\n return skel.replace(/(.)\\1+/g, \"$1\");\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":321,"value":"consonantBigrams = (key) => {\n const out = [];\n for (let i = 0; i < key.length - 1; i++) out.push(key.slice(i, i + 2));\n return out;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":128,"value":"function containsForbiddenBioHomophone(name) {\n const normName = normalizeWord(name);\n\n // Direct substring\n for (const root of forbiddenRoots) {\n if (normName.includes(root)) return true;\n }\n\n // Off-by-one\n for (const root of forbiddenRoots) {\n if (levenshtein(normName, root) <= 1) return true;\n }\n\n // Phonetic (gated by length and edit distance)\n const [nP, nS] = doubleMetaphone(name);\n for (const raw of forbiddenRootsRaw) {\n const [rP, rS] = doubleMetaphone(raw);\n const metaphoneHit =\n (nP && (nP === rP || nP === rS)) || (nS && (nS === rP || nS === rS));\n if (!metaphoneHit) continue;\n\n const normRoot = normalizeWord(raw);\n const lenClose = Math.abs(normName.length - normRoot.length) <= 2;\n const editClose = levenshtein(normName, normRoot) <= 2;\n if (lenClose && editClose) return true;\n }\n\n return false;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":98,"value":"function containsForbiddenBioWordsOrHomophones(name) {\n const forbiddenRoots = [\n \"phage\",\n \"pham\",\n \"cluster\",\n \"virus\",\n \"capsid\",\n \"myco\",\n \"fage\",\n \"vyrus\"\n ];\n\n const lower = name.toLowerCase();\n\n // Direct substring check\n for (const root of forbiddenRoots) {\n if (lower.includes(root)) {\n return true;\n }\n }\n\n // Phonetic check (Double Metaphone)\n const nameCodes = doubleMetaphone(name);\n\n for (const root of forbiddenRoots) {\n const rootCodes = doubleMetaphone(root);\n if (\n nameCodes[0] === rootCodes[0] ||\n nameCodes[0] === rootCodes[1] ||\n nameCodes[1] === rootCodes[0] ||\n nameCodes[1] === rootCodes[1]\n ) {\n return true;\n }\n }\n\n return false;\n}\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":112,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":370,"value":"function explainSimilarity(a, b) {\n const A = phoneticNormalizer(a);\n const B = phoneticNormalizer(b);\n if (A === B) return `phonetic match (“${A}”)`;\n // With the strict match above, we shouldn't reach here anymore.\n return `not similar after normalization`;\n}\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":533,"value":"SIMILARITY = ({\n maxEditDistance: 1, // strict \"very-similar\" after normalization\n showWhy: true, // include human-readable reasons\n maxExamples: 12 // limit similar-name list length\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":199,"value":"$36","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":342,"value":"firstVowel = (s) => {\n const norm =\n typeof normalizeWord === \"function\"\n ? normalizeWord(s)\n : s\n .toLowerCase()\n .normalize(\"NFKD\")\n .replace(/\\p{Diacritic}/gu, \"\")\n .replace(/ph/g, \"f\")\n .replace(/v/g, \"f\")\n .replace(/y/g, \"i\")\n .replace(/[35]/g, \"s\")\n .replace(/[1|!]/g, \"i\")\n .replace(/0/g, \"o\")\n .replace(/(.)\\1+/g, \"$1\");\n const m = norm.match(/[aeiou]/);\n return m ? m[0] : \"\";\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":125,"value":"forbiddenRoots = forbiddenRootsRaw.map(normalizeWord)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":119,"value":"forbiddenRootsRaw = [\n \"phage\",\n \"pham\",\n \"cluster\",\n \"virus\",\n \"capsid\",\n \"myco\",\n \"fage\",\n \"vyrus\"\n]","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":57,"value":"isPronounceableName = name => {\n const n = (name || \"\").trim();\n\n const issues = [];\n\n // Treat Y as a vowel for pronounceability\n const hasVowel = /[aeiouy]/i.test(n);\n if (!hasVowel) issues.push(\"No vowels (A, E, I, O, U, or Y).\");\n\n // Long consonant cluster (4+) is hard to say\n if (/[bcdfghjklmnpqrstvwxz]{4,}/i.test(n)) {\n issues.push(\"Contains 4+ consonants in a row.\");\n }\n\n // Too few vowels for length (heuristic)\n const vowelsCount = (n.match(/[aeiouy]/gi) || []).length;\n if (n.length >= 7 && vowelsCount < 2) {\n issues.push(\"Too few vowels for its length.\");\n }\n\n // Digit ratio\n const digits = (n.match(/\\d/g) || []).length;\n if (digits / Math.max(1, n.length) > 0.4) {\n issues.push(\"Too many digits (over 40%).\");\n }\n\n // Rare: 'q' not followed by 'u' is often unpronounceable in English contexts\n if (/q(?!u)/i.test(n)) {\n issues.push(\"Contains 'q' not followed by 'u'.\");\n }\n\n return { ok: issues.length === 0, issues };\n}\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":324,"value":"jaccard = (arrA, arrB) => {\n const A = new Set(arrA),\n B = new Set(arrB);\n const inter = [...A].filter((x) => B.has(x)).length;\n const uni = new Set([...A, ...B]).size || 1;\n return inter / uni;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":366,"value":"lastSyllable = s => {\n const m = s.toLowerCase().match(/[aeiou]+[^aeiou]*$/);\n return m ? m[0] : s.slice(Math.max(0, s.length - 4));\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":117,"value":"function levenshtein(a, b) {\n const an = a.length,\n bn = b.length;\n if (an === 0) return bn;\n if (bn === 0) return an;\n const matrix = Array.from({ length: bn + 1 }, () => Array(an + 1).fill(0));\n for (let i = 0; i <= bn; i++) matrix[i][0] = i;\n for (let j = 0; j <= an; j++) matrix[0][j] = j;\n for (let i = 1; i <= bn; i++) {\n for (let j = 1; j <= an; j++) {\n matrix[i][j] =\n b[i - 1] === a[j - 1]\n ? matrix[i - 1][j - 1]\n : Math.min(\n matrix[i - 1][j - 1] + 1,\n matrix[i][j - 1] + 1,\n matrix[i - 1][j] + 1\n );\n }\n }\n return matrix[bn][an];\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":364,"value":"longestCommonPrefixLen = (a, b) => {\n let i = 0;\n while (i < a.length && i < b.length && a[i] === b[i]) i++;\n return i;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":281,"value":"function looksLikeVerb(token) {\n if (verbRoots.has(token)) return true; // exact verb\n\n // Verb-ish endings: Eating, Tested, Loves, etc.\n if (/^(?:[A-Z][a-z]+)(ing|ed|es|s)$/i.test(token)) {\n const stem = token.replace(/(ing|ed|es|s)$/i, \"\");\n if (stem.length >= 2) return true;\n }\n return false;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":123,"value":"function normalizeWord(word) {\n let w = word.toLowerCase();\n w = w.normalize(\"NFKD\").replace(/\\p{Diacritic}/gu, \"\");\n w = w.replace(/ph/g, \"f\");\n w = w.replace(/v/g, \"f\");\n w = w.replace(/y/g, \"i\");\n w = w.replace(/[35]/g, \"s\").replace(/[1|!]/g, \"i\").replace(/0/g, \"o\");\n w = w.replace(/(.)\\1+/g, \"$1\");\n return w;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":222,"value":"$37","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":279,"value":"pronouns = new Set([\"I\", \"We\", \"They\", \"You\", \"He\", \"She\", \"It\"])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":263,"value":"function splitCamel(s) {\n return (s.match(/[A-Z][a-z0-9]*/g) || []);\n}\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":368,"value":"suffixPhoneticSimilar = (a, b) => {\n const sa = lastSyllable(a), sb = lastSyllable(b);\n const na = (typeof normalizeWord === \"function\") ? normalizeWord(sa) : sa.toLowerCase();\n const nb = (typeof normalizeWord === \"function\") ? normalizeWord(sb) : sb.toLowerCase();\n const [ap, as] = doubleMetaphone(na);\n const [bp, bs] = doubleMetaphone(nb);\n const metaClose = (ap && (ap===bp || ap===bs)) || (as && (as===bp || as===bs));\n const editClose = levenshtein(na, nb) <= 1;\n return metaClose || editClose;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":36,"value":"$38","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":286,"value":"verbRoots = new Set([\n \"Eat\",\n \"Love\",\n \"Like\",\n \"Hate\",\n \"Chase\",\n \"Build\",\n \"Make\",\n \"Fix\",\n \"Find\",\n \"Seek\",\n \"Catch\",\n \"Study\",\n \"Test\",\n \"Try\",\n \"Code\",\n \"Write\",\n \"Read\",\n \"Mix\",\n \"Spin\",\n \"Wash\",\n \"Grow\",\n \"Measure\",\n \"Purify\",\n \"Filter\",\n \"Plot\",\n \"Analyze\",\n \"Clean\",\n \"Name\"\n])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":336,"value":"vowelSeq = (s) => {\n const norm =\n typeof normalizeWord === \"function\"\n ? normalizeWord(s)\n : s\n .toLowerCase()\n .normalize(\"NFKD\")\n .replace(/\\p{Diacritic}/gu, \"\")\n .replace(/ph/g, \"f\")\n .replace(/v/g, \"f\")\n .replace(/y/g, \"i\")\n .replace(/[35]/g, \"s\")\n .replace(/[1|!]/g, \"i\")\n .replace(/0/g, \"o\")\n .replace(/(.)\\1+/g, \"$1\");\n // keep only vowels; collapse any doubles\n return norm.replace(/[^aeiou]/g, \"\").replace(/(.)\\1+/g, \"$1\");\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":491,"value":"$39","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":521,"value":"function stripVowels(s) {\n return (s || \"\").replace(/[aeiouy]/g, \"\");\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":523,"value":"function basicNormalizeLeet(raw) {\n const map = {\n \"0\": \"o\",\n \"1\": \"l\",\n \"3\": \"e\",\n \"4\": \"a\",\n \"5\": \"s\",\n \"7\": \"t\",\n \"8\": \"b\",\n \"9\": \"g\"\n };\n return (raw || \"\")\n .toLowerCase()\n .replace(/[01345789]/g, (ch) => map[ch])\n .replace(/[^a-z0-9]/g, \"\")\n .replace(/(.)\\1+/g, \"$1\");\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":509,"value":"function editDistance(a, b) {\n const m = a.length,\n n = b.length;\n if (m === 0) return n;\n if (n === 0) return m;\n const dp = Array.from({ length: m + 1 }, () => new Array(n + 1).fill(0));\n for (let i = 0; i <= m; i++) dp[i][0] = i;\n for (let j = 0; j <= n; j++) dp[0][j] = j;\n for (let i = 1; i <= m; i++) {\n for (let j = 1; j <= n; j++) {\n const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n dp[i][j] = Math.min(\n dp[i - 1][j] + 1,\n dp[i][j - 1] + 1,\n dp[i - 1][j - 1] + cost\n );\n }\n }\n return dp[m][n];\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":495,"value":"// --- 2) Tiny-distance similarity on the normalized codes ---\nfunction lev1or2(a, b, maxDist = 1) {\n // fast path\n if (a === b) return true;\n if (Math.abs(a.length - b.length) > maxDist) return false;\n\n // basic O(n*m) but strings are short; maxDist small\n const dp = Array.from({ length: a.length + 1 }, () =>\n new Array(b.length + 1).fill(0)\n );\n for (let i = 0; i <= a.length; i++) dp[i][0] = i;\n for (let j = 0; j <= b.length; j++) dp[0][j] = j;\n for (let i = 1; i <= a.length; i++) {\n for (let j = 1; j <= b.length; j++) {\n const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n dp[i][j] = Math.min(\n dp[i - 1][j] + 1, // deletion\n dp[i][j - 1] + 1, // insertion\n dp[i - 1][j - 1] + cost // substitution\n );\n }\n }\n return dp[a.length][b.length] <= maxDist;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":498,"value":"function verySimilar(nameA, nameB) {\n return phoneticNormalizer(nameA) === phoneticNormalizer(nameB);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":501,"value":"// --- 4) Example usage in your validator pipeline ---\nfunction findVerySimilar(inputName, existingNames) {\n return existingNames\n .filter((nm) => verySimilar(inputName, nm))\n .map((nm) => {\n const why = explainWhy(inputName, nm);\n return `${nm} — ${why}`;\n });\n}\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":504,"value":"// Optional: human-readable reason text for UI\nfunction explainWhy(a, b) {\n const A = phoneticNormalizer(a);\n const B = phoneticNormalizer(b);\n if (A === B) return `phonetic match (“${A}”)`;\n if (A.slice(-2) === B.slice(-2))\n return `endings sound similar (“${a}” ≈ “${b}”)`;\n return `sounds very similar (“${a}” ≈ “${b}”)`;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W3a","stdlib":"1","titling":"auto"}} 2d:"$2c:body"