| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| davidpaisley (0) - 4 freq ianpaisley (4) - 1 freq davidpolson (5) - 1 freq daviddavismp (5) - 1 freq davidjames (5) - 3 freq davidtaylor (5) - 1 freq davidhawker (5) - 1 freq davidramage (5) - 2 freq davidlinden (5) - 2 freq 'paisley (5) - 1 freq davidpreece (5) - 1 freq paisley (5) - 61 freq davidpsnp (5) - 1 freq daisley (5) - 2 freq heidmaister (6) - 5 freq davids (6) - 1 freq paisly (6) - 1 freq disaise (6) - 2 freq daintily (6) - 2 freq fair-isle (6) - 1 freq patsley (6) - 1 freq howpasley (6) - 21 freq davidfe (6) - 6 freq davidmcandrew (6) - 10 freq kevingashley (6) - 1 freq |
davidpaisley (0) - 4 freq davidpreece (7) - 1 freq ianpaisley (7) - 1 freq davidpsnp (7) - 1 freq davidpolson (7) - 1 freq paisley (8) - 61 freq davidjames (8) - 3 freq david's (8) - 17 freq davidson (8) - 26 freq deviously (8) - 1 freq daisley (8) - 2 freq davidramage (8) - 2 freq 'paisley (8) - 1 freq davidtaylor (8) - 1 freq widpile (9) - 1 freq davidsons (9) - 3 freq daavid's (9) - 1 freq davidpwebb (9) - 1 freq bardsley (9) - 1 freq diveidwal (9) - 2 freq daidle (9) - 2 freq divides (9) - 4 freq davidbowie (9) - 1 freq devdas (9) - 3 freq davidmerson (9) - 2 freq |
SoundEx code - D131 dib-dabs - 1 freq debt-free - 1 freq doubtfu - 3 freq doubtful - 4 freq doubtfully - 2 freq debatable - 1 freq debaitabil - 1 freq davidpsnp - 1 freq debdev - 1 freq davidbowie - 1 freq davidpreece - 1 freq devtober - 1 freq davidboatymcboa - 2 freq davidbu - 1 freq davidpaisley - 4 freq davidpwebb - 1 freq daviddavismp - 1 freq davidofficer - 1 freq davidfe - 6 freq davidpolson - 1 freq |
MetaPhone code - TFTPSL davidpaisley - 4 freq |
DAVIDPAISLEY |
| Time to execute Levenshtein function - 0.290707 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.447652 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.031934 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.046551 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.000839 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. |