| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loganwilson (0) - 1 freq bryanwilson (3) - 1 freq rabwilson (4) - 3 freq location (5) - 35 freq localloon (5) - 1 freq loanins (5) - 7 freq wilson (5) - 48 freq logans (5) - 1 freq ellenrwilson (5) - 1 freq windywilson (5) - 4 freq lawson (5) - 2 freq iewilson (5) - 1 freq neilson (5) - 11 freq glenhswilson (5) - 1 freq garrison (5) - 9 freq mwilson (5) - 1 freq gerrywilson (5) - 1 freq loanin (5) - 11 freq howieson (5) - 2 freq organisin (5) - 6 freq kwilson (5) - 2 freq cognition (5) - 1 freq locails (5) - 2 freq loganair (5) - 3 freq liaison (5) - 3 freq |
loganwilson (0) - 1 freq bryanwilson (5) - 1 freq ellenrwilson (7) - 1 freq rabwilson (7) - 3 freq gerrywilson (8) - 1 freq neilson (8) - 11 freq organisan (8) - 1 freq iewilson (8) - 1 freq kwilson (8) - 2 freq organisin (8) - 6 freq mwilson (8) - 1 freq lawson (8) - 2 freq wilson (8) - 48 freq logans (8) - 1 freq windywilson (8) - 4 freq euanwelsh (9) - 2 freq liamneeson (9) - 1 freq lowsin (9) - 47 freq lloydwatson (9) - 2 freq organeesin (9) - 1 freq lowsen (9) - 2 freq lentils (9) - 2 freq ragnails (9) - 1 freq lindaannewilson (9) - 6 freq wulson (9) - 8 freq |
SoundEx code - L254 laganaweel - 1 freq loesome-like - 1 freq leaguemeltdown - 6 freq loganwilson - 1 freq lagganhill - 1 freq |
MetaPhone code - LKNWLSN loganwilson - 1 freq |
LOGANWILSON |
| Time to execute Levenshtein function - 0.236294 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.456968 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.027644 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.037219 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.000857 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. |