| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tiber (0) - 1 freq tuber (1) - 1 freq tizer (1) - 3 freq tibet (1) - 10 freq timer (1) - 6 freq timber (1) - 4 freq tibur (1) - 2 freq tiger (1) - 27 freq tier (1) - 36 freq pier (2) - 38 freq fifer (2) - 11 freq aaber (2) - 22 freq tile (2) - 5 freq witer (2) - 2 freq dibber (2) - 2 freq liker (2) - 9 freq wiver (2) - 1 freq wiler (2) - 1 freq tides (2) - 22 freq mibey (2) - 1 freq riter (2) - 1 freq tubers (2) - 1 freq einer (2) - 1 freq time- (2) - 2 freq siner (2) - 1 freq |
tiber (0) - 1 freq tibur (1) - 2 freq tuber (1) - 1 freq tier (2) - 36 freq tabor (2) - 1 freq tobar (2) - 2 freq tiger (2) - 27 freq tizer (2) - 3 freq tibet (2) - 10 freq timer (2) - 6 freq timber (2) - 4 freq tebel (3) - 1 freq teer (3) - 5 freq toner (3) - 1 freq t'er (3) - 6 freq sober (3) - 31 freq weber (3) - 1 freq umber (3) - 2 freq uber (3) - 2 freq cyber (3) - 4 freq tbe (3) - 1 freq tower (3) - 46 freq bier (3) - 3 freq tire (3) - 12 freq ther (3) - 111 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 - TBR dobro - 1 freq dobber - 4 freq tibur - 2 freq tiber - 1 freq tea-barra - 1 freq tuber - 1 freq tobar - 2 freq dibber - 2 freq dabber - 3 freq tabor - 1 freq wdbhr - 1 freq |
TIBER |
| Time to execute Levenshtein function - 0.197046 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.338455 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.027747 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.036974 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.000920 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. |