You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I did not check a lot the implementation but maybe we could also have a tree and each leave would be a letter. Thus, when checking the counts of "test" we would go in node "t" then "e" then "s" then "t" and it would be faster than scanning a dictonary with hundreds of thousands entries?
Once again, I don’t know this algo and just had a quick look, so maybe my solution does not fit the requirements.
Profile NgramModel with frequencies saved as Dictionary and compare it to the current one that saves frequencies in Bag
The text was updated successfully, but these errors were encountered: