| 1 | package main |
| 2 | |
| 3 | import ( |
| 4 | "math/rand" |
| 5 | "os" |
| 6 | "strings" |
| 7 | "sync" |
| 8 | ) |
| 9 | |
| 10 | type MarkovChain struct { |
| 11 | chain map[string][]string |
| 12 | words []string |
| 13 | keys []string |
| 14 | } |
| 15 | |
| 16 | var sharedBabbler = sync.OnceValue(NewBabbler) |
| 17 | |
| 18 | func NewBabbler() *MarkovChain { |
| 19 | text, err := os.ReadFile(sourceText) |
| 20 | if err != nil { |
| 21 | fatal("could not read source text for babbler", "path", sourceText, "err", err) |
| 22 | } |
| 23 | fields := strings.Fields(string(text)) |
| 24 | |
| 25 | chain := make(map[string][]string) |
| 26 | for i := 0; i < len(fields)-1; i++ { |
| 27 | chain[fields[i]] = append(chain[fields[i]], fields[i+1]) |
| 28 | } |
| 29 | |
| 30 | seen := make(map[string]struct{}) |
| 31 | words := make([]string, 0, len(chain)) |
| 32 | for _, field := range fields { |
| 33 | slug := Slugify(field) |
| 34 | if slug == "" { |
| 35 | continue |
| 36 | } |
| 37 | if _, dup := seen[slug]; dup { |
| 38 | continue |
| 39 | } |
| 40 | seen[slug] = struct{}{} |
| 41 | words = append(words, slug) |
| 42 | } |
| 43 | |
| 44 | keys := make([]string, 0, len(chain)) |
| 45 | for k := range chain { |
| 46 | keys = append(keys, k) |
| 47 | } |
| 48 | |
| 49 | logger.Debug("babbler corpus loaded", |
| 50 | "path", sourceText, |
| 51 | "words", len(fields), |
| 52 | "unique_words", len(words), |
| 53 | "chain_entries", len(chain), |
| 54 | ) |
| 55 | |
| 56 | return &MarkovChain{chain: chain, words: words, keys: keys} |
| 57 | } |
| 58 | |
| 59 | func (m *MarkovChain) Generate(maxWords int) string { |
| 60 | if len(m.keys) == 0 { |
| 61 | return "" |
| 62 | } |
| 63 | |
| 64 | word := m.keys[rand.Intn(len(m.keys))] |
| 65 | |
| 66 | var result []string |
| 67 | result = append(result, word) |
| 68 | |
| 69 | for i := 1; i < maxWords; i++ { |
| 70 | next, ok := m.chain[word] |
| 71 | if !ok || len(next) == 0 { |
| 72 | break |
| 73 | } |
| 74 | word = next[rand.Intn(len(next))] |
| 75 | result = append(result, word) |
| 76 | } |
| 77 | |
| 78 | return strings.Join(result, " ") |
| 79 | } |
| 80 | |
| 81 | func (m *MarkovChain) Links(n int) []string { |
| 82 | if len(m.words) == 0 { |
| 83 | return nil |
| 84 | } |
| 85 | if n > len(m.words) { |
| 86 | n = len(m.words) |
| 87 | } |
| 88 | |
| 89 | seen := make(map[string]struct{}, n) |
| 90 | links := make([]string, 0, n) |
| 91 | for len(links) < n { |
| 92 | link := m.randomLink() |
| 93 | if _, dup := seen[link]; dup { |
| 94 | continue |
| 95 | } |
| 96 | seen[link] = struct{}{} |
| 97 | links = append(links, link) |
| 98 | } |
| 99 | return links |
| 100 | } |
| 101 | |
| 102 | func (m *MarkovChain) randomLink() string { |
| 103 | first := m.words[rand.Intn(len(m.words))] |
| 104 | second := m.words[rand.Intn(len(m.words))] |
| 105 | return first + "/" + second |
| 106 | } |