30:T5ef,processPoem = (rawpoem, skips) => { let tokenized = tokenize(rawpoem); let out = tokenized; for (let j = 0; j < tokenized.length; j++) { let currentToken = tokenized[j]; if (currentToken.type === "word") { // if tagged as "word" and not "whitespace", get its POS. let isWordCapitalised = currentToken.token[0] === currentToken.token[0].toUpperCase(); let word = nlp(currentToken.token); let tokenTags = word.json(0).terms[0].tags; if (tokenTags.includes("Noun")) { // if it is a noun, check if it's in the noun list. if (nounList.includes(currentToken.token.toLowerCase())) { let currentTokenIdx = nounList.findIndex( w => w === currentToken.token ); let newTokenIdx = 0; if (currentTokenIdx + skips > nounList.length) { // loop back to beginning newTokenIdx = currentTokenIdx + skips - nounList.length; } else if (currentTokenIdx + skips < 0) { newTokenIdx = nounList.length + (currentTokenIdx + skips); } else if (currentTokenIdx + skips > 0) { newTokenIdx = currentTokenIdx + skips; } var rep = nounList[newTokenIdx]; if (isWordCapitalised) { rep = capitalizeFirstLetter(rep); } out[j].token = rep; } } } } // format the processed array. let o = []; for (let k = 0; k < out.length; k++) { o.push(out[k].token); } return o; }31:T58b,/* * Tiny tokenizer * * - Accepts a subject string and an object of regular expressions for parsing * - Returns an array of token objects * * tokenize('this is text.', { word:/\w+/, whitespace:/\s+/, punctuation:/[^\w\s]/ }, 'invalid'); * result => [{ token="this", type="word" },{ token=" ", type="whitespace" }, Object { token="is", type="word" }, ... ] * * From https://gist.github.com/borgar/451393/7698c95178898c9466214867b46acb2ab2f56d68 */ function tokenize( s, parsers = { word: /\w+/, whitespace: /\s+/, punctuation: /[^\w\s]/ }, deftok = 'invalid' ) { var m, r, l, cnt, t, tokens = []; while (s) { t = null; m = s.length; for (var key in parsers) { r = parsers[key].exec(s); // try to choose the best match if there are several // where "best" is the closest to the current starting point if (r && r.index < m) { t = { token: r[0], type: key, matches: r.slice(1) }; m = r.index; } } if (m) { // there is text between last token and currently // matched token - push that out as default or "unknown" tokens.push({ token: s.substr(0, m), type: deftok || 'unknown' }); } if (t) { // push current token onto sequence tokens.push(t); } s = s.substr(m + (t ? t.token.length : 0)); } return tokens; }32:[{"id":"2b305a2a2c70601b18eb30b364879b2d88ba09c6fa8511067ea201941bb46a31040789a30347ac1363ba46932ff138fdb9097fe082168e25be7d807479558eb6","href":"https://static.observableusercontent.com/files/2b305a2a2c70601b18eb30b364879b2d88ba09c6fa8511067ea201941bb46a31040789a30347ac1363ba46932ff138fdb9097fe082168e25be7d807479558eb6","name":"nounlist.txt","type":"text/plain","lastModified":1597031123847.835,"size":54860}] 2e:{"title":"Oulipo N+1","cells":[{"id":0,"value":"headerIntro = md`# Oulipo N+1\n\nThis little tool/toy was created for the [Day 3 prompt](https://www.facebook.com/groups/SEAPoWriMo/permalink/997123160740745/) for [SEAPoWriMo 2020](https://www.facebook.com/groups/SEAPoWriMo/).\n\nEvery noun in the piece entered below is replaced with another noun *x* words away in the dictionary.\n\n\nCan an [Oulipan](https://en.wikipedia.org/wiki/Oulipo) poem be used as a cryptographic device? That is, if you have access to the dictionary used by the poet, you can walk backwards in time from, say, the N+2020 piece, all the way to N+0: the original poem.\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":194,"value":"viewof skips = slider({\n min: -sliderMax,\n max: sliderMax,\n step: 1,\n value: 10,\n title: \"Set N + ...\"\n})","pinned":false,"hidden":false,"mode":"ojs"},{"id":54,"value":"viewof rawpoem = textarea({\n title: \"Your Great Oulipan Poem\",\n value:\n \"The quick brown fox jumped over the lazy dog.\\nTwo driven jocks help fax my big quiz.\\nA wizard's job is to vex chumps quickly in fog.\",\n spellcheck: true,\n width: \"60%\",\n rows: 10,\n submit: \"Generate\"\n})","pinned":false,"hidden":false,"mode":"ojs"},{"id":177,"value":"oulipo = md`\n## N${formatSkips(skips)}\n\n${processPoem(rawpoem, skips)\n .join(\"\")\n .split(\"\\n\")\n .join(\"
\")}\n\n
\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":298,"value":"notesSubSect = md`## Notes\n
\nThe list of nouns comes from [Desi Quintans](http://www.desiquintans.com/nounlist).\n
\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":156,"value":"appendixSubSect = md`\n## Appendix\n
\n### A list of ${nounList.length} nouns`","pinned":false,"hidden":false,"mode":"ojs"},{"id":136,"value":"nounList = {\n let raw = d3.tsvParse(await FileAttachment(\"nounlist.txt\").text());\n let out = [];\n\n for (let j = 0; j < raw.length; j++) {\n out.push(raw[j].ATM);\n }\n\n return out;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":371,"value":"sliderMax = nounList.length / 2","pinned":false,"hidden":false,"mode":"ojs"},{"id":35,"value":"functionsSubSect = md`### Functions`","pinned":false,"hidden":false,"mode":"ojs"},{"id":104,"value":"$30","pinned":false,"hidden":false,"mode":"ojs"},{"id":317,"value":"function capitalizeFirstLetter(string) {\n return string[0].toUpperCase() + string.slice(1);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":38,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":243,"value":"formatSkips = s => {\n if (s > 0) return \"+\" + s;\n else return s.toString();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":4,"value":"librariesSubSect = md`### Libraries`","pinned":false,"hidden":false,"mode":"ojs"},{"id":50,"value":"import { slider, textarea } from \"@jashkenas/inputs\"","pinned":true,"hidden":false,"mode":"ojs"},{"id":65,"value":"nlp = require('compromise@latest')","pinned":true,"hidden":false,"mode":"ojs"},{"id":132,"value":"d3 = require(\"d3@5\")","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W32","stdlib":"1","titling":"auto"}