You are here


4 September, 2015 - 15:17

Exercise 11.9.If you did Exercise 10.8 in Exercises, you already have a function named has_duplicatesthat takes a list as a parameter and returns True if there is any object that appears more than once in the list.

Use a dictionary to write a faster, simpler version of has_duplicates. Solution:

Exercise 11.10.Two words are “rotate pairs” if you can rotate one of them and get the other (see rotate_wordin Exercise 8.12 in Exercises).

Write a program that reads a wordlist and ndsall the rotate pairs. Solution:

Exercise 11.11.Here’s another Puzzler from Car Talk (

This was sent in by a fellow named Dan O’Leary. He came upon a common one-syllable, ve-letter word recently that has the following unique property. When you remove the rst letter, the remaining letters form a homophone of the original word, that is a word that sounds exactly the same. Replace the rst letter, that is, put it back and remove the second letter and the result is yet another homophone of the original word. And the question is, what’s the word?

Now I’m going to give you an example that doesn’t work. Lets look at the ve-letter word, ‘wrack.’ W-R-A-C-K, you know like to ‘wrack with pain.’ If I remove the rst letter, I am left with a four-letter word, ’R-A-C-K.’ As in, ‘Holy cow, did you see the rack on that buck! It must have been a nine-pointer!’ It’s a perfect homophone. If you put the ‘w’ back, and remove the ‘r,’ instead, you’re left with the word, wack,’ which is a real word, it’s just not a homophone of the other two words.

But there is, however, at least one word that Dan and we know of, which will yield two homophones if you remove either of the rst two letters to make two, new four-letter words. The question is, what’s the word?

You can use the dictionary from Exercise 11.1 in Dictionaries to check whether a string is in the word list.

To check whether two words are homophones, you can use the CMU Pronouncing Dictionary. You can download it from or from and you can also download , which provides a function named read_dictionary that reads the pronouncing dictionary and returns a Python dictionary that maps from each word to a string that describes its primary pronunciation.

Write a program that lists all the words that solve the Puzzler. Solution: