-
Notifications
You must be signed in to change notification settings - Fork 1
/
vocab.go
87 lines (74 loc) · 1.56 KB
/
vocab.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
package main
import (
"fmt"
"sort"
"log"
"bufio"
"os"
)
const minCount = 10
// Word is a struct holding the count of the word and the word itself
type Word struct {
Count uint64
Word string
}
// WordList is a list of words, and implements the sort interface
type WordList []Word
func (w WordList) Swap(i, j int) {
w[i], w[j] = w[j], w[i]
}
func (w WordList) Len() int {
return len(w)
}
func (w WordList) Less(i, j int) bool {
if w[i].Count == w[j].Count {
return w[i].Word < w[j].Word
}
return w[i].Count > w[j].Count
}
// mapToList converts a map to a WordList
func mapToList(m map[string]uint64) WordList {
p := make(WordList, len(m))
i := 0
for k, v := range m {
p[i] = Word{Word: k, Count: v}
i++
}
sort.Sort(p)
return p
}
func main() {
log.Println("Reading new corpus from stdin", )
counts := make(map[string]uint64)
scanner := bufio.NewScanner(os.Stdin)
scanner.Split(bufio.ScanWords)
i := 0
for scanner.Scan() {
word := scanner.Text()
if c, ok := counts[word]; ok {
counts[word] = c + 1
} else {
counts[word] = 1
}
i++
if i%100000 == 0 {
fmt.Printf("Processed %vk tokens\r", i/100000)
}
}
fmt.Printf("\n")
log.Printf("Finished. Found %v words\n", len(counts))
if err := scanner.Err(); err != nil {
log.Fatal("Error scanning corpus", err)
}
// purge low counts
for k, v := range counts {
if v < minCount {
delete(counts, k)
}
}
log.Printf("%v words made the cut\n", len(counts))
wordList := mapToList(counts)
for _, w := range wordList {
fmt.Printf("%v\t%v\n", w.Word, w.Count)
}
}