Fun and Games with the English Language
From now on, ending a sentence with a preposition is something up with which I will not put.
— Winston Churchill

Fun and Games with the English Language

Dr. Phillip M. Feldman


0. Introduction

The English language seems to add new words, and new meanings for existing words, on an almost daily basis. Readers who are sober will probably agree with me that things have gotten out of hand. But, this proliferation of words and meanings can be a source of entertainment.

This portion of my website is divided into sections as follows:

  1. Humor
  2. Word Trivia (Questions/Puzzles and Lists)
  3. Solving Word Puzzles via Computer: Resources
  4. Answers to Word Trivia Questions
  5. News Items

1. Laughing at the English Language and English Language Usage

English is a Crazy Language (essay by Richard Lederer)

When Political Correctness Goes Too Far


2. Word Trivia

2.1 Word Trivia—Questions/Puzzles

Answers to these questions appear at the end of this page.

  1. Unscramble the letters foovillfee to make an intelligible three-word phrase.

  2. There are four English adjectives—one of these is also a noun—that have related verb forms such that an i in the adjectival form changes to an e in the verb form. The most obscure of the four is tepid tepefy, where tepefy means to make tepid. What are the other three?

  3. What is the most common three-letter prefix in the English dictionary?

  4. Starting with the word cent, add a two-letter prefix and a two-letter suffix such that the resulting 8-letter word can be viewed as a grammatical derivative of either of two different 6-letter words. The 8-letter word has two entirely different meanings, one having to do with a relationship in time, and the other involving a change of location.

  5. Rearrange the letters of the word partisan to form the single anagram of that word.

  6. How many five-letter English words contain exactly four vowels? Identify as many as you can. (Assume that the letter y counts as a consonant when it appears at the start of the word, and as a vowel in any other position). Note: If you are working on this question without using a computer and find at least eight valid words, your answer gets full credit.

  7. How many palindromic English words are there having at least four letters? Identify as many as you can. (A palindromic word is one that reads the same forwards and backwards). Note: If you are working on this question without using a computer and find at least ten valid words, your answer gets full credit.

  8. Find all English words that contain at least one m, at least one n, and any number of a's, i's, and o's.

  9. Find all English words that contain exactly one n, exactly two t's, and at most one of each vowel letter.

2.2 Word Trivia—Lists

Contributions to the following list of English homophones (and to the other lists) are welcome. Anyone who contributes 20 or more valid homophones will have his/her name added to the list of contributors at the top of the file. (Your homophones must meet the criteria specified at the top of the file).

List of English homophones

False antonyms (pseudoantonyms) are pairs of words that give the misleading impression that they have opposite meanings, usually because of the prefixes, but occasionally because of the absence of a prefix on one of the two or because of a suffix on one. Likewise, false synonyms (pseudosynonyms) are pairs of words that give the misleading impression that they have the same or at least similar meanings. I started collecting false antonyms in the late 1990's, possibly inspired by Richard Lederer's famous quip, If pro and con are opposites, is congress the opposite of progress?

False Antonyms (Pseudoantonyms) and False Synonyms (Pseudosynonyms)

List of exceptions to the i-before-e Rule


3. Solving Word Puzzles via Computer: Resources

3.1 Introduction

There is an enormous variety of types of word puzzles; someone is probably inventing a new type of word puzzle as you read this. I've focused my efforts in the area of word puzzle solvers primarily on three types of word puzzles:

  1. Anagrams: The goal of these puzzles is to arrange given letters to form a word or sometimes a phrase.

  2. Letter frequency puzzles: Information is provided about the number of times each distinct letter appears in a word; frequencies may be provided for specific letters, unnamed letters, or a combination of the two. The goal is to find a word or all words that satisfy the specified frequencies.

  3. Word pattern puzzles: Information is provided about the pattern of letters appearing in a word, e.g., the letters in specific locations may be identified, or one may be told that the word consists of a sequence of alternating vowels and consonants. The goal is to find a word or all words that match the specified pattern. Hangman can be considered a form of word pattern puzzle in which information is provided incrementally as the player guesses letters.

Many word puzzles are best solved by writing a small computer program, and there are many word games for which a program can be written to advise a player. Prime examples are anagrams, Boggle, hangman, and Scrabble. Such programs are typically written using Python (or Perl, for those programmers who do not yet appreciate the overwhelming superiority of Python). For an introduction to the Python programming language, see my Python Language Resources page. As time allows, I will add more downloadable Python scripts.

If you are developing your own scripts for solving word puzzles and need advice, or would like to have one of your scripts posted on this page, send me e-mail: webmaster@phillipmfeldman.org. Any scripts submitted for posting should be thoroughly documented and reasonably bug-free.

3.2 English Spelling Dictionaries (and How to Use Them in Python)

English Spelling Dictionaries

3.3 Anagrams

Anagrams          

3.4 Boggle

Boggle is a popular word game played with 16 dice labeled with one letter of the alphabet on each side. (Because the letter q is almost always followed by u in English, one face of one of the Boggle dice is labeled with qu). The dice are shaken and dropped randomly into a four-by-four grid so that only the letters on the top faces are visible. The objective is to find sequences of adjacent letters (horizontally, vertically, or diagonally adjacent) that form English words. Boggle can be an excellent vehicle for helping children to learn new words.

The Python program Boggle.py is a Boggle solver, i.e., it finds all words on the specified Boggle board. The sequence of letters may be specified via the command line. If it is not specified via the command line, the program prompts the user to specify the sequence of letters. Starting with code written by Scott Hillman, I made the following changes:

Download Boggle.py

If you do not have a Python interpreter on your computer and don't want to install one, you can run the Boggle solver online (i.e., on the server) by entering the configuration of the board into the form below, selecting one of the two spelling dictionaries, and then clicking on the button below the form. Note:

   

Small spelling dictionary Large spelling dictionary

Minimum word length:

Calculating the probability that a specified word appears on a random Boggle board is an interesting mathematical exercise. (One could estimate this probability via simulation).

3.5 Common Word Prefixes

Common word prefixes

3.6 Hangman Advisor

The Hangman Advisor provides advice to someone who is trying to guess the hidden word in Hangman. It analyzes the template and recommends the next letter to be guessed, using four different algorithms.

Hangman Advisor

3.7 Letter Frequency Puzzles

Letter Frequency Puzzles

3.8 Palindromic Words

The Python program palindromes.py finds all palindromic words having a specified minimum length. A palindromic word is one that reads the same forwards and backwards.

Download palindromes.py

3.9 Solving Word Puzzles via Regular Expression Matching

Solving Word Puzzles via Regular Expression Matching

3.10 Word Match

Word Match is a game for building vocabulary, loosely based on the game of hangman.

Word Match Solver and Game

4. Answers to Word Trivia Questions

  1. There are two reasonable answers: love of life and life of love. (I prefer the first answer). These can be found by running anagrams3.py.




  2. liquid liquefy, stupid stupefy, and putrid putrefy.




  3. The most common three-letter prefix in the English dictionary is either con or non, depending on which definition of prefix one applies. (See Common word prefixes above).




  4. By prepending re and appending er to cent, we obtain recenter, which can be understood as either recent-er (a relationship in time) or re-center (a change of location).




  5. The only anagram of partisan is aspirant.




  6. The large spelling dictionary contains 33 five-letter words each having exactly 4 vowels:

    'aalii', 'abaya', 'adieu', 'aecia', 'aerie', 'aioli', 'aliya', 'aquae', 'areae', 'audio', 'aurae', 'aurei', 'bayou', 'cooee', 'cooey', 'eerie', 'eyrie', 'gooey', 'hooey', 'looey', 'looie', 'louie', 'miaou', 'oidia', 'oorie', 'ourie', 'oxeye', 'payee', 'poyou', 'queue', 'sooey', 'uraei', 'zoeae'

    I obtained this answer by running the program vowels.py against the large spelling dictionary.




  7. There are 51 palindromic words of length 4 and greater:

    'abba', 'alula', 'anna', 'boob', 'civic', 'deed', 'deified', 'deked', 'deled', 'denned', 'dewed', 'halalah', 'hallah', 'kaiak', 'kayak', 'keek', 'kook', 'level', 'madam', 'marram', 'minim', 'naan', 'noon', 'otto', 'peep', 'poop', 'pullup', 'radar' , 'redder', 'refer', 'reifier', 'repaper', 'reviver', 'rotator', 'rotor', 'sagas', 'sees', 'selles', 'sememes', 'semes', 'seres', 'sexes', 'shahs', 'solos', 'stets', 'succus', 'sulus', 'tenet', 'terret', 'toot', 'torot'

    I obtained this answer by running the program palindromes.py against the large spelling dictionary.




  8. There are 22 solutions:

    'amain', 'amino', 'amnia', 'anima', 'animi', 'imino', 'main', 'man', 'mana', 'mania', 'mano', 'min', 'mina', 'mini', 'moan', 'mon', 'mono', 'moon', 'nim', 'nom', 'noma', 'nomoi'

    I found these by running hangman.py as follows and then deleting all results that did not contain both an m and an n:

       python hangman.py mnaaaaaiiiiiooooo
    



  9. There are 13 words that satisfy these conditions:

    'attune', 'nett', 'notate', 'nutate', 'taint', 'tanto', 'taunt', 'tauten', 'tent', 'tenuti', 'tenuto', 'tint', and 'titan'

    These can be found by running frequencies.py as follows:

       python frequencies.py n:1,t:2,a:?,e:?,i:?,o:?,u:?
    

5. News Items

29 March, 2014: I've ironed out bugs that were affecting the Hangman Advisor's depth-2 search. The results that it reports look reasonable, but I have not yet figured out a good way to validate that the code is working correctly.

22 March, 2014: I've implemented a preliminary version of the long-awaited Hangman Advisor (see above). This was not terribly difficult to write, but the code ended up being somewhat larger than anticipated.

11 August, 2013: I've more or less completed work on the Word Match game, adding hints for all of the puzzles, completing a major scrub of the template database, and fixing scoring. Over half of the puzzles make use of SAT- and GRE-level words in the hint text, the answer itself, or both.

2 May, 2013: While passing time in a doctor's office, I struck up an acquaintance with two siblings, ages 7 and 10. We started solving some word puzzles, and on one of them, they found a solution—the word toad—that the solver did not generate (because this word did not appear in the small spelling dictionary). It was explained to me that toad is a very important word: "There is a ride at Disneyland called Mr. Toad's Wild Ride". I updated the dictionary on the spot and demonstrated that the solver now produced the word toad. I cite this incident as evidence that I am responsive to my customers.

27 April 2013: After inching up for weeks, my page "Fun and Games with the English Language" reached Google rank #1 for the quoted search "solving word puzzles".


Last update: 22 Mar., 2014