| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erikasbairn (0) - 1 freq erlendsbairn (4) - 1 freq pig-bairn (5) - 2 freq granbairns (5) - 11 freq margitsbairn (5) - 2 freq grandbairn (5) - 1 freq seik-sair (5) - 1 freq bookbairn (5) - 2 freq fairbairn (5) - 7 freq graunbairn (5) - 4 freq dream-bairn (5) - 1 freq draain (6) - 15 freq ryanair (6) - 3 freq eastern (6) - 25 freq prisin (6) - 1 freq astair (6) - 1 freq enshair (6) - 1 freq grandbairns (6) - 3 freq riskin (6) - 5 freq cribbin (6) - 1 freq alastair (6) - 10 freq eurasian (6) - 2 freq disdain (6) - 10 freq rayburn (6) - 1 freq wrastlin (6) - 3 freq |
erikasbairn (0) - 1 freq bookbairn (7) - 2 freq erlendsbairn (7) - 1 freq dream-bairn (8) - 1 freq raeburn (8) - 1 freq bucksburn (8) - 1 freq graunbairn (8) - 4 freq rayburn (8) - 1 freq lisburn (8) - 1 freq pig-bairn (8) - 2 freq grandbairn (8) - 1 freq fairbairn (8) - 7 freq margitsbairn (8) - 2 freq ee-sairin (9) - 1 freq lovebairn (9) - 1 freq reasin (9) - 2 freq restairt (9) - 2 freq yralban (9) - 1 freq roastin (9) - 23 freq ribban (9) - 1 freq raspin (9) - 5 freq ridseard (9) - 1 freq reassurin (9) - 7 freq risan (9) - 7 freq bullbairn (9) - 1 freq |
SoundEx code - E622 erses - 23 freq erchie's - 6 freq erika's - 2 freq erikasbairn - 1 freq erches - 1 freq erzygfvwvl - 1 freq eerjeestnoclueduprite - 1 freq ericajanepoet - 2 freq |
MetaPhone code - ERKSBRN erikasbairn - 1 freq |
ERIKASBAIRN |
| Time to execute Levenshtein function - 0.211982 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.375498 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.028369 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.040957 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.000950 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. |