{"id":3703,"date":"2018-08-13T03:25:01","date_gmt":"2018-08-13T03:25:01","guid":{"rendered":"http:\/\/ben.akrin.com\/?p=3703"},"modified":"2018-08-13T03:25:01","modified_gmt":"2018-08-13T03:25:01","slug":"the-most-english-word-of-all-english-words","status":"publish","type":"post","link":"https:\/\/ben.akrin.com\/?p=3703","title":{"rendered":"The Wordiest Word"},"content":{"rendered":"<p>With <a href=\"http:\/\/ben.akrin.com\/?p=779\">Markov chain based random word generation<\/a>, I essentially have tables of the probabilities for letters sequences. With this I&#8217;ve always wanted to know what the most English word was. The word with the highest probability of each letter following its predecessors.<\/p>\n<p>I finally bit the bullet and produced it; well them, because it varies depending on the corpus &amp; depth used. All in all it&#8217;s not that impressive, just kind of cool to know. I don&#8217;t know what I was expecting, some amazing word that would rock my socks off.<\/p>\n<p>Without further ado, here they are:<\/p>\n<table>\n<tbody>\n<tr>\n<td><strong>Corpus<\/strong><\/td>\n<td><strong>Depth<\/strong><\/td>\n<td><strong>Wordiest Word<\/strong><\/td>\n<\/tr>\n<tr>\n<td>basic_english_words<\/td>\n<td>1<\/td>\n<td>st<\/td>\n<\/tr>\n<tr>\n<td>basic_english_words<\/td>\n<td>2<\/td>\n<td>st<\/td>\n<\/tr>\n<tr>\n<td>basic_english_words<\/td>\n<td>3<\/td>\n<td>struction<\/td>\n<\/tr>\n<tr>\n<td>basic_english_words<\/td>\n<td>4<\/td>\n<td>statement<\/td>\n<\/tr>\n<tr>\n<td>basic_english_words<\/td>\n<td>5<\/td>\n<td>store<\/td>\n<\/tr>\n<tr>\n<td>unabridged_english_dictionary<\/td>\n<td>1<\/td>\n<td>prerererererererere&#8230;<\/td>\n<\/tr>\n<tr>\n<td>unabridged_english_dictionary<\/td>\n<td>2<\/td>\n<td>press<\/td>\n<\/tr>\n<tr>\n<td>unabridged_english_dictionary<\/td>\n<td>3<\/td>\n<td>press<\/td>\n<\/tr>\n<tr>\n<td>unabridged_english_dictionary<\/td>\n<td>4<\/td>\n<td>preconcer<\/td>\n<\/tr>\n<tr>\n<td>unabridged_english_dictionary<\/td>\n<td>5<\/td>\n<td>preconcertification<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"<p>With Markov chain based random word generation, I essentially have tables of the probabilities for letters sequences. With this I&#8217;ve always wanted to know what the most English word was. The word with the highest probability of each letter following its predecessors. I finally bit the bullet and produced it; well them, because it varies &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/ben.akrin.com\/?p=3703\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;The Wordiest Word&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[27,4],"tags":[],"class_list":["post-3703","post","type-post","status-publish","format-standard","hentry","category-all-out-geekery","category-i-t"],"_links":{"self":[{"href":"https:\/\/ben.akrin.com\/index.php?rest_route=\/wp\/v2\/posts\/3703","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ben.akrin.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ben.akrin.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ben.akrin.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ben.akrin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3703"}],"version-history":[{"count":0,"href":"https:\/\/ben.akrin.com\/index.php?rest_route=\/wp\/v2\/posts\/3703\/revisions"}],"wp:attachment":[{"href":"https:\/\/ben.akrin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3703"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ben.akrin.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3703"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ben.akrin.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3703"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}