31:T4092,// from https://observablehq.com/@dhowe/understanding-word-vectors embeddings = (function (e) { var t = {}; function r(o) { if (t[o]) return t[o].exports; var n = (t[o] = { i: o, l: !1, exports: {} }); return e[o].call(n.exports, n, n.exports, r), (n.l = !0), n.exports; } return ( (r.m = e), (r.c = t), (r.d = function (e, t, o) { r.o(e, t) || Object.defineProperty(e, t, { enumerable: !0, get: o }); }), (r.r = function (e) { "undefined" != typeof Symbol && Symbol.toStringTag && Object.defineProperty(e, Symbol.toStringTag, { value: "Module" }), Object.defineProperty(e, "__esModule", { value: !0 }); }), (r.t = function (e, t) { if ((1 & t && (e = r(e)), 8 & t)) return e; if (4 & t && "object" == typeof e && e && e.__esModule) return e; var o = Object.create(null); if ( (r.r(o), Object.defineProperty(o, "default", { enumerable: !0, value: e }), 2 & t && "string" != typeof e) ) for (var n in e) r.d( o, n, function (t) { return e[t]; }.bind(null, n) ); return o; }), (r.n = function (e) { var t = e && e.__esModule ? function () { return e.default; } : function () { return e; }; return r.d(t, "a", t), t; }), (r.o = function (e, t) { return Object.prototype.hasOwnProperty.call(e, t); }), (r.p = ""), r((r.s = 2)) ); })([ function (e, t) { e.exports = tf; }, function (e, t, r) { var o, n = (function () { var e = String.fromCharCode, t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", o = {}; function n(e, t) { if (!o[e]) { o[e] = {}; for (var r = 0; r < e.length; r++) o[e][e.charAt(r)] = r; } return o[e][t]; } var s = { compressToBase64: function (e) { if (null == e) return ""; var r = s._compress(e, 6, function (e) { return t.charAt(e); }); switch (r.length % 4) { default: case 0: return r; case 1: return r + "==="; case 2: return r + "=="; case 3: return r + "="; } }, decompressFromBase64: function (e) { return null == e ? "" : "" == e ? null : s._decompress(e.length, 32, function (r) { return n(t, e.charAt(r)); }); }, compressToUTF16: function (t) { return null == t ? "" : s._compress(t, 15, function (t) { return e(t + 32); }) + " "; }, decompressFromUTF16: function (e) { return null == e ? "" : "" == e ? null : s._decompress(e.length, 16384, function (t) { return e.charCodeAt(t) - 32; }); }, compressToUint8Array: function (e) { for ( var t = s.compress(e), r = new Uint8Array(2 * t.length), o = 0, n = t.length; o < n; o++ ) { var a = t.charCodeAt(o); (r[2 * o] = a >>> 8), (r[2 * o + 1] = a % 256); } return r; }, decompressFromUint8Array: function (t) { if (null == t) return s.decompress(t); for ( var r = new Array(t.length / 2), o = 0, n = r.length; o < n; o++ ) r[o] = 256 * t[2 * o] + t[2 * o + 1]; var a = []; return ( r.forEach(function (t) { a.push(e(t)); }), s.decompress(a.join("")) ); }, compressToEncodedURIComponent: function (e) { return null == e ? "" : s._compress(e, 6, function (e) { return r.charAt(e); }); }, decompressFromEncodedURIComponent: function (e) { return null == e ? "" : "" == e ? null : ((e = e.replace(/ /g, "+")), s._decompress(e.length, 32, function (t) { return n(r, e.charAt(t)); })); }, compress: function (t) { return s._compress(t, 16, function (t) { return e(t); }); }, _compress: function (e, t, r) { if (null == e) return ""; var o, n, s, a = {}, i = {}, c = "", u = "", l = "", p = 2, h = 3, f = 2, d = [], v = 0, m = 0; for (s = 0; s < e.length; s += 1) if ( ((c = e.charAt(s)), Object.prototype.hasOwnProperty.call(a, c) || ((a[c] = h++), (i[c] = !0)), (u = l + c), Object.prototype.hasOwnProperty.call(a, u)) ) l = u; else { if (Object.prototype.hasOwnProperty.call(i, l)) { if (l.charCodeAt(0) < 256) { for (o = 0; o < f; o++) (v <<= 1), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++; for (n = l.charCodeAt(0), o = 0; o < 8; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); } else { for (n = 1, o = 0; o < f; o++) (v = (v << 1) | n), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n = 0); for (n = l.charCodeAt(0), o = 0; o < 16; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); } 0 == --p && ((p = Math.pow(2, f)), f++), delete i[l]; } else for (n = a[l], o = 0; o < f; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); 0 == --p && ((p = Math.pow(2, f)), f++), (a[u] = h++), (l = String(c)); } if ("" !== l) { if (Object.prototype.hasOwnProperty.call(i, l)) { if (l.charCodeAt(0) < 256) { for (o = 0; o < f; o++) (v <<= 1), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++; for (n = l.charCodeAt(0), o = 0; o < 8; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); } else { for (n = 1, o = 0; o < f; o++) (v = (v << 1) | n), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n = 0); for (n = l.charCodeAt(0), o = 0; o < 16; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); } 0 == --p && ((p = Math.pow(2, f)), f++), delete i[l]; } else for (n = a[l], o = 0; o < f; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); 0 == --p && ((p = Math.pow(2, f)), f++); } for (n = 2, o = 0; o < f; o++) (v = (v << 1) | (1 & n)), m == t - 1 ? ((m = 0), d.push(r(v)), (v = 0)) : m++, (n >>= 1); for (;;) { if (((v <<= 1), m == t - 1)) { d.push(r(v)); break; } m++; } return d.join(""); }, decompress: function (e) { return null == e ? "" : "" == e ? null : s._decompress(e.length, 32768, function (t) { return e.charCodeAt(t); }); }, _decompress: function (t, r, o) { var n, s, a, i, c, u, l, p = [], h = 4, f = 4, d = 3, v = "", m = [], g = { val: o(0), position: r, index: 1 }; for (n = 0; n < 3; n += 1) p[n] = n; for (a = 0, c = Math.pow(2, 2), u = 1; u != c; ) (i = g.val & g.position), (g.position >>= 1), 0 == g.position && ((g.position = r), (g.val = o(g.index++))), (a |= (i > 0 ? 1 : 0) * u), (u <<= 1); switch (a) { case 0: for (a = 0, c = Math.pow(2, 8), u = 1; u != c; ) (i = g.val & g.position), (g.position >>= 1), 0 == g.position && ((g.position = r), (g.val = o(g.index++))), (a |= (i > 0 ? 1 : 0) * u), (u <<= 1); l = e(a); break; case 1: for (a = 0, c = Math.pow(2, 16), u = 1; u != c; ) (i = g.val & g.position), (g.position >>= 1), 0 == g.position && ((g.position = r), (g.val = o(g.index++))), (a |= (i > 0 ? 1 : 0) * u), (u <<= 1); l = e(a); break; case 2: return ""; } for (p[3] = l, s = l, m.push(l); ; ) { if (g.index > t) return ""; for (a = 0, c = Math.pow(2, d), u = 1; u != c; ) (i = g.val & g.position), (g.position >>= 1), 0 == g.position && ((g.position = r), (g.val = o(g.index++))), (a |= (i > 0 ? 1 : 0) * u), (u <<= 1); switch ((l = a)) { case 0: for (a = 0, c = Math.pow(2, 8), u = 1; u != c; ) (i = g.val & g.position), (g.position >>= 1), 0 == g.position && ((g.position = r), (g.val = o(g.index++))), (a |= (i > 0 ? 1 : 0) * u), (u <<= 1); (p[f++] = e(a)), (l = f - 1), h--; break; case 1: for (a = 0, c = Math.pow(2, 16), u = 1; u != c; ) (i = g.val & g.position), (g.position >>= 1), 0 == g.position && ((g.position = r), (g.val = o(g.index++))), (a |= (i > 0 ? 1 : 0) * u), (u <<= 1); (p[f++] = e(a)), (l = f - 1), h--; break; case 2: return m.join(""); } if ((0 == h && ((h = Math.pow(2, d)), d++), p[l])) v = p[l]; else { if (l !== f) return null; v = s + s.charAt(0); } m.push(v), (p[f++] = s + v.charAt(0)), (s = v), 0 == --h && ((h = Math.pow(2, d)), d++); } } }; return s; })(); void 0 === (o = function () { return n; }.call(t, r, t, e)) || (e.exports = o); }, function (e, t, r) { "use strict"; r.r(t); var o = r(1), n = r(0); const s = function (e, t) { var r = JSON.parse(o.decompressFromBase64(e)); return n.tensor(r.vectors, r.shape, t); }; r.d(t, "loadModel", function () { return i; }); class a { constructor(e, t, r) { (this.vocabulary = r), (this.centroids = t), (this.codes = e); } _getVector(e) { var t = this.vocabulary.indexOf(e); if (-1 === t) return n.zeros([this.codes.shape[1] * this.centroids.shape[2]]); var r = this._getSearchVector(t), o = n.range(0, this.codes.shape[1], 1, "int32"), s = n.stack([o, r], -1); return n.gatherND(this.centroids, s).flatten(); } _getSearchVector(e) { return this.codes.gather([e]).as1D(); } _transformSequence(e, t) { for (var r = [], o = 0; o < e.length; o++) r.push(this._getVector(e[o])); var s = n.stack(r); return (s = s.pad([ [t - e.length, 0], [0, 0] ])); } getVector(e) { return this._getVector(e).dataSync(); } getCosineDistance(e, t) { var r = this._getVector(e), o = this._getVector(t), n = r.dot(o).asScalar(), s = r.norm(2), a = o.norm(2); return n.div(s).div(a).dataSync()[0]; } async getNearestNeighbors(e, t = 5) { var r = this._getVector(e); return await this._getNearestNeighbors(r, t); } async _getNearestNeighbors(e, t) { var r = n.tensor1d([]), o = e.norm(2).asScalar(); console.time("precompute_distances"); var s = this._computeDistances(e); console.timeEnd("precompute_distances"), await n.nextFrame(), console.time("calulate"); var a = this.centroids.shape[0]; const i = n.range(0, a, 1, "int32").tile([this.vocabulary.length]), c = this.codes.flatten(); var u = n.stack([i, c], -1), l = n.gatherND(s[0], u).reshape([this.vocabulary.length, -1]), p = n.gatherND(s[1], u).reshape([this.vocabulary.length, -1]); (l = l.sum([1])), (p = p.sum([1])), (r = l.div(o.mul(p.sqrt()))), console.timeEnd("calulate"), await n.nextFrame(), console.time("topk"); var { values: h, indices: f } = n.topk(r, t + 1); console.timeEnd("topk"), await n.nextFrame(), (h = h.dataSync()), (f = f.dataSync()); for (var d = [], v = 1; v < f.length; v++) d.push({ word: this.vocabulary[f[v]], distance: h[v] }); return d; } async wordAnalogy(e, t, r, o = 5) { var n = this._getVector(e), s = this._getVector(t), a = this._getVector(r); (n = n.div(n.norm())), (s = s.div(s.norm())), (a = a.div(a.norm())); var i = n.add(s).sub(a); return await this._getNearestNeighbors(i, o); } _computeDistances(e) { var t = this.centroids.shape[0]; e = e.reshape([t, -1]); for ( var r = this.centroids.norm(2, 2).square(), o = [], s = 0; s < t; s++ ) { var a = e.gather([s]).squeeze(), i = this.centroids.gather([s]).squeeze(), c = a.dot(i.transpose()); o.push(c); } return [(o = n.stack(o)), r]; } } const i = async function (e) { const t = await (async function (e) { var t = await fetch(e); return await t.json(); })(e); console.log("Unpacking codes"); var r = s(t.codes, "int32"); await n.nextFrame(), console.log("Unpacking centroids"); var o = s(t.centroids, "float32"); return await n.nextFrame(), new a(r, o, t.vocabulary); }; } ])32:[] 2f:{"title":"Interpolations v0.1","cells":[{"id":0,"value":"# Interpolations v0.1\n\n## _A response to the [SPWM22 Day 13 Prompt](https://www.facebook.com/groups/singpowrimo/posts/5056380184477192/)._\n\nVery simply, a randomly generated `colour-noun` pair is linked by a [gerund](https://en.wikipedia.org/wiki/Gerund) to another `colour-noun` pair. The second colour is also randomly generated. \n\nWe then pull out the word vectors for the first colour-noun pair from the Stanford [Global Vectors for Word Representation (GloVe)](https://nlp.stanford.edu/projects/glove/), which models how often two words appear together in a given document.\n\nThe distance between the colour and the noun is then added to the second colour, to generate a new artificial word vector. The word vector in GloVe closest to this new vector is then paired with the second colour to complete our line.\n\nTo add a little colour (hurhur) to the poem, the colour of the line itself is a gradient between the first colour and the second colour.\n\nThe button `Paint.` below generates a fresh list of lines on-demand.","pinned":false,"hidden":false,"mode":"md"},{"id":530,"value":"viewof paint = Inputs.button(\"Paint.\", {\n disabled: false\n})","pinned":false,"hidden":false,"mode":"ojs"},{"id":362,"value":"html`${poem_html}`","pinned":false,"hidden":false,"mode":"ojs"},{"id":498,"value":"## Lexicon","pinned":false,"hidden":false,"mode":"md"},{"id":475,"value":"poem_html = {\n let out = [\n `\n\n\n
\n`\n ];\n\n while (out.length - 1 != lines.length) {\n let l = ` ${\n lines[out.length]\n }
`;\n out.push(l);\n }\n\n return out;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":449,"value":"firstColors = {\n paint;\n let out = [];\n let i = 0;\n\n while (i < numLines) {\n out.push(colors[Math.floor(Math.random() * colors.length)]);\n i++;\n }\n return out;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":452,"value":"secondColors = {\n paint;\n let out = [];\n\n let i = 0;\n let randomColor = firstColors[0];\n\n while (i < numLines) {\n let newColor = colors[Math.floor(Math.random() * colors.length)];\n while (randomColor != newColor) {\n out.push(colors[Math.floor(Math.random() * colors.length)]);\n randomColor = newColor;\n i++;\n }\n }\n return out;\n\n return out;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":401,"value":"lines = {\n paint;\n let out = [];\n let i = 0;\n\n while (i < numLines) {\n let firstNoun = RiTa.randomWord({ pos: \"nn\" });\n let firstColor = firstColors[i];\n\n let secondColor = secondColors[i];\n let analogies = await find_analogy(firstColor, firstNoun, secondColor);\n\n out.push(\n [\n \"the\",\n firstColor,\n firstNoun,\n RiTa.randomWord({ pos: \"vbg\" }),\n // RiTa.randomWord({ pos: \"rb\" }),\n \"the\",\n secondColor,\n analogies[0].toLowerCase()\n ].join(\" \")\n );\n\n i++;\n }\n\n return out;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":399,"value":"numLines = 10","pinned":true,"hidden":false,"mode":"ojs"},{"id":404,"value":"colors = [\n \"red\",\n \"cyan\",\n \"blue\",\n \"purple\",\n \"yellow\",\n \"lime\",\n \"magenta\",\n \"pink\",\n \"grey\",\n \"black\",\n \"orange\",\n \"brown\",\n \"maroon\",\n \"green\",\n // \"olive\",\n \"aquamarine\",\n \"salmon\",\n \"crimson\",\n \"coral\",\n \"tomato\",\n \"gold\",\n \"moccasin\",\n \"khaki\",\n \"lavender\",\n \"thistle\",\n \"plum\",\n \"violet\",\n \"orchid\",\n \"fuchsia\",\n \"indigo\",\n \"chartreuse\",\n \"lime\",\n \"aqua\",\n \"turquoise\",\n \"navy\",\n \"bisque\",\n \"wheat\",\n \"tan\",\n \"goldenrod\",\n \"sienna\",\n \"chocolate\"\n]","pinned":false,"hidden":false,"mode":"ojs"},{"id":71,"value":"## Imports","pinned":false,"hidden":false,"mode":"md"},{"id":123,"value":"// from https://observablehq.com/@dhowe/understanding-word-vectors\n\nminusV = function (coord1, coord2) {\n return coord1.map((e, i) => e - coord2[i]);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":133,"value":"addV = function (coord1, coord2) {\n return coord1.map((e, i) => e + coord2[i]);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":103,"value":"// from https://observablehq.com/@dhowe/understanding-word-vectors\n\ngloVeClosest = async function (tokenList, vector, start = 0, end = 10) {\n let tensor = tf.tensor1d(vector);\n let neighbors = await gloVe._getNearestNeighbors(tensor, 1000, true);\n return (\n neighbors\n //.filter((t) => tokenList.includes(t.word))\n .slice(start, end)\n .map((n) => n.word)\n );\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":317,"value":"find_analogy = function (w1, w2, w3, n = 10) {\n let e1 = gloVe.getVector(w1);\n let e2 = gloVe.getVector(w2);\n let e3 = gloVe.getVector(w3);\n let e4 = minusV(addV(e3, e2), e1);\n\n let nearest_words = gloVeClosest(gloVe.vocabulary, e4, 4);\n\n return nearest_words;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":92,"value":"gloVe = await embeddings.loadModel(\n \"https://raw.githubusercontent.com/mb-14/embeddings.js/master/assets/word-embeddings.json\"\n)","pinned":false,"hidden":false,"mode":"ojs"},{"id":96,"value":"tf = require(\"https://cdn.jsdelivr.net/npm/@tensorflow/tfjs@3.3.0/dist/tf.min.js\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":74,"value":"import {RiTa} from \"@dhowe/rita\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":94,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":268,"value":"import { word2vec, query } from \"@endpointservices/word2vec\"","pinned":false,"hidden":false,"mode":"ojs"},{"id":88,"value":"## Scratch","pinned":false,"hidden":false,"mode":"md"},{"id":15,"value":"//i = d3.interpolateRgb(\"red\", \"green\")","pinned":false,"hidden":false,"mode":"ojs"}],"files":"$W32","stdlib":"1","titling":"auto"}