{
    "componentChunkName": "component---src-templates-note-note-js",
    "path": "/notes/three-letter-words",
    "result": {"data":{"mdx":{"body":"var _excluded = [\"components\"];\nfunction _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n/* @jsxRuntime classic */\n/* @jsx mdx */\n\nvar _frontmatter = {};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n    props = _objectWithoutProperties(_ref, _excluded);\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(\"p\", null, \"was thinking of teaching 3 letter words to abhirath. I thought this was going to be easy. But then I wanted to approach this methodically and create some toys and games around this too. \"), mdx(\"p\", null, \"Started with the overall universe of 3 letter combinations. 26 \", mdx(\"em\", {\n    parentName: \"p\"\n  }, \" 26 \"), \" 26 = 17576 unique combinations. But not all of them will be relevant english words. \"), mdx(\"p\", null, \"A decent enough list should be sufficient to get started for Abhirath. So got this list from some website. \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"https://docs.google.com/spreadsheets/d/1UuZuVEVhlGKVzjei9J7yVY4PJhbsBiL10wzwZcLTokA/edit#gid=0\"\n  }, \"https://docs.google.com/spreadsheets/d/1UuZuVEVhlGKVzjei9J7yVY4PJhbsBiL10wzwZcLTokA/edit#gid=0\")), mdx(\"p\", null, \"Basic randomiser from this list - \", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"https://benevolent-cendol-ba19ba.netlify.app/\"\n  }, \"https://benevolent-cendol-ba19ba.netlify.app/\")), mdx(\"h2\", null, \"Oxford 3000 word list\"), mdx(\"p\", null, \"I came across this oxford list of 3000 frequently used words. I sorted this list by number of characters and then by alphabets.\\n\", mdx(\"a\", {\n    parentName: \"p\",\n    \"href\": \"https://docs.google.com/spreadsheets/d/1sQWCk6s25J6NknkZzTx7DRaH9YSu9SJU4cfCyQCFkGg/edit#gid=0\"\n  }, \"https://docs.google.com/spreadsheets/d/1sQWCk6s25J6NknkZzTx7DRaH9YSu9SJU4cfCyQCFkGg/edit#gid=0\")), mdx(\"h2\", null, \"Further reading\"), mdx(\"ol\", null, mdx(\"li\", {\n    parentName: \"ol\"\n  }, \"\", mdx(\"a\", {\n    parentName: \"li\",\n    \"href\": \"/notes/words-and-frequencies\",\n    \"title\": \"words and frequencies\"\n  }, \"words and frequencies\"), \"\")));\n}\n;\nMDXContent.isMDXComponent = true;","inboundReferences":[]}},"pageContext":{"slug":"three-letter-words","node":{"childMdx":{"slug":"three-letter-words"}}}},
    "staticQueryHashes": []}