-
Notifications
You must be signed in to change notification settings - Fork 0
/
api.go
158 lines (147 loc) · 3.56 KB
/
api.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
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
package fmr
import (
"fmt"
"strings"
"sync"
"github.com/liuzl/ling"
)
var nlp *ling.Pipeline
var once sync.Once
// NLP returns handler for the ling nlp toolkit
func NLP() *ling.Pipeline {
once.Do(func() {
var err error
var tagger *ling.DictTagger
if nlp, err = ling.DefaultNLP(); err != nil {
panic(err)
}
if tagger, err = ling.NewDictTagger(); err != nil {
panic(err)
}
if err = nlp.AddTagger(tagger); err != nil {
panic(err)
}
})
return nlp
}
// EarleyParse parses text for rule <start> at beginning
func (g *Grammar) EarleyParse(text string, starts ...string) (*Parse, error) {
tokens, l, err := g.process(text)
if err != nil {
return nil, err
}
return g.earleyParse(true, text, tokens, l, starts...)
}
// EarleyParseAny parses text for rule <start> at any position
func (g *Grammar) EarleyParseAny(text string, starts ...string) (*Parse, error) {
tokens, l, err := g.process(text)
if err != nil {
return nil, err
}
var p *Parse
for i := 0; i < len(tokens); i++ {
if p, err = g.earleyParse(true, text, tokens[i:], l, starts...); err != nil {
return nil, err
}
if p.finalStates != nil {
return p, nil
}
}
return p, nil
}
// EarleyParseMaxAll extracts all submatches in text for rule <start>
func (g *Grammar) EarleyParseMaxAll(text string, starts ...string) ([]*Parse, error) {
tokens, l, err := g.process(text)
if err != nil {
return nil, err
}
var ret []*Parse
for i := 0; i < len(tokens); {
p, err := g.earleyParse(true, text, tokens[i:], l, starts...)
if err != nil {
return nil, err
}
if p.finalStates != nil {
ret = append(ret, p)
max := 0
for _, finalState := range p.finalStates {
if finalState.End > max {
max = finalState.End
}
}
i += max
} else {
i++
}
}
return ret, nil
}
// EarleyParseAll extracts all submatches in text for rule <start>
func (g *Grammar) EarleyParseAll(text string, starts ...string) ([]*Parse, error) {
tokens, l, err := g.process(text)
if err != nil {
return nil, err
}
var ret []*Parse
for i := 0; i < len(tokens); i++ {
p, err := g.earleyParse(false, text, tokens[i:], l, starts...)
if err != nil {
return nil, err
}
if p.finalStates != nil {
ret = append(ret, p)
//i += p.finalState.End
}
}
return ret, nil
}
func (g *Grammar) earleyParse(maxFlag bool, text string,
tokens []*ling.Token, l *Grammar, starts ...string) (*Parse, error) {
if len(starts) == 0 {
return nil, fmt.Errorf("no start rules")
}
if len(tokens) == 0 {
return nil, fmt.Errorf("no tokens to parse")
}
parse := &Parse{grammars: []*Grammar{g}, text: text, starts: starts}
if len(g.includes) > 0 {
parse.grammars = append(parse.grammars, g.includes...)
}
if l != nil {
parse.grammars = append(parse.grammars, l)
}
parse.columns = append(parse.columns, &TableColumn{index: 0, token: nil})
for _, token := range tokens {
parse.columns = append(parse.columns,
&TableColumn{index: len(parse.columns), token: token})
}
parse.parse(maxFlag)
if Debug {
fmt.Println(parse)
}
return parse, nil
}
func (g *Grammar) process(text string) ([]*ling.Token, *Grammar, error) {
if text = strings.TrimSpace(text); text == "" {
return nil, nil, fmt.Errorf("text is empty")
}
d := ling.NewDocument(text)
if err := NLP().Annotate(d); err != nil {
return nil, nil, err
}
var ret []*ling.Token
for _, token := range d.Tokens {
if token.Type == ling.Space {
continue
}
ret = append(ret, token)
}
if len(ret) == 0 {
return nil, nil, fmt.Errorf("no tokens")
}
l, err := g.localGrammar(d)
if err != nil {
return nil, nil, err
}
return ret, l, nil
}