2d:null 2e:["$","title",null,{"children":"Word Operations | Joanna Slusarewicz | Observable"}] 33:T4d5,html`

${listDisplay(calcPhonemeUnion.slice(0,calcPhonemeUnion.length/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length/5,calcPhonemeUnion.length*2/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length2/5,calcPhonemeUnion.length3/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length3/5,calcPhonemeUnion.length4/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length*4/5,-1))}

`34:[] 31:{"id":"c6332a15223f564e","slug":"word-operations","title":"Word Operations","thumbnail":"1a4d4338170f732cc4d41a3a99c135c3973f31e0e32b3e45808ce224358b8e84","access_level":"public","create_time":"$D2021-03-10T17:56:52.108Z","update_time":"$D2021-07-22T22:05:07.875Z","view_time":null,"first_public_time":"$D2021-03-14T07:30:13.409Z","fork":false,"stars":2,"starred":false,"owner":{"type":"team","id":"bb79fbf86b2f6332","login":"penguin137","name":"Joanna Slusarewicz","avatar_url":"https://avatars-next.observableusercontent.com/c47a1c5b78ac4029d2718dd0a34b08809a1a83dd435f881c521abe55ba790a59","tier":"starter_2024"},"version":572,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"44224e6d481690a1","login":"penguin137","name":"Joanna","avatar_url":"https://avatars-next.observableusercontent.com/c47a1c5b78ac4029d2718dd0a34b08809a1a83dd435f881c521abe55ba790a59","tier":null}],"members":[{"type":"individual","id":"44224e6d481690a1","login":"penguin137","name":"Joanna","avatar_url":"https://avatars-next.observableusercontent.com/c47a1c5b78ac4029d2718dd0a34b08809a1a83dd435f881c521abe55ba790a59","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":1,"collection":{"id":"3a787ff1d2a98845","slug":"reticulated-nonsense","title":"Reticulated Nonsense","owner":{"id":"bb79fbf86b2f6332","login":"penguin137","name":"Joanna Slusarewicz"}},"type":"notebook","body":{"title":"Word Operations","cells":[{"id":0,"value":"md`# Word Operations`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":159,"value":"md`This project engages in the unvaluable task of defining an algebra of English. I plan to tackle several irrelevant questions, such as: \n\n- In what ways can we add words together? Subtract words?\n- Can we define word multiplication? Can such multiplication commute? Can word multiplication and addition be combined to form word rings?\n- How about word division? If we can form word rings, can we also quotient word rings and form word equivalence classes?\n- Can it get even worse?\n\nI am _so glad_ you are joining me in undermining the dignity of the written word. I hope you find my efforts half as amusing as they are irritating.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":156,"value":"md`## Word Addition`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":176,"value":"md`We begin as many troubling journeys begin: by defining the operation of addition.\n\nOf course, there is the obvious method${html`—`}simply score each word according to the rules of Scrabble, and define their word sum as the set of words with Scrabble scores equal to their combined score. Distressingly, this definition seems like it could take work to implement. Therefore it will be discarded.\n\nOne particularly fruitful nightmare yielded the insight that words are rather like sets of phonemes, and as such, perhaps word addition might produce a set of words contained within the intersection of their phonemes.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":8,"value":"wordsPhonemeIntersection = html`\n `","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":82,"value":"viewof calcPhonemeIntersection = Button(\"Equals\", {value: phonemeIntersection(wordsList(wordsPhonemeIntersection)), reduce: () => phonemeIntersection(wordsList(wordsPhonemeIntersection))})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":58,"value":"md`${listDisplay(calcPhonemeIntersection)}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":387,"value":"md`I am trying hard to avoid acknowledging that the English dictionary may be a topology on phoneme set operations. Let's move on.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":391,"value":"md`## Word Subtraction`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":396,"value":"md`Just as the sum of two words is defined from the intersection of phonemes, the difference of two words can be defined through the phonemes that are present in only the first word and not the second.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":402,"value":"wordsPhonemeDifference = html`\n `","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":420,"value":"viewof calcPhonemeDifference = Button(\"Equals\", {value: phonemeDifference(wordsList(wordsPhonemeDifference)), reduce: () => phonemeDifference(wordsList(wordsPhonemeDifference))})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":407,"value":"md`${listDisplay(calcPhonemeDifference)}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":438,"value":"md`## Word Multiplicaion`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":439,"value":"md`Given our distressing success applying set operations to language, let's compound the atrocity by defining word multiplication on the union rather than intersection of phonemes.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":446,"value":"wordsPhonemeUnion = html`\n `","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":449,"value":"viewof calcPhonemeUnion = Button(\"Equals\", {value: phonemeUnion(wordsList(wordsPhonemeUnion)), reduce: () => phonemeUnion(wordsList(wordsPhonemeUnion))})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":461,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":506,"value":"md`Horrific!`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":215,"value":"md`
\n# The Code (With Apologies)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":327,"value":"md`## Addition`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":191,"value":"phonemeIntersection = function(twoWords) {\n let firstPhonemes = (RiTa.phones(twoWords[0])).split(\"-\");\n let secondPhonemes = (RiTa.phones(twoWords[1])).split(\"-\");\n let intersectSounds = intersect(firstPhonemes, secondPhonemes);\n let possibleWords = RiTa.search();\n let intersectWords = [];\n for (let i=0; i < possibleWords.length; i++) {\n let phones = (RiTa.phones(possibleWords[i])).split(\"-\");\n if (containedIn(phones, intersectSounds)) {\n intersectWords.push(possibleWords[i]);\n }\n }\n return intersectWords;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":414,"value":"md`## Subtraction`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":418,"value":"phonemeDifference = function(twoWords) {\n let firstPhonemes = (RiTa.phones(twoWords[0])).split(\"-\");\n let secondPhonemes = (RiTa.phones(twoWords[1])).split(\"-\");\n let differenceSounds = difference(firstPhonemes, secondPhonemes);\n let possibleWords = RiTa.search();\n let differenceWords = [];\n for (let i=0; i < possibleWords.length; i++) {\n let phones = (RiTa.phones(possibleWords[i])).split(\"-\");\n if (containedIn(phones, differenceSounds)) {\n differenceWords.push(possibleWords[i]);\n }\n }\n return differenceWords;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":456,"value":"md`## Multiplication`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":459,"value":"phonemeUnion = function(twoWords) {\n let firstPhonemes = (RiTa.phones(twoWords[0])).split(\"-\");\n let secondPhonemes = (RiTa.phones(twoWords[1])).split(\"-\");\n let unionSounds = union(firstPhonemes, secondPhonemes);\n let possibleWords = RiTa.search();\n let unionWords = [];\n for (let i=0; i < possibleWords.length; i++) {\n let phones = (RiTa.phones(possibleWords[i])).split(\"-\");\n if (containedIn(phones, unionSounds)) {\n unionWords.push(possibleWords[i]);\n }\n }\n return unionWords;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":323,"value":"md`## Helper Functions`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":10,"value":"wordsList = function(wordsInput) {\n return [wordsInput.elements.item(0).value, wordsInput.elements.item(1).value];\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":260,"value":"containedIn = function(list1, list2) {\n for (let i=0; i < list1.length; i++){\n if (list2.indexOf(list1[i]) < 0) {\n return false;\n }\n }\n return true;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":206,"value":"intersect = function (a, b) {\n var setB = new Set(b);\n return [...new Set(a)].filter(x => setB.has(x));\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":410,"value":"difference = function (a, b) {\n var setB = new Set(b);\n return [...new Set(a)].filter(x => !setB.has(x));\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":454,"value":"union = function (a, b) {\n var comb = a.concat(b);\n return [...new Set(comb)];\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":331,"value":"listDisplay = function(list) {\n let output = \"\";\n for (let i=0; i < list.length; i++) {\n output += list[i].toString() + \"
\";\n }\n return output + \"\";\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":68,"value":"import {Button, Text} from \"@observablehq/inputs\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"RiTa = require(\"rita\");","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W34","stdlib":"1","titling":"auto"}} 32:"$31:body"

${listDisplay(calcPhonemeUnion.slice(0,calcPhonemeUnion.length/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length/5,calcPhonemeUnion.length*2/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length*2/5,calcPhonemeUnion.length*3/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length*3/5,calcPhonemeUnion.length*4/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length*4/5,-1))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length2/5,calcPhonemeUnion.length3/5))}

${listDisplay(calcPhonemeUnion.slice(calcPhonemeUnion.length3/5,calcPhonemeUnion.length4/5))}