Easily Typeable Words
Python 2 - 80, 68, 64, 61, 58, 50, 48, 45, 44 42

Even though it's getting a little ridiculous now, I'll keep on making use of free library imports, even the __builtin__ library:

from numpy import diff as D
from pprint import pprint as P
from __builtin__ import all as A
from __builtin__ import raw_input as I
from __builtin__ import bytearray as B


So only the following short line counts towards the code length:

P(A(D([(o-o/112-o/59)/3for o in B(I())])))


Credits to Markuz for the ideas regarding input()! These free-import challenges always introduce you to some lesser known libraries. ;)



Alternative using only the operator library (98, 83 79):

from operator import ne as n
K=[(ord(c)-1-(c&gt;'p')-(c&gt;'w'))/3for c in input()]
print all(map(n,K[1:],K[:-1]))


I'll stop here. But you could further golf this version using sys, pprint and other libraries...



Alternative without libraries (105):

s=input()
n=lambda c:(ord(c)-1-(c&gt;'p')-(c&gt;'w'))/3
print all([n(s[i])!=n(s[i+1])for i in range(len(s)-1)])