Thorough though Thoreau threw, Troll throws through tough troughs To each of these nine confusingly similar words, assign a number 1-9 in any way you like:
though
through
thorough
Thoreau
throw
threw
trough
tough
troll

Write a program that takes in a string. If the input is one of these nine words, output the number you assigned to it. If the input is not one of the words above, the program may do anything (including error or loop forever).
The words are case sensitive, e.g. Thoreau, should produce a number from 1-9 but thoreau will not necessarily do the same.
Example
Suppose you assign the numbers as follows:
though   9
through  2
thorough 7
Thoreau  6
throw    3
threw    5
trough   4
tough    1
troll    8

Then when tough is input, 1 should be output.
When through is input, 2 should be output.
When throw is input, 3 should be output.
. . .
When though is input, 9 should be output.
All other inputs may do anything.
Details

Take the input string via stdin or the command line and output to stdout.
The output may contain a single trailing newline.
Instead of a program, you may write a function that takes in a string and prints the result normally or returns it.
The shortest submission in bytes wins.
CJam, 11 9 7 bytes

q1b2+B%


How it works:

We are making use of the fact that the sum of the ASCII codes + 2 moded with 11 gives very nice order of 1 through 9 and then 10 for the nine concerned words. Here is the ordering:

through -&gt; 1
thorough -&gt; 2 
tough -&gt; 3 
Thoreau -&gt; 4 
throw -&gt; 5 
threw -&gt; 6 
trough -&gt; 7 
though -&gt; 8 
troll -&gt; 9


Code explanation:

q               e# Read the input
 1b             e# Sum the ASCII code values of all characters in this word
   2+           e# Increment the sum by 2
     B%         e# Mod by 11 and automatically print the mod result at the end


4 bytes saved thanks to user23013

Try it online here