{"id":14448,"date":"2026-08-05T01:00:00","date_gmt":"2026-08-05T05:00:00","guid":{"rendered":"https:\/\/www.both.org\/?p=14448"},"modified":"2026-08-02T12:46:25","modified_gmt":"2026-08-02T16:46:25","slug":"using-grep-to-play-a-game","status":"publish","type":"post","link":"http:\/\/www.both.org\/?p=14448","title":{"rendered":"Using grep to play a game"},"content":{"rendered":"
\r\n
\r\n \r\n <\/i>\r\n <\/a>\r\n <\/span>\r\n<\/div><\/div>\n

Sometimes I just need to take a break in my work and let my mind relax. And a great way to spend that time is with a word game or word puzzle.<\/p>\n\n\n\n

One word game that was quite popular for a time was Wordle<\/a>, now hosted at the New York Times<\/em>. I wrote about that a year ago, about how to use grep to solve Wordle<\/a> and similar word-guessing puzzles. With a few passes of the grep<\/strong> command, you can quickly narrow your word guesses from over fifteen thousand to just a few possible words.<\/p>\n\n\n\n

I recently discovered another, similar word-guessing puzzle called Wordiply<\/a>, from The Guardian<\/em>. In Wordiply, you have five guesses to write the longest word that includes another, shorter word<\/em>.<\/p>\n\n\n\n

\"text<\/figure>\n\n\n\n

Strings and substrings<\/h2>\n\n\n\n

For example, the “warmup” game starts with “her,” so you need to guess words that have “her” in it, such as somewher<\/strong>e or ther<\/strong>efore.<\/p>\n\n\n\n

\"a<\/figure>\n\n\n\n

This is another example where grep<\/strong> can shine. Let’s use grep<\/strong> to pick long words with this shorter word inside it. The technical terms that I’ll use here are string<\/em> and substring<\/em>: the longer word is the string<\/em> and the shorter word within it is the substring<\/em>.<\/p>\n\n\n\n

First, let’s make a list of all possible words that we can use. Linux stores a list of known words in a file called \/usr\/share\/dict\/words<\/code>, but this list contains “non-words” that we don’t want to use. For example, that list has proper nouns like Minnesota, people names like Aaron, acronyms like USB, and other words that contain hyphens or other punctuation symbols. These words will not be recognized by Wordiply, so we should start with a list of words that we can use.<\/p>\n\n\n\n

The grep<\/strong> command uses regular expressions<\/em> to match text. Certain symbols have special meaning, like ^<\/code> to match the beginning of a line<\/em>, $<\/code> for the end of a line<\/em>, or *<\/code> to mean zero or more of the character before it<\/em>. Refer to the grep manual<\/a> for a full list of the regular expressions you can use.<\/p>\n\n\n\n

In this case, we want to find words that contain only lowercase letters, and nothing else. As a regular expression, we can represent that as ^<\/code> for the beginning of a line<\/em>, then [a-z]<\/code> to match any lowercase letter, followed by *<\/code> to make that multiple lowercase letters<\/em>, and finally $<\/code> to match the end of a line<\/em>. That command matches over 355,000 words:<\/p>\n\n\n\n

$ grep '^[a-z]*$' \/usr\/share\/dict\/words > allwords\n\n$ wc -l allwords\n355537 allwords<\/code><\/pre>\n\n\n\n
The game starts with “her” as the “inner” word, so we can use that as the substring to match. This is a simple grep<\/strong> command to find the substring “her” in the list of all words. This reduces the list to just over 4,300 possible words that contain the substring “her,” including abolisher<\/strong> and whither<\/strong>:<\/p>\n\n\n\n
$ grep her allwords > herwords\n\n$ wc -l herwords\n4304 herwords<\/code><\/pre>\n\n\n\n
The longest words<\/h2>\n\n\n\n
The list is in alphabetical order, because that’s how the \/usr\/share\/dict\/words<\/code> file started out. The new list has long words and short words mixed together. But the point of the game is to find the longest words that contain “her.”<\/p>\n\n\n\n
Let’s take the next step with another classic Unix command called awk<\/strong> to print the length of each word in the list. The awk<\/strong> language is actually a mini-scripting language, with each instruction as “condition {instruction}” pairs. The condition might be a variable comparison like a==z<\/code> for when the a<\/em> variable is equal to the z<\/em> variable, or i>2<\/code> for when the variable i<\/em> is greater than 2, or it could be a regular expression like \/^abc\/<\/code> to match lines that start with the letters “abc.” The instruction always goes inside { }<\/code> curled braces.<\/p>\n\n\n\n
Without a condition, awk<\/strong> will run the instruction for every<\/em> line in the file, which happens to be what we want. To add the length of each word, we can use the length<\/code> function in awk<\/strong>, which is the length of a word or line. We’ll also print the word itself at the end, so we can use it later.<\/p>\n\n\n\n
$ awk '{print length($1), $1}' herwords > herwords.n<\/code><\/pre>\n\n\n\n
This produces a list in herwords.n<\/code> that has the word’s length, then a space, followed by the word itself. The first 10 entries look like this:<\/p>\n\n\n\n
$ head herwords.n\n9 abolisher\n10 abolishers\n12 accomplisher\n13 accomplishers\n10 acerathere\n5 acher\n7 acheron\n10 acheronian\n10 acherontic\n11 acidanthera<\/code><\/pre>\n\n\n\n
But to find the longest words, we need to sort this list according to length. The sort<\/strong> command will do just that; sort<\/strong> is another classic Unix command. On Linux, you can add -n<\/code> to sort as numbers, which will sort the list according to the number up front. Adding the -r<\/code> option will reverse the sort, so the biggest numbers (longest words) will appear at the top of the list.<\/p>\n\n\n\n
To make the list easy to view, let’s send the output to the less<\/strong> command, which is the standard file viewer on Linux:<\/p>\n\n\n\n
$ sort -nr herwords.n | less<\/code><\/pre>\n\n\n\n
\"a<\/figure>\n\n\n\n
All that’s left is to scroll through the list of words and guess words that we think<\/em> will be in the Wordiply dictionary. For example, magnetother<\/strong>moelectricity is not recognized by Wordiply, but crystallographer<\/strong>s is.<\/p>\n\n\n\n
\"trying<\/figure>\n\n\n\n
\"entering<\/figure>\n\n\n\n
After that, it’s a matter of scrolling up and down the list to find similarly long words, and making guesses for words that are likely to be in Wordiply’s dictionary.<\/p>\n\n\n\n
Maybe it’s cheating, but it’s also an excellent demonstration of how to use grep<\/strong> and other Linux commands to solve real-world problems. In this case, grep<\/strong>, awk<\/strong>, and sort<\/strong> did the job to find very long words, narrowing the list of possible words from over 355,000 to about 4,300 words, and presenting the list in a way that we can use.<\/p>\n","protected":false},"excerpt":{"rendered":"
Use grep to help you solve word puzzle games<\/p>\n","protected":false},"author":33,"featured_media":14127,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_lmt_disableupdate":"","_lmt_disable":"","footnotes":"","_members_access_role":[],"_members_access_error":""},"categories":[100,69,5],"tags":[104,147,91],"class_list":["post-14448","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-command-line","category-fun","category-linux","tag-command-line","tag-fun","tag-linux"],"modified_by":"Jim Hall","_links":{"self":[{"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts\/14448","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/users\/33"}],"replies":[{"embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=14448"}],"version-history":[{"count":5,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts\/14448\/revisions"}],"predecessor-version":[{"id":14506,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/posts\/14448\/revisions\/14506"}],"wp:featuredmedia":[{"embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=\/wp\/v2\/media\/14127"}],"wp:attachment":[{"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=14448"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=14448"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.both.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=14448"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}