| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lavateria (0) - 1 freq bavaria (3) - 2 freq lavatries (3) - 1 freq savagerie (3) - 1 freq lavatory (3) - 5 freq cafeteria (3) - 1 freq bacteria (3) - 4 freq lavatories (3) - 1 freq lavatry (3) - 1 freq listeria (3) - 1 freq clatterit (4) - 1 freq academia (4) - 9 freq batterit (4) - 1 freq waitterfa (4) - 1 freq raverie (4) - 1 freq laayer (4) - 5 freq flaunterin (4) - 1 freq algeria (4) - 1 freq havera (4) - 2 freq leatherin (4) - 6 freq slaisterie (4) - 2 freq avatar (4) - 2 freq waatery (4) - 1 freq yatterin (4) - 4 freq waater (4) - 34 freq |
lavateria (0) - 1 freq lavatory (3) - 5 freq lavatry (3) - 1 freq lavatories (4) - 1 freq lavatries (4) - 1 freq listeria (4) - 1 freq elevator (5) - 6 freq lotterie (5) - 1 freq laiter (5) - 4 freq lafter (5) - 1 freq avatar (5) - 2 freq laitter (5) - 1 freq lamiter (5) - 1 freq livari (5) - 1 freq bacteria (5) - 4 freq cafeteria (5) - 1 freq savagerie (5) - 1 freq laeter (5) - 1 freq laetter (5) - 7 freq later (5) - 554 freq latter (5) - 25 freq bavaria (5) - 2 freq alter (6) - 15 freq livery (6) - 13 freq letterit (6) - 1 freq |
SoundEx code - L136 loftier - 2 freq luve-darg - 1 freq lavatry - 1 freq lavateria - 1 freq lavatory - 5 freq lavatories - 1 freq leftér - 1 freq life-threids - 1 freq lavatries - 1 freq leftower - 3 freq liftwards - 1 freq liftward - 1 freq lafter - 1 freq life-draain - 1 freq life-watter - 1 freq leftowers - 3 freq left-ower - 1 freq liftwart - 1 freq |
MetaPhone code - LFTR laughter - 53 freq loftier - 2 freq lighter - 27 freq lavatry - 1 freq lavateria - 1 freq lavatory - 5 freq leftér - 1 freq lafter - 1 freq |
LAVATERIA |
| Time to execute Levenshtein function - 0.280183 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.430702 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.036097 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.041315 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.005758 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. |