What dictionary items can go into others

Question

I am writing a python script, that looks like this so far:

import sys
fname = sys.argv[1]
letters = str.lower(sys.argv[2])
letaray = list(letters)
charcount = int(letters.count("")) - 1
lines = tuple(open(fname, 'r'))
wordlist = map(str.lower,open(fname).read().splitlines())
scores = {"a": 1, "c": 3, "b": 3, "e": 1, "d": 2, "g": 2, "f": 4, "i": 1, "h": 4, "k": 5, "j": 8, "m": 3, "l": 1, "o": 1, "n": 1, "q": 10, "p": 3, "s": 1, "r": 1, "u": 1, "t": 1, "w": 4, "v": 4, "y": 4, "x": 8, "z": 10}
# char count
if charcount != 7:
    print "Not 7 characters"
    exit()
def file_len(fname):
    with open(fname) as f:
        for i, l in enumerate(f):
            pass
    return i + 1
file_len(fname)

The program is ran by:

python main.py wordlist.txt XXXXXXX

Where X is whatever the letters for the scrabble board for example: AGJBTGE.

These letters are then parsed into an array like so:

['a', 'g', 'j', 'b', 't', 'g', 'e']

The textfile is then thrown line-by-line into the variable wordlist.

How can I create another list with all the possible combos of words that can be made from the letters? for example: age, jab etc.

Note: is there is only 1 G, then only 1 G can be used, if there are 2 G's, only 2 can be used, and so on. I may have not provided everything needed, please let me know.

Answer 1

In order to do this you need a corpora of words and a function to compare whether a given list of characters is contained in another list of characters.

Since Testing if a list contains another list with Python already exists on S.O I won't be answering that, but, I will give you some help with getting and processing some words.

You can find a list of words in many places on the web (and on your machine if you're using Unix) or you can use some of your own (like wordlist.txt which you have) and the following function should work on any newline seperated file.

For this demo I'm using /usr/share/dict/british-english as the file containing the words:

# enter the file name you want to use e.x wordlist.txt
filename = "/usr/share/dict/british-english"

Since these files are usually large, you can use this generator function to yield words which you can then process (don't worry about what generators are, just use them for now :-) ):

def yield_words():
    with open(filename, "r") as f:
        for word in f:
            yield word

So, let say you have a list of characters:

l = list("HelloWorld")

You can then iterate through this generator and for each word compare and evaluate if the word word is contained in l:

valid_words = []
for word in yield_words():
    # define a contains function
    # that returns True if l contains word
    if contains(l, word):
        valid_words.append(word)

This should be a good starting point, and as much as I'm willing to assist, use the links I added to find a good set of (additional) words to use and a function with which you can compare the lists, then you're set to go.

Answer 2

from itertools import permutations

string ='AGJBTGE'

string = string.lower()

for r in range(1,len(string)+1):
    for word in permutations(string,r):
        print(''.join(word))

r is a option input for permutations function which define the length of output.
you could add if statement to check the word.

Answer 3

You can use combinations from itertools and then using chain to club all of them to a single list

In [1]: from itertools import combinations, chain

In [2]: word = "AGJBTGE"

In [3]: word_combos = [list(combinations(word, r)) for r in range(1, len(word)+1)]

In [4]: word_combos_chained = [''.join(wl) for wl in list(chain(*word_combos))]

In [5]: word_combos_chained[25:35]
Out[5]: ['TG', 'TE', 'GE', 'AGJ', 'AGB', 'AGT', 'AGG', 'AGE', 'AJB', 'AJT']