70 lines
1.2 KiB
Go
70 lines
1.2 KiB
Go
package txt
|
|
|
|
import (
|
|
"regexp"
|
|
"sort"
|
|
"strings"
|
|
)
|
|
|
|
var KeywordsRegexp = regexp.MustCompile("[\\p{L}]{3,}")
|
|
|
|
// Words returns a slice of words with at least 3 characters from a string.
|
|
func Words(s string) (results []string) {
|
|
return KeywordsRegexp.FindAllString(s, -1)
|
|
}
|
|
|
|
// Keywords returns a slice of keywords without stopwords.
|
|
func Keywords(s string) (results []string) {
|
|
for _, w := range Words(s) {
|
|
w = strings.ToLower(w)
|
|
|
|
if _, ok := Stopwords[w]; ok == false {
|
|
results = append(results, w)
|
|
}
|
|
}
|
|
|
|
return results
|
|
}
|
|
|
|
// UniqueWords sorts and filters a string slice for unique words.
|
|
func UniqueWords(words []string) (results []string) {
|
|
last := ""
|
|
|
|
sort.Strings(words)
|
|
|
|
for _, w := range words {
|
|
if len(w) < 3 || w == last {
|
|
continue
|
|
}
|
|
|
|
last = w
|
|
|
|
results = append(results, w)
|
|
}
|
|
|
|
return results
|
|
}
|
|
|
|
// UniqueKeywords returns a slice of unique and sorted keywords without stopwords.
|
|
func UniqueKeywords(s string) (results []string) {
|
|
last := ""
|
|
|
|
words := Keywords(s)
|
|
|
|
sort.Strings(words)
|
|
|
|
for _, w := range words {
|
|
w = strings.ToLower(w)
|
|
|
|
if len(w) < 3 || w == last {
|
|
continue
|
|
}
|
|
|
|
last = w
|
|
|
|
results = append(results, w)
|
|
}
|
|
|
|
return results
|
|
}
|