Exactly what the title says. When the porter algorithm is first used, it will store all of the db words in a dictionary. However, the dictionary is never updated, so similar(w1, w1) will return undefined results when checking equality for all new words. This will be fixed once the bot starts again and the algorithm is first used
Exactly what the title says. When the porter algorithm is first used, it will store all of the db words in a dictionary. However, the dictionary is never updated, so
similar(w1, w1)will return undefined results when checking equality for all new words. This will be fixed once the bot starts again and the algorithm is first used