Surprising embeddings

\n Embeddings. They're one of the parts of the LLM/AI wave that I sort of like.\n

\n An embedding model takes a bit of text and returns a big array of floating-point numbers that represent its\n position in a sort of _hyper-dimensional embedding space_. You interpret this array as sort of a big coordinate,\n like longitude & latitude & elevation & time and a thousand other dimensions, and you get sort of the word's place\n in the computer's… mind-brain, or whatever.\n

\n Embeddings are pretty cool when they work, because they sort of capture the idea of{\" \"}\n 'vibes', which makes them useful for search applications.\n Someone can search for 'lettuce' and get results for 'spinach' too because they're similar. It's amazing when it\n works. And pretty weird when it doesn't!\n

\n This project is based on this{\" \"}\n \n blog post I read last year\n {\" \"}\n about 'how RAG fails', which was unfortunately written by someone{\" \"}\n with a RAG alternative to sell.\n

\n But maybe maybe RAG is doomed, in some ways? Half the time it does something magical, and half the time it\n produces something deeply weird. It thinks that, for example, \"the 1900s\" are more similar to \"the 1700s\" than to\n \"20th century.\" Most of these, I think, are related to how the RAG is a little literal and focused on the style of\n a phrase as well as the content of it. On the other hand, all other search solutions, like fuzzy matching and most\n ranking algorithms, are also some sort of good-enough heuristic, so maybe RAG is totally fine.\n

\n Play around. You can enter up to 8 words or phrases. The thickness and opacity of the connections indicates how\n connected the model thinks the things are.\n

\n \n)\n\nconst examples =

\n Examples:{\" \"}\n {[\n {\n title: \"Apples and bananas are really different\",\n q: \"/?word=apples&word=oranges&word=bananas&word=grapefruit&word=blueberry&word=blackberry&word=raspberry&word=\",\n },\n {\n title: \"Lexus is way different from Tesla\",\n q: \"/?word=porsche&word=ferrari&word=tesla&word=kia&word=lexus&word=toyota&word=hyundai&word=\",\n },\n {\n title: \"Cats and dogs are more similar to each other than to canine and feline\",\n q: \"/?word=dog&word=cat&word=feline&word=canine&word=&word=&word=&word=\",\n },\n {\n title: \"Chess pieces wtf\",\n q: \"/?word=pawn&word=king&word=queen&word=rook&word=castle&word=&word=&word=\",\n },\n ].map((ex, i, arr) => {\n return (\n <>\n {ex.title}\n {i === arr.length - 1 ? \"\" : \", \"}\n \n )\n })}\n

\n\n// Based on https://github.com/Shawns2759/vector-similarity MIT\nfunction dotProduct(a: number[], b: number[]): number {\n return a.reduce((sum, value, index) => sum + value * b[index], 0)\n}\n\nfunction vectorMagnitude(a: number[]): number {\n return Math.sqrt(a.reduce((sum, value) => sum + value * value, 0))\n}\n\nfunction cosineSimilarity(a: number[], b: number[]): number {\n const dotProd = dotProduct(a, b)\n const magnitudeA = vectorMagnitude(a)\n const magnitudeB = vectorMagnitude(b)\n return dotProd / (magnitudeA * magnitudeB)\n}\n\nconst app = new Hono()\napp.get(\"/\", async (c) => {\n const r = blockAi(c.req.headers.get(\"User-Agent\"))\n if (r) return r\n\n if (working) {\n return c.text(\"Sorry, another embedding is being fetched, wait a moment and try again\")\n }\n\n working = true\n const inputQ = c.req.queries(\"word\")\n const items = (inputQ ?? []).filter(Boolean)\n const inputResult = v.safeParse(inputSchema, items)\n\n if (inputResult.success) {\n const input = inputResult.output\n const embeddings = await client.embed({\n input,\n model: \"voyage-3-lite\",\n })\n\n const zipped = input.map((word, i) => {\n return {\n word,\n embedding: embeddings.data?.at(i)?.embedding,\n }\n })\n\n const data = {\n nodes: zipped.map(z => {\n return {\n id: z.word,\n }\n }),\n links: zipped.flatMap((z, i) => {\n return zipped.slice(i + 1).map(z2 => {\n return {\n source: z.word,\n target: z2.word,\n value: cosineSimilarity(z.embedding, z2.embedding),\n }\n })\n }),\n }\n\n let nodePool = data.nodes.slice()\n let ordered = []\n\n const linkOrder = data.links.sort((l1, l2) => {\n return l2.value - l1.value\n })\n\n console.log(linkOrder)\n for (let link of linkOrder) {\n const s = nodePool.find(n => {\n return n.id === link.source\n })\n const t = nodePool.find(n => n.id === link.target)\n nodePool = nodePool.filter(n => n !== s && n !== t)\n console.log(s, t)\n if (s) ordered.push(s)\n if (t) ordered.push(t)\n }\n\n data.nodes = ordered.concat(nodePool)\n\n setTimeout(() => {\n working = false\n }, THROTTLE)\n\n return c.html(\n \n \n Surprising embeddings\n \n\n \n \n \n

\n Surprising embeddings\n \n Using Voyage AI voyage-3-lite model\n \n

\n \n \n \n

\n\n \n\n {examples}\n\n

{intro}

\n\n \n \n ,\n )\n }\n\n return c.html(\n \n \n Surprising embeddings\n \n\n \n \n \n

\n Surprising embeddings\n \n Using Voyage AI voyage-3-lite model\n \n

\n\n {examples}\n\n \n\n

{intro}

\n \n \n ,\n )\n})\n\nexport default app.fetch","surprising-embeddings",[],[158],"dd3fa0e8-da74-11ef-aa76-e6cdfca9ef9f","embeddingGetter",25,["D",1737738093468],24,"import * as v from \"jsr:@valibot/valibot\"\nimport { VoyageAIClient } from \"npm:voyageai\"\n\n// Create login schema with email and password\nconst inputSchema = v.pipe(v.array(v.pipe(v.string(), v.minLength(1), v.maxLength(32))), v.maxLength(4))\nconst client = new VoyageAIClient({ apiKey: Deno.env.get(\"VOYAGE_API_TOKEN\") })\n\nlet working = false\n// milliseconds between requests to pause\nconst THROTTLE = 1000\n\nexport default async function(req: Request): Promise {\n if (working) {\n return Response.json({\n error: \"Sorry, another embedding is being fetched, wait a moment and try again\",\n })\n }\n\n working = true\n const input = v.parse(inputSchema, [\"dogs\", \"cats\", \"felines\", \"canines\"])\n\n const embeddings = await client.embed({\n input,\n model: \"voyage-3-lite\",\n })\n\n const zipped = input.map((word, i) => {\n return {\n word,\n embedding: embeddings.data?.at(i)?.embedding,\n }\n })\n\n setTimeout(() => {\n working = false\n }, THROTTLE)\n\n return Response.json({\n data: zipped,\n })\n}",[],[168],["D",1738862357875],[],[18],"4f0c1314-da9d-11ef-9b0b-e6cdfca9ef9f","amicableCoralPorcupine","392b788c-da9d-11ef-9d66-e6cdfca9ef9f",328,["D",1737755464259],"import sqlite from \"https://esm.town/v/std/sqlite2\"",[],[179],["D",1737736218273],{"_11":12,"_97":93},{"_11":12,"_91":-5,"_92":93,"_30":49,"_94":95,"_96":24},{"_80":81,"_13":16,"_37":82,"_83":38,"_84":-5,"_85":-5,"_86":-5,"_87":-5,"_88":-5,"_89":14,"_90":12},"ctx",{"_73":-5,"_116":223,"_224":225,"_226":227,"_228":24,"_229":24,"_230":24,"_231":53,"_232":-5,"_233":-7,"_234":-7,"_235":26,"_236":24,"_237":24,"_238":-5,"_239":24,"_240":24,"_241":24,"_242":-5},"ENV",{"_194":195,"_196":197,"_198":16,"_199":200,"_201":202,"_203":204,"_205":206,"_207":208,"_209":210,"_211":212,"_213":214,"_215":216,"_217":218,"_219":220,"_221":222},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","RENDER_GIT_COMMIT","fdb67791413f4386b4dbf18f354029a617f6160f","RENDER_GIT_BRANCH","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","CLOUDFLARE_TURNSTILE_SITE_KEY","0x4AAAAAACtaIZJH7s9rBMZ6","GOOGLE_CLIENT_ID","875989696899-jtsqkhlbdv5jrlsk8631p7ipjg3c6o62.apps.googleusercontent.com","STRIPE_PUBLISHABLE_KEY","pk_live_51N2zvWEpZTTLipIkVEwXrUG9AT0yeOOEYxszarZT1jpsZV58Ly6wlg3SltZpHN26CUalOBmUSY7adQRQiSkCZz2500qSXNkf8Y","API_URL","https://api.val.town",[],"preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesCloseBrackets","preferencesChatPanelState","preferencesDprint","preferencesDenofmt","notificationCount","flagDenols","isBusinessOrgMember","businessOrgHandle","isBusinessOrgAdmin","isHigherTownieTier","navCollapsed","currentOrgId"]

History · bots