arnaucube
arnaucube/flock-botnetPublic Self-hosted repository
flock-botnet/markov.go
markov.goRaw
  1package main
  2
  3import (
  4	"fmt"
  5	"io/ioutil"
  6	"math/rand"
  7	"strconv"
  8	"strings"
  9)
 10
 11type Markov struct{}
 12
 13/*type NextState struct {
 14	Word  string
 15	Count int
 16	Prob  float64
 17}*/
 18type State struct {
 19	Word       string
 20	Count      int
 21	Prob       float64
 22	NextStates []State
 23}
 24
 25var markov Markov
 26
 27func addWordToStates(states []State, word string) ([]State, int) {
 28	iState := -1
 29	for i := 0; i < len(states); i++ {
 30		if states[i].Word == word {
 31			iState = i
 32		}
 33	}
 34	if iState >= 0 {
 35		states[iState].Count++
 36	} else {
 37		var tempState State
 38		tempState.Word = word
 39		tempState.Count = 1
 40
 41		states = append(states, tempState)
 42		iState = len(states) - 1
 43
 44	}
 45	return states, iState
 46}
 47
 48func calcMarkovStates(words []string) []State {
 49	var states []State
 50	//count words
 51	for i := 0; i < len(words)-1; i++ {
 52		var iState int
 53		states, iState = addWordToStates(states, words[i])
 54		if iState < len(words) {
 55			states[iState].NextStates, _ = addWordToStates(states[iState].NextStates, words[i+1])
 56		}
 57	}
 58
 59	//count prob
 60	for i := 0; i < len(states); i++ {
 61		states[i].Prob = (float64(states[i].Count) / float64(len(words)) * 100)
 62		for j := 0; j < len(states[i].NextStates); j++ {
 63			states[i].NextStates[j].Prob = (float64(states[i].NextStates[j].Count) / float64(len(words)) * 100)
 64		}
 65	}
 66	fmt.Println("total words: " + strconv.Itoa(len(words)))
 67	//fmt.Println(states)
 68	return states
 69}
 70
 71func textToWords(text string) []string {
 72	s := strings.Split(text, " ")
 73	words := s
 74	return words
 75}
 76
 77func readText(path string) (string, error) {
 78	data, err := ioutil.ReadFile(path)
 79	if err != nil {
 80		//Do something
 81	}
 82	content := string(data)
 83	return content, err
 84}
 85
 86func (markov Markov) train(firstWord string, path string) []State {
 87	text, _ := readText(path)
 88	words := textToWords(text)
 89	states := calcMarkovStates(words)
 90	//fmt.Println(states)
 91
 92	return states
 93}
 94
 95func getNextMarkovState(states []State, word string) string {
 96	iState := -1
 97	for i := 0; i < len(states); i++ {
 98		if states[i].Word == word {
 99			iState = i
100		}
101	}
102	if iState < 0 {
103		return "word no exist on the memory"
104	}
105	fmt.Println(rand.Float64())
106	return word
107}
108func (markov Markov) generateText(states []State, initWord string, count int) string {
109	var generatedText []string
110	word := initWord
111	for i := 0; i < count; i++ {
112		word = getNextMarkovState(states, word)
113		generatedText = append(generatedText, word)
114	}
115	return "a"
116}