Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tvver (0) - 1 freq tver (1) - 3 freq uvver (1) - 10 freq jvver (1) - 1 freq ivver (1) - 275 freq teer (2) - 5 freq tiber (2) - 1 freq eever (2) - 2 freq tier (2) - 36 freq bovver (2) - 6 freq theer (2) - 1 freq mover (2) - 1 freq tyer (2) - 1 freq taper (2) - 4 freq aiver (2) - 3 freq t've (2) - 4 freq toves (2) - 1 freq evvir (2) - 5 freq tuber (2) - 1 freq tower (2) - 44 freq touer (2) - 60 freq tiger (2) - 27 freq taiver (2) - 2 freq lever (2) - 2 freq dover (2) - 15 freq |
tvver (0) - 1 freq tver (2) - 3 freq jvver (2) - 1 freq ivver (2) - 275 freq uvver (2) - 10 freq evvir (3) - 5 freq cuvver (3) - 1 freq tvery (3) - 2 freq yivver (3) - 4 freq pivver (3) - 1 freq taiver (3) - 2 freq fivver (3) - 4 freq nivver (3) - 976 freq ivvery (3) - 74 freq ivvir (3) - 6 freq kivver (3) - 6 freq avever (3) - 1 freq bovver (3) - 6 freq river (4) - 264 freq tizer (4) - 3 freq timer (4) - 6 freq tuner (4) - 1 freq inver (4) - 1 freq tther (4) - 6 freq cover (4) - 148 freq |
SoundEx code - T160 thievery - 1 freq tverie - 2 freq tver - 3 freq tipper - 14 freq tvery - 2 freq topiary - 2 freq tapper - 1 freq tvver - 1 freq tibur - 2 freq tiber - 1 freq topper - 12 freq tea-barra - 1 freq taiver - 2 freq tuber - 1 freq taper - 4 freq tobar - 2 freq tfar - 1 freq the-fore - 1 freq twa-fower - 1 freq topher - 1 freq twofur - 1 freq tabor - 1 freq tfvoeor - 1 freq tvroy - 1 freq |
MetaPhone code - TFR tougher - 3 freq dover - 15 freq duffer - 6 freq differ - 135 freq diver - 5 freq dafferie - 4 freq dyvor - 1 freq tverie - 2 freq tver - 3 freq tvery - 2 freq daffery - 2 freq tvver - 1 freq devour' - 1 freq dover' - 1 freq 'dafferie - 1 freq deiffer - 2 freq daiver - 4 freq deefer - 1 freq dyvour - 2 freq taiver - 2 freq devour - 7 freq tfar - 1 freq devoir - 1 freq difer - 2 freq dfr - 2 freq topher - 1 freq dwfywri - 1 freq tvroy - 1 freq |
TVVER |
Time to execute Levenshtein function - 0.230380 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.358216 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.026990 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.036265 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.000833 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. |