Description
There are two implementation of levenshtein distance, unlimitedCompare and limitedCompare.
I propose to generalise the levenshtein distance by adding an option to change the value of
1) Addition of Character.
2) Deletion of Character.
3) Substitution of Character.
Currently they are all set to 1. For backward compatibility this will be the default case.