| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uvver (0) - 10 freq ivver (1) - 276 freq jvver (1) - 1 freq cuvver (1) - 1 freq tvver (1) - 1 freq over (2) - 340 freq uxvvr (2) - 1 freq hever (2) - 2 freq bovver (2) - 6 freq inver (2) - 1 freq yivver (2) - 4 freq eever (2) - 2 freq uther (2) - 9 freq rover (2) - 12 freq wuvven (2) - 2 freq muvved (2) - 2 freq iver (2) - 312 freq umber (2) - 2 freq ‚¬ver (2) - 1 freq wulver (2) - 1 freq lover (2) - 27 freq kivver (2) - 6 freq dover (2) - 16 freq upper (2) - 55 freq never (2) - 1661 freq |
uvver (0) - 10 freq ivver (1) - 276 freq ivvir (2) - 6 freq evvir (2) - 6 freq ivvery (2) - 74 freq yivver (2) - 4 freq avever (2) - 1 freq jvver (2) - 1 freq tvver (2) - 1 freq cuvver (2) - 1 freq ivvry (3) - 20 freq quiver (3) - 6 freq ivve (3) - 1 freq ryver (3) - 1 freq fiver (3) - 46 freq naver (3) - 3 freq veer (3) - 1 freq sover (3) - 1 freq mover (3) - 1 freq cuuver (3) - 1 freq wiver (3) - 1 freq tver (3) - 3 freq luver (3) - 8 freq waver (3) - 1 freq sever (3) - 3 freq |
SoundEx code - U160 upper - 55 freq up-or - 1 freq upr - 2 freq 'upper - 1 freq ufer - 1 freq ueber - 1 freq €œupper - 1 freq uber - 2 freq uapr - 1 freq uvver - 10 freq uvyr - 1 freq |
MetaPhone code - UFR ufer - 1 freq uighur - 34 freq uvver - 10 freq uvyr - 1 freq |
UVVER |
| Time to execute Levenshtein function - 0.310579 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.571486 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027403 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.071980 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001113 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |