| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ariadne (0) - 4 freq arcade (2) - 8 freq marianne (2) - 1 freq arcana (3) - 1 freq arrange (3) - 14 freq friable (3) - 2 freq marinade (3) - 3 freq briant (3) - 1 freq abiine (3) - 3 freq rine (3) - 1 freq adrian (3) - 4 freq aidge (3) - 5 freq rane (3) - 3 freq arizona (3) - 1 freq variant (3) - 16 freq armand (3) - 1 freq arisan (3) - 1 freq marianna (3) - 1 freq alreadee (3) - 1 freq ariddy (3) - 32 freq asians (3) - 4 freq araise (3) - 1 freq arisin (3) - 1 freq aniline (3) - 9 freq crane (3) - 7 freq |
ariadne (0) - 4 freq ardoyne (3) - 2 freq aariddie (4) - 1 freq arden (4) - 2 freq urine (4) - 2 freq arnae (4) - 18 freq airdie (4) - 2 freq readan (4) - 10 freq ride (4) - 69 freq arid (4) - 4 freq ridin (4) - 59 freq aready (4) - 24 freq arne (4) - 1 freq armani (4) - 1 freq arisen (4) - 4 freq readin (4) - 366 freq rade (4) - 24 freq didne (4) - 1 freq aran (4) - 5 freq arran (4) - 15 freq readeen (4) - 1 freq readien (4) - 1 freq ridan (4) - 1 freq roadin (4) - 87 freq arlene (4) - 13 freq |
SoundEx code - A635 arithmetic-ambition - 1 freq ariadne - 4 freq airtin - 36 freq arithmetic-ambeition - 1 freq arithmetic - 6 freq arden - 2 freq arithmeticambition - 1 freq airtins - 8 freq arithmetic-ambeetion - 1 freq airtans - 3 freq ardnamurchan's - 1 freq airtan - 2 freq arithmetieambition - 1 freq artemis - 8 freq airtin-oot - 1 freq ardent - 2 freq ardently - 1 freq ardoyne - 2 freq €œardoyne - 1 freq art-nouveau - 1 freq artmin - 1 freq aritenite - 1 freq award-winning - 1 freq airydaniel - 1 freq aredandwhitefan - 1 freq artemchigvintse - 2 freq artem - 1 freq artymortyarty - 1 freq airtime - 1 freq awarding - 1 freq |
MetaPhone code - ARTN ariadne - 4 freq airtin - 36 freq arden - 2 freq airtan - 2 freq ardoyne - 2 freq €œardoyne - 1 freq |
ARIADNE |
| Time to execute Levenshtein function - 0.526756 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.575260 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.071355 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.039391 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.000775 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. |