| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adambienkov (0) - 1 freq damiens (5) - 1 freq ambience (5) - 4 freq damien (5) - 2 freq ambcetion (6) - 1 freq adgmbfhvox (6) - 1 freq damian (6) - 2 freq rablennox (6) - 17 freq admeission (6) - 1 freq alamein (6) - 1 freq lambikie (6) - 1 freq arabians (6) - 1 freq admin (6) - 5 freq adaption (6) - 1 freq adamrooney (6) - 1 freq flamingos (6) - 3 freq lambie (6) - 3 freq lambeen (6) - 3 freq dampener (6) - 1 freq sambies (6) - 1 freq dominion (6) - 4 freq dabbin (6) - 7 freq admins (6) - 1 freq damnin (6) - 2 freq arabian (6) - 1 freq |
adambienkov (0) - 1 freq damien (8) - 2 freq dumbin (8) - 2 freq ambience (8) - 4 freq dominos (9) - 5 freq daybreak (9) - 1 freq ambedka (9) - 8 freq dampen (9) - 1 freq domino (9) - 10 freq lambeens (9) - 2 freq damnin (9) - 2 freq adamson (9) - 1 freq dampened (9) - 2 freq dominik (9) - 1 freq databanks (9) - 1 freq dmnk (9) - 1 freq mbanks (9) - 1 freq dumbies (9) - 1 freq admins (9) - 1 freq adamant (9) - 5 freq lambin (9) - 19 freq lambing (9) - 1 freq dabbin (9) - 7 freq lambeen (9) - 3 freq lambikie (9) - 1 freq |
SoundEx code - A351 attempt - 77 freq attemptit - 7 freq attempts - 25 freq attemps - 3 freq attemptin - 9 freq attempted - 10 freq attenborough - 8 freq attenborough's - 1 freq attamptat - 1 freq attemptet - 1 freq atombomblasta - 1 freq attempe - 1 freq atom-fykie - 1 freq attemp - 5 freq attempting - 3 freq attainable - 2 freq attimpt - 1 freq aidanflynn - 1 freq adambienkov - 1 freq |
MetaPhone code - ATMNKF adambienkov - 1 freq |
ADAMBIENKOV |
| Time to execute Levenshtein function - 0.203789 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.365030 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.027682 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.036733 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.000776 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. |