| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| florence (0) - 29 freq jflorence (1) - 1 freq florewnce (1) - 1 freq clarence (2) - 2 freq florence's (2) - 2 freq fawrence (2) - 1 freq forebye (3) - 59 freq glence (3) - 4 freq foresee (3) - 7 freq florin (3) - 4 freq fence (3) - 154 freq floret (3) - 1 freq flores (3) - 1 freq lawrence (3) - 5 freq foreneen (3) - 39 freq 'lorne (3) - 1 freq flunce (3) - 1 freq flense (3) - 1 freq flench (3) - 2 freq lorenzo (3) - 1 freq licence (3) - 29 freq lorne (3) - 6 freq fleece (3) - 11 freq flouncy (3) - 1 freq force (3) - 129 freq |
florence (0) - 29 freq florewnce (2) - 1 freq jflorence (2) - 1 freq fawrence (3) - 1 freq clarence (3) - 2 freq tolerence (4) - 1 freq flouncy (4) - 1 freq flamenco (4) - 1 freq laurence (4) - 10 freq flunce (4) - 1 freq fluency (4) - 7 freq france (4) - 85 freq frunce (4) - 1 freq florence's (4) - 2 freq florin (4) - 4 freq clearance (5) - 16 freq flowen (5) - 2 freq fraince (5) - 1 freq prence (5) - 1 freq lawrence (5) - 5 freq florrie (5) - 1 freq flouerin (5) - 2 freq flounced (5) - 1 freq flaran (5) - 1 freq tolerance (5) - 7 freq |
SoundEx code - F465 florence - 29 freq flairin - 2 freq florin - 4 freq flouerin - 2 freq florence's - 2 freq flooerin - 4 freq flaran - 1 freq floareen - 1 freq fleerin - 4 freq flarin - 3 freq fleerymaneerie - 1 freq florewnce - 1 freq florentines - 1 freq florencerounda - 1 freq flyering - 1 freq |
MetaPhone code - FLRNS florence - 29 freq florewnce - 1 freq |
FLORENCE |
| Time to execute Levenshtein function - 0.215817 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.531040 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.030953 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.055418 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.000926 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. |