I see you're taking len(sentence) -1 .After this step If we add dot in n_gram after last word of sentence and whenever sentence generator encounters a dot it should stop.
I'm using the Python extension. If you search for Python in the Extensions sidebar it's the first one, from Microsoft. It will install several other extensions but that will get you all the functionality in the video. Thanks for the comment!
@@DouglasStarnes Hi, thank you for the Video... i have a question, how can we use N-gram (bi-gram e.i) to help users in searching process when he write his query
6:31 alright this really isn't a lookup table, your getting much closer to a tree structure. and data structures were possible should be compressed as possible. So your list should remove duplicates but either it should become a dictionary with a count factor or sort the list with the selection algorithm favouring items at one end of the list over the other.... In fact a tree structure can have more depth, if for example you keep the upper limit words, in that all words that appear less than twice for example get removed, so you are linking words the connect to each other much more strongly.
Your way of explaining is just so clear. Nice work.
I'm trying to make sentence autocomplete project instead of generating sentences. but it works similarly.
Can you next do the generator using neural networks.
I see you're taking len(sentence) -1 .After this step If we add dot in n_gram after last word of sentence and whenever sentence generator encounters a dot it should stop.
Hi Starnes,
I am trying to extract senteces using some predefnied bigrams. Can you please help me?
Hi, can you share the extentions you use in your vscode
I'm using the Python extension. If you search for Python in the Extensions sidebar it's the first one, from Microsoft. It will install several other extensions but that will get you all the functionality in the video. Thanks for the comment!
@@DouglasStarnes Hi, thank you for the Video... i have a question, how can we use N-gram (bi-gram e.i) to help users in searching process when he write his query
7:41 I see your not bothering with a state to make your choice's more unique.
6:31 alright this really isn't a lookup table, your getting much closer to a tree structure. and data structures were possible should be compressed as possible. So your list should remove duplicates but either it should become a dictionary with a count factor or sort the list with the selection algorithm favouring items at one end of the list over the other.... In fact a tree structure can have more depth, if for example you keep the upper limit words, in that all words that appear less than twice for example get removed, so you are linking words the connect to each other much more strongly.
i love!!!
Good job bro, JESUS IS COMING BACK VERY SOON;WATCH AND PREPARE