# Need nine-letter words...

**URL:** <https://boards.straightdope.com/t/need-nine-letter-words/683029>\
**Category:** Factual Questions\
**Created:** [March 6, 2014, 6:00pm UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029 "2014-03-06T18:00:55Z")\
**Posts on this page:** 6\
**Page:** 1

<div class="post-metadata">

**Author:** ![Lumpy](https://sea3.discourse-cdn.com/straightdope/user_avatar/boards.straightdope.com/lumpy/32/446_2.png) [@Lumpy](https://boards.straightdope.com/u/Lumpy)\
**Post date:** [March 6, 2014, 6:00pm UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029/1 "2014-03-06T18:00:55Z")

</div>

That have each letter only once. (Yeah, it’s Sudoku with letters). I can find plenty of lists of nine-letter words but I don’t know if there’s any way to find the each-letter-once ones.

---

<div class="post-metadata">

**Author:** ![pulykamell](https://sea3.discourse-cdn.com/straightdope/user_avatar/boards.straightdope.com/pulykamell/32/3166_2.png) [@pulykamell](https://boards.straightdope.com/u/pulykamell)\
**Post date:** [March 6, 2014, 6:25pm UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029/2 "2014-03-06T18:25:18Z")

</div>

The term for this type of word is “isogram.” It shouldn’t be too hard to write up a script to do it, but check around to see if you can find anything first. (Sorry, I’m on my phone surfing, not in front of a computer where I could try to whip something up quickly.)

---

<div class="post-metadata">

**Author:** ![cjepson](https://avatars.discourse-cdn.com/v4/letter/c/a9adbd/32.png) [@cjepson](https://boards.straightdope.com/u/cjepson)\
**Post date:** [March 6, 2014, 6:51pm UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029/3 "2014-03-06T18:51:44Z")

</div>

resulting  
exporting  
complaint, compliant  
comprised  
sparingly

---

<div class="post-metadata">

**Author:** ![pulykamell](https://sea3.discourse-cdn.com/straightdope/user_avatar/boards.straightdope.com/pulykamell/32/3166_2.png) [@pulykamell](https://boards.straightdope.com/u/pulykamell)\
**Post date:** [March 6, 2014, 6:56pm UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029/4 "2014-03-06T18:56:08Z")

</div>

OK, unless I did something wrong, [here’s a list I compiled](http://www.pawinskiphotography.com/public/9letter.txt) using the built-in word list on my computer and a few lines of code.

---

<div class="post-metadata">

**Author:** ![pulykamell](https://sea3.discourse-cdn.com/straightdope/user_avatar/boards.straightdope.com/pulykamell/32/3166_2.png) [@pulykamell](https://boards.straightdope.com/u/pulykamell)\
**Post date:** [March 6, 2014, 7:10pm UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029/5 "2014-03-06T19:10:59Z")

</div>

And in case anyone wants to review the code (and I’m only a hobbyist, so there most likely is a much more obvious way to do this), here’s the Python code (after grepping the 9-letter words out of the dictionary into a file called “9letters.txt”)

```auto

from collections import OrderedDict

f = open('9letters.txt','r')
for word in f:
  word = word.lower().rstrip()                  
  word2 = "".join(OrderedDict.fromkeys(word))    
  if word == word2:                                         
    print word

```

In other words, I’m comparing the original string to a string that preserves the letter order but only includes one instance of each letter. So if word is “apathetic,” word2 becomes “apthic”, and, since they don’t match, word must contain repeating letters.

---

<div class="post-metadata">

**Author:** ![Lumpy](https://sea3.discourse-cdn.com/straightdope/user_avatar/boards.straightdope.com/lumpy/32/446_2.png) [@Lumpy](https://boards.straightdope.com/u/Lumpy)\
**Post date:** [March 7, 2014, 12:11am UTC](https://boards.straightdope.com/t/need-nine-letter-words/683029/6 "2014-03-07T00:11:42Z")

</div>

Yeah, “isogram” in search does the trick. Thanks!
