Python Markov Chain Generator - Printable Version

Code:
brain = {} #making the main dict

text = input('Please enter a sentence.\n') #getting some text

text = text.lower() #making the text less variable



words = text.split(' ') #splitting the text into words

wordlen = len(words) #finding the number of words

print(words)

print(wordlen)

itemcount = 0

for item in words:

    hit = False

    if itemcount >= len(words)-1: #making sure we don't loop through the last word because that will throw an error

        break

    if item in brain: # if the item already exists, we do this:

        nextitem = words[int(itemcount)+1] #find the word after this one

        b = brain[str(item)] #make a name for the list of words that come after the current word we are on

        for mylist in b:

            if str(mylist[0]) == str(nextitem): #check to ensure we don't duplicate a word

                count = int(mylist[1]) #if the following word already exists, we add 1 to the number of times it has appeared after the current word in question

                count += 1

                mylist[1] = count

                hit = True

        if hit == False: #if we have never seen it come after the current word, we add it

            newlist = [str(nextitem), 1]

            b.append(newlist)

            

    else: #for when the item doesn't already exist

        brain[str(item)] = [] #make the item

        nextitem = words[int(itemcount)+1]

        b = brain[str(item)]

        for mylist in b: #go through same process as before with finding words that come after it

            if str(mylist[0]) == str(nextitem):

                count = int(mylist[1])

                count += 1

                mylist[1] = count

                hit = True

        if hit == False:

            newlist = [str(nextitem), 1]

            b.append(newlist)

            

    itemcount+=1 

    



print(str(brain))