| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airydaniel (0) - 1 freq airdrie (4) - 9 freq archangel (4) - 2 freq biryani' (4) - 1 freq daniel (4) - 128 freq airplane (4) - 4 freq €˜daniel (4) - 7 freq airdie (4) - 2 freq 'daniel (4) - 1 freq arcangel (4) - 1 freq biryani (4) - 1 freq spaniel (5) - 4 freq lairdlie (5) - 1 freq rainiangel (5) - 1 freq pianie (5) - 22 freq armani (5) - 1 freq hairdnes (5) - 1 freq fairytales (5) - 1 freq airborne (5) - 4 freq ordance (5) - 1 freq arranged (5) - 33 freq dairyman (5) - 2 freq findavie (5) - 1 freq tirannie (5) - 1 freq gairdner (5) - 17 freq |
airydaniel (0) - 1 freq daniel (5) - 128 freq 'daniel (5) - 1 freq airdrie (6) - 9 freq ordance (6) - 1 freq daniela (6) - 2 freq rydand (6) - 2 freq arcangel (6) - 1 freq ordanis (6) - 1 freq ordanit (6) - 3 freq €˜daniel (6) - 7 freq airdie (6) - 2 freq aaredies (7) - 1 freq arden (7) - 2 freq adance (7) - 1 freq pairdoned (7) - 1 freq airned (7) - 1 freq yairdairm (7) - 1 freq sardane (7) - 1 freq areddie (7) - 1 freq ransel (7) - 1 freq airtans (7) - 3 freq ryanjl (7) - 2 freq rodney (7) - 1 freq aareadies (7) - 39 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 - ARTNL airydaniel - 1 freq |
AIRYDANIEL |
| Time to execute Levenshtein function - 0.214017 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.406371 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.031264 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.038555 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.001322 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. |