| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| forleit (0) - 13 freq forfeit (1) - 9 freq forleitin (2) - 2 freq foldit (2) - 12 freq follaeit (2) - 3 freq fleit (2) - 1 freq forrest (2) - 5 freq forret (2) - 32 freq oleit (2) - 1 freq freit (2) - 2 freq foryet (2) - 9 freq forfeits (2) - 2 freq fordert (2) - 4 freq forgein (2) - 1 freq foulest (2) - 1 freq forgett (2) - 1 freq forwent (2) - 1 freq forit (2) - 1 freq forliet (2) - 1 freq fornent (2) - 35 freq forcet (2) - 1 freq foubeit (2) - 7 freq formit (2) - 6 freq forbeir (2) - 3 freq forrsit (2) - 1 freq |
forleit (0) - 13 freq forfeit (2) - 9 freq forliet (2) - 1 freq forgit (3) - 8 freq follit (3) - 11 freq forleitit (3) - 7 freq formit (3) - 6 freq forget (3) - 262 freq fordelt (3) - 2 freq forcit (3) - 2 freq forefit (3) - 1 freq forkit (3) - 4 freq furlt (3) - 1 freq firlot (3) - 2 freq forgait (3) - 1 freq forrit (3) - 527 freq forcet (3) - 1 freq forest (3) - 117 freq forleetit (3) - 1 freq forpit (3) - 1 freq freit (3) - 2 freq fleit (3) - 1 freq follaeit (3) - 3 freq forleitin (3) - 2 freq foryet (3) - 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 - 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.249424 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.441053 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.027893 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.037832 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.000859 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. |