| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ardoyne (0) - 2 freq €œardoyne (2) - 1 freq rewyne (3) - 3 freq oxdowne (3) - 1 freq aroun (3) - 129 freq ariadne (3) - 4 freq airborne (3) - 4 freq pardon (3) - 31 freq ardent (3) - 2 freq a'dyn (3) - 1 freq adorn (3) - 6 freq aroont (3) - 1 freq alone (3) - 72 freq rejyne (3) - 2 freq marone (3) - 1 freq ab'yne (3) - 1 freq oyne (3) - 3 freq growne (3) - 10 freq ardour (3) - 1 freq dwyne (3) - 23 freq aroond (3) - 513 freq drone (3) - 19 freq €˜done (3) - 1 freq annone (3) - 1 freq around (3) - 158 freq |
ardoyne (0) - 2 freq arden (3) - 2 freq ariadne (3) - 4 freq 'done (4) - 4 freq hardon (4) - 2 freq cardoon (4) - 1 freq rhone (4) - 2 freq jardine (4) - 29 freq undone (4) - 4 freq dyne (4) - 2 freq doune (4) - 3 freq done (4) - 821 freq ardern (4) - 1 freq rone (4) - 2 freq crdon (4) - 1 freq ordina (4) - 1 freq rodono (4) - 1 freq arlene (4) - 13 freq sardine (4) - 1 freq rodney (4) - 1 freq sardane (4) - 1 freq arne (4) - 1 freq adoun (4) - 2 freq aroon (4) - 576 freq €œardoyne (4) - 1 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 |
ARDOYNE |
| Time to execute Levenshtein function - 0.232647 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.383179 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.027833 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.039381 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.000893 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. |