-
Notifications
You must be signed in to change notification settings - Fork 0
/
names.go
132 lines (110 loc) · 2.5 KB
/
names.go
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
package main
// Loose translation of "Nominal" Common Lisp repo
// https://github.com/eigenhombre/nominal/blob/master/src/main.lisp
import (
_ "embed"
"math/rand"
"sort"
"strings"
"golang.org/x/text/cases"
"golang.org/x/text/language"
)
//go:embed names.txt
var Names string
func nameList() []string {
return strings.Split(Names, "\n")
}
func tradName(r *rand.Rand) string {
return randNthString(r, nameList())
}
func singleName(r *rand.Rand) string {
if r.Intn(4) == 0 {
return nGramName(r)
}
return tradName(r)
}
func stringListNgrams(list []string, n int) []string {
ngrams := []string{}
for _, s := range list {
ngrams = append(ngrams, stringNgrams(s, n)...)
}
return ngrams
}
func stringNgrams(s string, n int) []string {
ngrams := []string{}
for i := 0; i < len(s)-n+1; i++ {
ngrams = append(ngrams, s[i:i+n])
}
return ngrams
}
func nGramFrequencies(nGrams []string) map[string]int {
freqs := map[string]int{}
for _, n := range nGrams {
freqs[n]++
}
return freqs
}
type pair struct {
key string
freq int
}
func sortedFrequencies(freqs map[string]int) []pair {
pairs := []pair{}
for k, v := range freqs {
pairs = append(pairs, pair{k, v})
}
sort.Slice(pairs, func(i, j int) bool {
return pairs[i].freq > pairs[j].freq
})
return pairs
}
var topNgramsGlobal []string = []string{}
func topNgrams(nGrams []string, n int) []string {
freqs := nGramFrequencies(nGrams)
pairs := sortedFrequencies(freqs)
top := []string{}
for i := 0; i < n; i++ {
if i >= len(pairs) {
break
}
top = append(top, pairs[i].key)
}
return top
}
func makeNgrams(corpus []string, n int) []string {
return topNgrams(stringListNgrams(corpus, n), 200)
}
func allNgrams(list []string) []string {
ngrams := []string{}
for n := 3; n < 5; n++ {
ngrams = append(ngrams, makeNgrams(list, n)...)
}
return ngrams
}
func nGramName(r *rand.Rand) string {
numgrams := r.Intn(r.Intn(4)+1) + 1
name := ""
for i := 0; i < numgrams; i++ {
name += randNthString(r, topNgramsGlobal)
}
return name
}
var c = cases.Title(language.English)
func capitalize(s string) string {
return c.String(s)
}
func fullNameAsList(r *rand.Rand) []string {
ns := []int{1, 2, 2, 2, 2, 2, 3, 3, 4, 5, 6}
numNames := ns[r.Intn(len(ns))]
names := []string{}
for i := 0; i < numNames; i++ {
names = append(names, capitalize(singleName(r)))
}
return names
}
func calculateTopNgrams() {
topNgramsGlobal = topNgrams(allNgrams(nameList()), 1000)
}
func fullName(r *rand.Rand) string {
return strings.Join(fullNameAsList(r), " ")
}