| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aaronneville (0) - 1 freq annville (4) - 1 freq neville (5) - 14 freq farmville (5) - 1 freq brockville (5) - 1 freq barnhill (6) - 1 freq carnegie (6) - 8 freq sconnelly (6) - 7 freq jjconeill (6) - 2 freq ranegill (6) - 1 freq chronicle (6) - 15 freq macneill (6) - 2 freq rosemill (6) - 1 freq eamonnoneill (6) - 3 freq corbeille (6) - 1 freq marseilles (6) - 1 freq fareweill (6) - 6 freq mcconnell (6) - 4 freq brownejulie (6) - 1 freq aboynefire (6) - 1 freq €˜ronnie (6) - 2 freq karnegie (6) - 1 freq revile (6) - 3 freq jamesmelville (6) - 5 freq carolle (6) - 2 freq |
aaronneville (0) - 1 freq annville (5) - 1 freq neville (7) - 14 freq donnell (8) - 1 freq eamonnmallie (8) - 1 freq tannahill (8) - 7 freq reveille (8) - 1 freq donnelly (8) - 1 freq rnvll (8) - 1 freq eamonnoneill (8) - 3 freq connelly (8) - 1 freq bournville (8) - 1 freq farmville (8) - 1 freq brockville (8) - 1 freq ranegill (8) - 1 freq sconnelly (9) - 7 freq sneevilled (9) - 1 freq nerdsville (9) - 1 freq o'neill (9) - 5 freq airnestlie (9) - 1 freq cannilie (9) - 5 freq saville (9) - 5 freq oneill (9) - 2 freq somerville (9) - 3 freq aidanreilly (9) - 16 freq |
SoundEx code - A651 airn-baur - 1 freq airmpit - 1 freq armbecidon - 1 freq airmbans - 1 freq airmpits - 1 freq aroonaboot - 1 freq airmband - 1 freq airmfus - 1 freq airm-pit - 1 freq aroonaiberdeen - 1 freq aaronbastani - 1 freq aaronneville - 1 freq armpit - 1 freq |
MetaPhone code - ARNFL aaronneville - 1 freq |
AARONNEVILLE |
| Time to execute Levenshtein function - 0.260179 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.462278 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.030028 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.045918 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.001121 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. |