barbells 8
maximals 8
pasterns 8
reposers 8

aa 2
aah 3
aal 3
aba 3
aby 3
abye 4
abyes 5
adzes 5
aided 5
aider 5
aiders 6
amides 6
ananas 6
aniler 6
anises 6
annals 6
annats 6
annoys 6
antara 6
antick 6
antics 6
areads 6
aredes 6
aretts 6
bandar 6
bandars 7
banians 7
barbels 7
barbers 7
barbets 7
bassets 7
basters 7
bathers 7
bedells 7
bingers 7
bittern 7
bitterns 8

tangiest 8

$ wc -l ~/enable1.txt
172823

ws = open('../enable1.txt').read().split()
sw = set(ws)

msc = 1
for w in ws:
    if all(w[:i] in sw for i in range(2, len(w))):
        sc = len(w)
        if sc >= msc:
            msc = sc
            print(w, len(w))

const words = require("./wordList.js");

console.log("words loaded");

const range = (x, y) => {
    let v = [];
    let min = x;
    let max = y;
    if(x >= y){
        min = y + 1;
        max = x + 1;
    }
    for(let i = min; i < max; i++){
        v.push(i);
    }
    return v;
}

let has = (word) => words.indexOf(word) >= 0;
let p = (word) => range(2, word.length + 1).map(i => word.slice(0, i)).every(has);

let l = words.length;
let m = 0;
let mx = null;
for(let i = 0; i < l; i++){
    let e = words[i];

curl -sL bit.ly/10hA8iC | bash

'''Find longest word for which every prefix of length >= 2 is a word.'''

def all_prefixes(w):
    for length in range(len(w)-1, 1, -1):
        prefix = w[:length]
        if not prefix in word_set:
            return False
    return True

with open('ENABLE2K-word-list.txt') as word_file:
              word_list = [word[:-1] for word in word_file]

word_list.sort(key=len, reverse=True)
word_set = set(word_list)

current_length = 1000
for word in word_list:
    l = len(word)
    if l < current_length:

Definitions of ES in dictionaries:

        noun - a radioactive transuranic element produced by bombarding plutonium with neutrons
        noun - the letter S