-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathbuilder_test.go
86 lines (67 loc) · 1.47 KB
/
builder_test.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
package randtxt
import (
"fmt"
"sort"
"strings"
"testing"
"github.com/pboyd/markov"
)
func TestBuilder(t *testing.T) {
chain := markov.NewMemoryChain(100)
b := NewModelBuilder(chain, 3)
err := b.Feed(tagFeed(100))
if err != nil {
t.Fatalf("got error: %v", err)
}
actual := describeID(chain, 0)
expected := "A/NNP B/NNP C/NNP:D/NNP-1.00"
if actual != expected {
t.Errorf("got %q, want %q", actual, expected)
}
}
func TestUnigramBuilder(t *testing.T) {
chain := markov.NewMemoryChain(100)
b := NewModelBuilder(chain, 1)
err := b.Feed(tagFeed(100))
if err != nil {
t.Fatalf("got error: %v", err)
}
actual := describeID(chain, 0)
expected := "A/NNP:B/NNP-1.00"
if actual != expected {
t.Errorf("got %q, want %q", actual, expected)
}
}
func tagFeed(n int) <-chan Tag {
c := make(chan Tag)
go func() {
defer close(c)
letters := []string{"A", "B", "C", "D", "E", "F", "G"}
for i := 0; i < n; i++ {
c <- Tag{
Text: letters[i%len(letters)],
POS: "NNP",
}
}
}()
return c
}
func describeID(chain markov.Chain, id int) string {
links, err := chain.Links(0)
if err != nil {
return err.Error()
}
linkDesc := make([]string, len(links))
for i, link := range links {
val, err := chain.Get(link.ID)
if err != nil {
}
linkDesc[i] = fmt.Sprintf("%s-%0.2f", val, link.Probability)
}
sort.Strings(linkDesc)
value, err := chain.Get(0)
if err != nil {
return err.Error()
}
return value.(string) + ":" + strings.Join(linkDesc, " ")
}