-
Notifications
You must be signed in to change notification settings - Fork 0
/
textprocessing.go
230 lines (195 loc) · 4.6 KB
/
textprocessing.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
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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
package main
import (
"strings"
"github.com/antzucaro/matchr"
)
var allNames, allStops = GetAllTransitStops("json/transit_stops.json")
func ProcessText(text string) ([]string, []string, []string, bool) {
stopNames := []string{}
stopIds := []string{}
linesArray := []string{}
isAboutDelay := false
editText := strings.ToLower(text)
editText = CleanString(editText)
wordArray := strings.Split(editText, " ")
// Search for stops.
for i, word := range wordArray {
wordIsLine := isLine(word)
if wordIsLine {
linesArray = append(linesArray, word)
}
wordIsDelayWord := isDelayWord(word)
if wordIsDelayWord {
isAboutDelay = true
}
isLast := false
words := []string{}
if i != 0 {
words = append(words, wordArray[i-1])
}
words = append(words, word)
// If is last word
if i != len(wordArray)-1 {
words = append(words, wordArray[i+1])
} else {
isLast = true
}
stopName, stopNr := FindStops(words, isLast)
if stopName != "" && stopNr != "" {
if !Contains(stopIds, stopNr) {
stopNames = append(stopNames, stopName)
stopIds = append(stopIds, stopNr)
}
}
}
return stopNames, stopIds, linesArray, isAboutDelay
}
// Clean the word from useless chars.
func CleanString(text string) string {
text = strings.Replace(text, ".", "", -1)
text = strings.Replace(text, ",", "", -1)
text = strings.Replace(text, ";", "", -1)
text = strings.Replace(text, ":", "", -1)
text = strings.Replace(text, "?", "", -1)
text = strings.Replace(text, "!", "", -1)
return text
}
// Processed different word possibilities.
func FindStops(words []string, isLast bool) (string, string) {
stopName, stopNr := "", ""
switch len(words) {
case 3:
// Search for all 3 words.
searchedString := words[0] + " " + words[1] + " " + words[2]
stopName, stopNr = search(searchedString)
if stopName != "" {
return stopName, stopNr
}
// Search for first 2 words.
searchedString = words[0] + " " + words[1]
stopName, stopNr = search(searchedString)
if stopName != "" {
return stopName, stopNr
}
// Search for last 2 words.
searchedString = words[1] + " " + words[2]
stopName, stopNr = search(searchedString)
if stopName != "" {
return stopName, stopNr
}
// Search original word.
searchedString = words[1]
stopName, stopNr = search(searchedString)
if stopName != "" {
return stopName, stopNr
}
case 2:
// Searches all 2 words.
searchedString := words[0] + " " + words[1]
stopName, stopNr = search(searchedString)
if stopName != "" {
return stopName, stopNr
}
if !isLast {
// Searches for the first word.
stopName, stopNr = search(words[0])
if stopName != "" {
return stopName, stopNr
}
} else {
// Searches for the last word.
stopName, stopNr = search(words[1])
if stopName != "" {
return stopName, stopNr
}
}
case 1:
stopName, stopNr = search(words[0])
if stopName != "" {
return stopName, stopNr
}
default:
return stopName, stopNr
}
return stopName, stopNr
}
// Searches the stop of the list with help of Damerau-Levenshtein algorithm.
func search(wordGroup string) (string, string) {
threshold := 0.94
matchedNames := []Rank{}
for _, name := range allNames {
dist := matchr.DamerauLevenshtein(wordGroup, name)
if dist <= 5 {
d := float64(dist)
l := float64(len(wordGroup + name))
ratio := 1 - float64(d/l)
if ratio >= threshold {
rank := Rank{ratio, name}
matchedNames = append(matchedNames, rank)
}
}
}
if len(matchedNames) > 0 {
bestRank := findBestRank(matchedNames)
stopName := bestRank.Name
stopNr := allStops[stopName]
return stopName, stopNr
} else {
return "", ""
}
}
// Categorize the text for answer creation.
// TODO tests needed
func Categorize(info TextInfo) int {
if info.delay {
return DELAYS
}
switch len(info.stopIds) {
case 0:
break
case 1:
return DEPARTURES
case 2:
return CONNECTIONS
default:
break
}
return 0
}
// Checks if word is line.
func isLine(word string) bool {
lines := GetAllLines("json/keywords.json")
for i := 0; i < len(lines); i++ {
if lines[i] == word {
return true
}
}
return false
}
// Checks if is delay word.
func isDelayWord(word string) bool {
delayWords := GetAllDelayKeywords("json/keywords.json")
for i := 0; i < len(delayWords); i++ {
if delayWords[i] == word {
return true
}
}
return false
}
type Rank struct {
RelDist float64
Name string
}
// Finds best rank.
func findBestRank(ranks []Rank) Rank {
bestDist := 0.0
bestRank := Rank{}
for _, rank := range ranks {
rankDist := rank.RelDist
if rankDist > bestDist {
bestDist = rankDist
bestRank = rank
}
}
return bestRank
}