Python Anagram Algorithm

import numpy as np
import string

WORDLIST = string.ascii_lowercase + " "


def prime(i, primes):
    for prime in primes:
        if not (i == prime or i % prime):
            return False
    primes.add(i)
    return i


primes = set([2])
ii, ip = 2, 0
while True:
    if prime(ii, primes):
        ip += 1
        if ip == len(WORDLIST):
            break
    ii += 1

mapping = {}
for i in WORDLIST:
    mapping.update({i: primes.pop()})
print(mapping)

word_a = "Edward Daniels".lower()
word_b = "Andrew Laeddis".lower()
factor_a = np.array([mapping[i] for i in word_a])
factor_b = np.array([mapping[i] for i in word_b])

if np.prod(factor_a) == np.prod(factor_b):
    print("Words are anagrams!")
else:
    print("Nope, they're not.")