You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

127 lines
2.9 KiB

package main
import (
"fmt"
"math/rand"
"strconv"
"strings"
)
type Markov struct{}
type State struct {
Word string
Count int
Prob float64
NextStates []State
}
var markov Markov
func printLoading(n int, total int) {
var bar []string
tantPerFourty := int((float64(n) / float64(total)) * 40)
tantPerCent := int((float64(n) / float64(total)) * 100)
for i := 0; i < tantPerFourty; i++ {
bar = append(bar, "█")
}
progressBar := strings.Join(bar, "")
fmt.Printf("\r " + progressBar + " - " + strconv.Itoa(tantPerCent) + "")
}
func addWordToStates(states []State, word string) ([]State, int) {
iState := -1
for i := 0; i < len(states); i++ {
if states[i].Word == word {
iState = i
}
}
if iState >= 0 {
states[iState].Count++
} else {
var tempState State
tempState.Word = word
tempState.Count = 1
states = append(states, tempState)
iState = len(states) - 1
}
return states, iState
}
func calcMarkovStates(words []string) []State {
var states []State
//count words
for i := 0; i < len(words)-1; i++ {
var iState int
states, iState = addWordToStates(states, words[i])
if iState < len(words) {
states[iState].NextStates, _ = addWordToStates(states[iState].NextStates, words[i+1])
}
printLoading(i, len(words))
}
//count prob
for i := 0; i < len(states); i++ {
states[i].Prob = (float64(states[i].Count) / float64(len(words)) * 100)
for j := 0; j < len(states[i].NextStates); j++ {
states[i].NextStates[j].Prob = (float64(states[i].NextStates[j].Count) / float64(len(words)) * 100)
}
}
fmt.Println("\ntotal words computed: " + strconv.Itoa(len(words)))
//fmt.Println(states)
return states
}
func textToWords(text string) []string {
s := strings.Split(text, " ")
words := s
return words
}
func (markov Markov) train(text string) []State {
words := textToWords(text)
states := calcMarkovStates(words)
//fmt.Println(states)
return states
}
func getNextMarkovState(states []State, word string) string {
iState := -1
for i := 0; i < len(states); i++ {
if states[i].Word == word {
iState = i
}
}
if iState < 0 {
return "word no exist on the memory"
}
var next State
next = states[iState].NextStates[0]
next.Prob = rand.Float64() * states[iState].Prob
for i := 0; i < len(states[iState].NextStates); i++ {
if (rand.Float64()*states[iState].NextStates[i].Prob) > next.Prob && states[iState-1].Word != states[iState].NextStates[i].Word {
next = states[iState].NextStates[i]
}
}
return next.Word
}
func (markov Markov) generateText(states []State, initWord string, count int) string {
var generatedText []string
word := initWord
generatedText = append(generatedText, word)
for i := 0; i < count; i++ {
word = getNextMarkovState(states, word)
if word == "word no exist on the memory" {
return "word no exist on the memory"
}
generatedText = append(generatedText, word)
}
//generatedText = append(generatedText, ".")
text := strings.Join(generatedText, " ")
return text
}