| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laurence (0) - 10 freq lawrence (1) - 5 freq lauren (2) - 21 freq clarence (2) - 2 freq lauren's (2) - 2 freq fawrence (2) - 1 freq launce (2) - 1 freq laureate (2) - 3 freq darenae (3) - 4 freq larne (3) - 19 freq maurice (3) - 4 freq absence (3) - 20 freq clairance (3) - 1 freq laureen (3) - 4 freq daunce (3) - 42 freq prence (3) - 1 freq patience (3) - 45 freq opulence (3) - 2 freq lvidence (3) - 1 freq lausanne (3) - 1 freq lance (3) - 5 freq happence (3) - 1 freq laren (3) - 21 freq aence (3) - 8 freq laureates (3) - 1 freq |
laurence (0) - 10 freq lawrence (2) - 5 freq launce (3) - 1 freq clarence (3) - 2 freq lauren (3) - 21 freq lance (4) - 5 freq terence (4) - 1 freq prence (4) - 1 freq reuerence (4) - 1 freq florence (4) - 29 freq lairne (4) - 2 freq laren (4) - 21 freq laureen (4) - 4 freq fawrence (4) - 1 freq larne (4) - 19 freq laureate (4) - 3 freq lauren's (4) - 2 freq licence (4) - 29 freq clairance (4) - 1 freq laarant (5) - 1 freq lairns (5) - 7 freq lairned (5) - 14 freq larnin (5) - 27 freq prance (5) - 5 freq larnt (5) - 13 freq |
SoundEx code - L652 lowering - 2 freq learns - 10 freq lairns - 7 freq larns - 1 freq larynx - 2 freq lauren's - 2 freq laurence - 10 freq laerns - 4 freq louring - 1 freq luring - 1 freq lawrence - 5 freq lawrenson - 1 freq lauramaxwell - 1 freq lairnscots - 99 freq lawriemk - 1 freq lornmac - 1 freq laurenoxleyx - 2 freq louhairmakeup - 1 freq lruunyz - 1 freq lornaslater - 1 freq laurencefindlay - 3 freq lorenzo - 1 freq learnsomethingeveryday - 1 freq |
MetaPhone code - LRNS learns - 10 freq lairns - 7 freq larns - 1 freq lauren's - 2 freq laurence - 10 freq laerns - 4 freq lawrence - 5 freq lruunyz - 1 freq lorenzo - 1 freq |
LAURENCE |
| Time to execute Levenshtein function - 0.184682 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.336614 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.027861 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.036801 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.000834 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. |