Improvment ?

[ragekit]

This is a very cool idea but I'm wondering on how you're implementing your markovesque algo

If i understood correctly each word has a dictionary of next word and each next word another dictionary and thats it because you don't want nesting too much to not blow up too much memory.

But with instead of storing, in the dictionary, the word, you're storing a reference to it ? First you create an object for all words and then you start over and process each word adding in their "next word dictionary" only a ref to the "word object" that was created. You could have very long recursion with it being very lightweight.

I don't know if I make sense ?

[jbrew]

Hey, thanks for reaching out.

Check out a more recent version of the program, here:
https://github.com/jbrew/voicebox

It doesn't use any nesting, which I agree is confusing in the old version.
Instead, the top level has a dictionary of ngrams of all sizes.

I've been meaning to write a readme for it but haven't had the time.

On Sun, Jul 24, 2016 at 11:30 PM, Ragekit [email protected] wrote:

This is a very cool idea but I'm wondering on how you're implementing your
markovesque algo

If i understood correctly each word has a dictionary of next word and each
next word another dictionary and thats it because you don't want nesting
too much to not blow up too much memory.

But with instead of storing, in the dictionary, the word, you're storing a
reference to it ? First you create an object for all words and then you
start over and process each word adding in their "next word dictionary"
only a ref to the "word object" that was created. You could have very long
recursion with it being very lightweight.

I don't know if I make sense ?

—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
#6, or mute the thread
https://github.com/notifications/unsubscribe-auth/APtUnqvs_7O5mPAsLIAAWl174YYrIJs-ks5qZDvigaJpZM4JTx8F
.