-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathnames.py
111 lines (98 loc) · 3.51 KB
/
names.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
import random, os, sys
cmd_folder = os.path.dirname(os.path.abspath(__file__))
def get_wordlist(type):
file = open(os.path.join(cmd_folder, type+'.txt'), 'r')
list = file.readlines()
file.close()
return list
positive_adjectives = get_wordlist('positive_adjectives')
bad_words = get_wordlist('bad_words')
male_names = get_wordlist('male_names')
female_names = get_wordlist('female_names')
last_names = get_wordlist('last_names')
###############################################################################
# Markov Name model
# A random name generator, by Peter Corbett
# http://www.pick.ucam.org/~ptc24/mchain.html
# This script is hereby entered into the public domain
###############################################################################
class Mdict:
def __init__(self):
self.d = {}
def __getitem__(self, key):
if key in self.d:
return self.d[key]
else:
raise KeyError(key)
def add_key(self, prefix, suffix):
if prefix in self.d:
self.d[prefix].append(suffix)
else:
self.d[prefix] = [suffix]
def get_suffix(self,prefix):
l = self[prefix]
return random.choice(l)
class MName:
"""
A name from a Markov chain
"""
def __init__(self, source, chainlen = 2, maxlen = 9):
"""
Building the dictionary
"""
if chainlen > 10 or chainlen < 1:
raise ValueError("Chain length must be between 1 and 10, inclusive (you provided %s)", chainlen)
self.mcd = Mdict()
oldnames = []
self.chainlen = chainlen
self.maxlen = maxlen
for l in source:
l = l.strip()
oldnames.append(l)
s = " " * chainlen + l
for n in range(0,len(l)):
self.mcd.add_key(s[n:n+chainlen], s[n+chainlen])
self.mcd.add_key(s[len(l):len(l)+chainlen], "\n")
def New(self, maxlen=None):
"""
New name from the Markov chain
"""
if maxlen is None:
maxlen = self.maxlen
prefix = " " * self.chainlen
name = ""
suffix = ""
while True:
suffix = self.mcd.get_suffix(prefix)
if len(name) > maxlen:
break
elif suffix == "\n":
break
else:
name = name + suffix
prefix = prefix[1:] + suffix
return name.capitalize()
generators = {
'male': MName(positive_adjectives + male_names),
'female': MName(positive_adjectives + female_names),
'androgynous': MName(positive_adjectives + male_names + female_names),
'asexual': MName(positive_adjectives),
'surname': MName(positive_adjectives + last_names),
'badmale': MName(bad_words + male_names),
'badfemale': MName(bad_words + female_names),
'badandrogynous': MName(bad_words + male_names + female_names),
'badasexual': MName(bad_words),
'badsurname': MName(bad_words + last_names),
}
generators['surname'].maxlen = 15
def supported_types():
return generators.keys() + ['random']
def get(type):
if type == 'random':
type = random.choice(generators.keys())
if type not in generators.keys():
raise NotImplementedError('Unsupported name type: %s' % type)
return generators[type].New()
if __name__ == '__main__':
for i in xrange(10):
print get(sys.argv[1]), get(sys.argv[2])