| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adrianlambert (0) - 2 freq adriandlambert (1) - 1 freq arrangement (6) - 17 freq clambert (6) - 2 freq lambert (6) - 3 freq drittlaboot (6) - 1 freq advancement (6) - 6 freq dramer (7) - 2 freq dianae (7) - 1 freq adminster (7) - 1 freq adrianmckinty (7) - 1 freq larbert (7) - 2 freq daanert (7) - 1 freq forwandert (7) - 2 freq draapet (7) - 1 freq clamber (7) - 5 freq driller (7) - 5 freq coriander (7) - 1 freq ianmaher (7) - 1 freq awrabest (7) - 4 freq anointment (7) - 1 freq advantage (7) - 47 freq bricklayers (7) - 1 freq dialect (7) - 262 freq derailment (7) - 2 freq |
adrianlambert (0) - 2 freq adriandlambert (2) - 1 freq lambert (9) - 3 freq clambert (9) - 2 freq remembert (10) - 10 freq lumbert (10) - 7 freq drill-bit (10) - 1 freq derailment (10) - 2 freq dismemberit (10) - 1 freq yarnbombers (10) - 1 freq clamberit (10) - 1 freq claimbert (10) - 1 freq drittlaboot (10) - 1 freq advancement (10) - 6 freq arrangement (10) - 17 freq pairlament (11) - 180 freq arrengment (11) - 1 freq arrangemint (11) - 1 freq miriambrett (11) - 1 freq doonhamers (11) - 1 freq drinkers (11) - 4 freq daanert (11) - 1 freq aroonaboot (11) - 1 freq dramer (11) - 2 freq daizzlement (11) - 1 freq |
SoundEx code - A365 adorin - 1 freq adrenaline - 20 freq adrienne - 1 freq adherents - 8 freq adherence - 3 freq adherent - 1 freq adornt - 1 freq adorn - 6 freq adorns - 2 freq adorned - 2 freq atrim - 1 freq attorney - 1 freq adrenaline-fueled - 1 freq atrms - 1 freq adoring - 1 freq atremble - 1 freq aitherins - 1 freq aw-terrain - 1 freq adrenalin - 4 freq adornin - 1 freq atrium - 1 freq adornments - 1 freq a-tearin - 1 freq awtroon - 26 freq adrian - 4 freq audreymarks - 2 freq adrianmckinty - 1 freq adrianflux - 1 freq adriandlambert - 1 freq adrianlambert - 2 freq |
MetaPhone code - ATRNLMRT adrianlambert - 2 freq |
ADRIANLAMBERT |
| Time to execute Levenshtein function - 0.459999 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.563805 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.037871 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.048061 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.000855 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. |