| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| davidlinden (0) - 2 freq deidline (4) - 1 freq davidjmadden (4) - 1 freq linden (5) - 11 freq deidlike (5) - 2 freq dailin (5) - 1 freq davidbowie (5) - 1 freq davidson's (5) - 1 freq avidence (5) - 2 freq dividend (5) - 1 freq davidson (5) - 26 freq davidsons (5) - 3 freq danielowen (5) - 1 freq davidjames (5) - 3 freq airlines (5) - 1 freq dagidder (5) - 3 freq davidalexander (5) - 1 freq davidmerson (5) - 2 freq dahdiedee (5) - 1 freq dividends (5) - 1 freq cardenden (5) - 1 freq davidwshedden (5) - 1 freq heidlines (5) - 11 freq dailigan (5) - 1 freq davidpsnp (5) - 1 freq |
davidlinden (0) - 2 freq davidalexander (7) - 1 freq dividends (7) - 1 freq dividend (7) - 1 freq davidjmadden (7) - 1 freq deidline (7) - 1 freq daidled (8) - 1 freq dividend (8) - 1 freq dawdlin (8) - 2 freq davidmunro (8) - 1 freq davidpolson (8) - 1 freq bedlinen (8) - 1 freq dividen (8) - 1 freq dadden (8) - 1 freq davidhunt (8) - 3 freq gavinlundy (8) - 1 freq dividin' (8) - 1 freq dividin (8) - 4 freq cardenden (8) - 1 freq deadline (8) - 4 freq davidleemedia (8) - 1 freq davidson (8) - 26 freq davidson's (8) - 1 freq linden (8) - 11 freq davidmerson (8) - 2 freq |
SoundEx code - D134 daft-like - 9 freq daft-luikin - 1 freq daftlike - 1 freq debaetless - 3 freq daffodils - 9 freq diveidwal - 2 freq daft-lookin - 1 freq deftly - 1 freq dovetail - 1 freq doubtless - 3 freq daffoddils - 1 freq dovetailin - 1 freq daft-lik - 2 freq dhftljfwyu - 1 freq davidleemedia - 1 freq davidalexander - 1 freq daftlimmy - 1 freq davidtaylor - 1 freq davidlinden - 2 freq |
MetaPhone code - TFTLNTN davidlinden - 2 freq |
DAVIDLINDEN |
| Time to execute Levenshtein function - 0.273201 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.464218 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.031660 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.042494 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.001198 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. |