| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forleitit (0) - 7 freq forleitin (1) - 2 freq forleetit (1) - 1 freq forefeitit (2) - 1 freq forleit (2) - 13 freq collectit (3) - 8 freq molestit (3) - 1 freq expleitit (3) - 1 freq forgett (3) - 1 freq forgettin (3) - 31 freq forfeited (3) - 1 freq orientit (3) - 1 freq freistit (3) - 1 freq forlaithie (3) - 1 freq froestit (3) - 1 freq fleetit (3) - 2 freq forliet (3) - 1 freq fordellit (3) - 1 freq flaitit (3) - 3 freq forfeit (3) - 9 freq fleimit (3) - 3 freq conceitit (3) - 1 freq greitit (3) - 1 freq fleitin (3) - 1 freq tormentit (3) - 4 freq |
forleitit (0) - 7 freq forleetit (1) - 1 freq forleitin (2) - 2 freq forleit (3) - 13 freq forefeitit (3) - 1 freq fleetit (4) - 2 freq froestit (4) - 1 freq forliet (4) - 1 freq freestit (4) - 1 freq forlaithie (4) - 1 freq frettit (4) - 1 freq flaitit (4) - 3 freq forritt (4) - 5 freq forgett (4) - 1 freq freistit (4) - 1 freq fermentit (5) - 3 freq leitit (5) - 3 freq freitie (5) - 2 freq expleitit (5) - 1 freq flotit (5) - 1 freq frontit (5) - 3 freq frostit (5) - 9 freq ferlie't (5) - 1 freq fortiet (5) - 2 freq flettie (5) - 1 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 |
FORLEITIT |
| Time to execute Levenshtein function - 0.255321 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.427596 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.028129 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.037815 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.000957 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. |