| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forleitin (0) - 2 freq forleitit (1) - 7 freq forleetit (2) - 1 freq fleitin (2) - 1 freq forleit (2) - 13 freq forgettin (2) - 31 freq freitin (2) - 2 freq foreign (3) - 67 freq forgetting (3) - 5 freq forderin (3) - 191 freq tormentin (3) - 5 freq worritin (3) - 1 freq furgettin (3) - 5 freq oreetin (3) - 1 freq spleitin (3) - 1 freq filletin (3) - 2 freq forgoatin (3) - 1 freq fortin (3) - 1 freq fermentin (3) - 1 freq freitie (3) - 2 freq freistin (3) - 1 freq forlaithie (3) - 1 freq forgein (3) - 1 freq forenuin (3) - 11 freq vvreitin (3) - 1 freq |
forleitin (0) - 2 freq forleitit (2) - 7 freq forleit (3) - 13 freq freitin (3) - 2 freq fleitin (3) - 1 freq forleetit (3) - 1 freq filletin (4) - 2 freq firgitin (4) - 1 freq forgoatin (4) - 1 freq freistin (4) - 1 freq fleatin (4) - 1 freq forlaithie (4) - 1 freq fortin (4) - 1 freq ferliein (4) - 3 freq forgettin (4) - 31 freq frettin (4) - 2 freq fleetin (4) - 19 freq firritin (4) - 1 freq flaitin (4) - 4 freq flitin (4) - 1 freq carleton (5) - 1 freq foryatten (5) - 5 freq feorlean (5) - 3 freq forgittin (5) - 3 freq forgiein (5) - 3 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 - FRLTN forleitin - 2 freq |
FORLEITIN |
| Time to execute Levenshtein function - 0.221876 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.412585 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.027499 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.036774 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.000801 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. |