| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forleetit (0) - 1 freq forleitit (1) - 7 freq forleit (2) - 13 freq fleetit (2) - 2 freq forleitin (2) - 2 freq depleetit (3) - 1 freq leetit (3) - 6 freq permeetit (3) - 1 freq tormentit (3) - 4 freq forgett (3) - 1 freq molestit (3) - 1 freq fordellit (3) - 1 freq forfeit (3) - 9 freq frettit (3) - 1 freq collectit (3) - 8 freq forefit (3) - 1 freq forgettin (3) - 31 freq freestit (3) - 1 freq forteent (3) - 2 freq oreetin (3) - 1 freq forefeitit (3) - 1 freq fermentit (3) - 3 freq follaeit (3) - 3 freq forliet (3) - 1 freq greetit (3) - 10 freq |
forleetit (0) - 1 freq forleitit (1) - 7 freq fleetit (3) - 2 freq forleitin (3) - 2 freq forleit (3) - 13 freq forefeitit (4) - 1 freq frettit (4) - 1 freq forgett (4) - 1 freq forliet (4) - 1 freq froestit (4) - 1 freq freestit (4) - 1 freq flettie (5) - 1 freq ootgleetit (5) - 1 freq spleetit (5) - 1 freq forlaithie (5) - 1 freq ferlie't (5) - 1 freq flotit (5) - 1 freq floatit (5) - 7 freq flaitit (5) - 3 freq forritt (5) - 5 freq frontit (5) - 3 freq freistit (5) - 1 freq orientit (5) - 1 freq fortiet (5) - 2 freq frostit (5) - 9 freq |
SoundEx code - F643 forleit - 13 freq forleitit - 7 freq firlot - 2 freq fower-letter - 1 freq firlots - 2 freq furl't - 1 freq furrult - 1 freq fraility - 1 freq frailty - 1 freq furled - 11 freq frailties - 1 freq ferlied - 1 freq fowr-lettered - 1 freq freehauld - 1 freq furlt - 1 freq ferlie't - 1 freq forleetit - 1 freq frehaldair - 1 freq forlaithie - 1 freq forewaelit - 1 freq frehaldris - 1 freq frehalder - 1 freq frehalders - 2 freq forliet - 1 freq forleitin - 2 freq |
MetaPhone code - FRLTT forleitit - 7 freq forleetit - 1 freq |
FORLEETIT |
| Time to execute Levenshtein function - 0.250283 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.397219 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.027357 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.037263 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.000885 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. |