summaryrefslogtreecommitdiff
path: root/research/entropy/experiment.go
blob: b5efad9761cabd6dc9b60b1f04808a4c8e61ba0c (plain)
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
package entropy

import (
	"cmp"
	"database/sql"
	"encoding/gob"
	"os"
	"time"

	"github.com/jonasknobloch/mbpe"

	"go.jknobloc.com/x/dict"
	"go.jknobloc.com/x/shelf"
	"go.jknobloc.com/x/tui"
)

type segmentsEntry struct {
	Value []string
	OK    bool
}

const BufferSize = 1024

func Run(db *sql.DB, d *dict.Dict[*Entry]) error {
	// m := 0
	//
	// for _, v := range d.Values() {
	// 	m = max(m, len(v.TokenIDs))
	// }
	//
	// if m > BufferSize {
	// 	// TODO handle
	// }

	var rows *sql.Rows

	if r, err := db.Query(`SELECT * FROM context`); err != nil {
		return err
	} else {
		rows = r
	}

	defer rows.Close()

	bufferTokens := make([]uint8, 0, BufferSize)
	bufferLogProbs := make([]float32, 0, BufferSize)

	doc := -1

	maxTokens := 100000
	currentTokens := 0

	pb := tui.NewProgressBar("Adding LogProbs", 20, 58508191, time.Now())

	pb.Start(1*time.Second, func() int {
		return pb.Completed()
	})

	for rows.Next() {
		if currentTokens == maxTokens {
			break
		}

		currentTokens++

		var uid int
		var token int
		var logProb float32
		var pos int

		if err := rows.Scan(&uid, &token, &logProb, &pos); err != nil {
			return err
		}

		if uid != doc || len(bufferTokens) == BufferSize {
			bufferTokens = bufferTokens[:0]
			bufferLogProbs = bufferLogProbs[:0]

			doc = uid
		}

		bufferTokens = append(bufferTokens, uint8(token))
		bufferLogProbs = append(bufferLogProbs, logProb)

		n := len(bufferTokens)

		// fmt.Print(n)

		for i := range n {
			entry, ok := d.GetBytes(bufferTokens[i:n])

			if !ok {
				continue
			}

			for j := range entry.LogProbs {
				entry.LogProbs[j] += bufferLogProbs[j]
			}

			entry.N++
		}

		pb.Add(1)
	}

	if err := rows.Err(); err != nil {
		return err
	}

	// debug
	d.Sort(func(a, b dict.Entry[*Entry]) int {
		return cmp.Compare(b.Val.N, a.Val.N)
	})

	pb.Close()

	for _, e := range d.Values() {
		spikes(e)
	}

	if err := serializeSegments(d); err != nil {
		return err
	}

	return nil
}

func spikes(e *Entry) {
	for i := range len(e.LogProbs) {
		if i == 0 {
			continue
		}

		if i == 1 && e.TokenIDs[0] == 220 {
			continue
		}

		// TODO threshold

		if d := e.LogProbs[i-1] - e.LogProbs[i]; d > 0 {
			e.Bounds[i] = true
		}
	}
}

func serializeSegments(d *dict.Dict[*Entry]) error {
	r := make(map[string]segmentsEntry, d.Len())

	for _, e := range d.Values() {
		segments := make([]string, 0)

		decoded := decode(e.Encoded)

		i := 0

		for j, b := range e.Bounds {
			if b {
				segments = append(segments, encode(decoded[i:j]))

				i = j
			}
		}

		segments = append(segments, encode(decoded[i:])) // TODO or just use OK false?

		// debug
		if i == 0 {
			continue
		}

		r[e.Encoded] = segmentsEntry{
			Value: segments,
			OK:    true,
		}
	}

	var file *os.File

	if f, err := os.Create(shelf.Abs("results/entropy/minipile/segments.gob")); err != nil {
		return err
	} else {
		file = f
	}

	defer file.Close()

	enc := gob.NewEncoder(file)

	return enc.Encode(r)
}

func encode(s string) string {
	result := ""

	for _, b := range []byte(s) {
		result += mbpe.BytesChar[b]
	}

	return result
}

func decode(s string) string {
	result := make([]byte, 0)

	for _, r := range s {
		result = append(result, mbpe.CharBytes[string(r)])
	}

	return string(result)
}