| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forleit (0) - 13 freq forfeit (1) - 9 freq forcet (2) - 1 freq oleit (2) - 1 freq forest (2) - 123 freq forrsit (2) - 1 freq forgett (2) - 1 freq freit (2) - 2 freq follaeit (2) - 3 freq forgein (2) - 1 freq forgait (2) - 1 freq forwent (2) - 1 freq forpit (2) - 1 freq forssit (2) - 1 freq forbeir (2) - 3 freq forkit (2) - 4 freq fordelt (2) - 2 freq fordest (2) - 2 freq fordert (2) - 4 freq forgit (2) - 8 freq forit (2) - 1 freq forleetit (2) - 1 freq formit (2) - 6 freq forleitin (2) - 2 freq forget (2) - 266 freq |
forleit (0) - 13 freq forliet (2) - 1 freq forfeit (2) - 9 freq forefit (3) - 1 freq forrit (3) - 529 freq forleitit (3) - 7 freq forget (3) - 266 freq forleitin (3) - 2 freq forleetit (3) - 1 freq formit (3) - 6 freq fornit (3) - 1 freq fleit (3) - 2 freq firlot (3) - 2 freq furlt (3) - 1 freq forret (3) - 32 freq forcet (3) - 1 freq forcit (3) - 2 freq follit (3) - 11 freq forit (3) - 1 freq foryet (3) - 9 freq forgit (3) - 8 freq follaeit (3) - 3 freq forgait (3) - 1 freq forpit (3) - 1 freq forest (3) - 123 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 - FRLT forleit - 13 freq firlot - 2 freq furl't - 1 freq furrult - 1 freq fraility - 1 freq frailty - 1 freq furled - 11 freq ferlied - 1 freq furlt - 1 freq ferlie't - 1 freq forliet - 1 freq virrelt - 1 freq |
FORLEIT |
| Time to execute Levenshtein function - 0.412086 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.564090 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.027544 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.073147 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.000945 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. |