Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ardent (0) - 2 freq arden (1) - 2 freq advent (2) - 8 freq harkent (2) - 1 freq trident (2) - 18 freq rodent (2) - 4 freq aksent (2) - 4 freq prsent (2) - 1 freq agent (2) - 14 freq apent (2) - 29 freq warden (2) - 6 freq aroont (2) - 1 freq arrest (2) - 9 freq farrent (2) - 1 freq burdent (2) - 1 freq arena (2) - 41 freq urgent (2) - 16 freq assent (2) - 2 freq farden (2) - 1 freq arbeit (2) - 1 freq ascent (2) - 2 freq appent (2) - 7 freq aquent (2) - 6 freq wardens (2) - 2 freq areni (2) - 1 freq |
ardent (0) - 2 freq rodent (2) - 4 freq arden (2) - 2 freq rent (3) - 48 freq reident (3) - 2 freq oardert (3) - 3 freq urgent (3) - 16 freq haurdent (3) - 1 freq ladent (3) - 1 freq eident (3) - 47 freq wident (3) - 2 freq ordanit (3) - 3 freq dent (3) - 4 freq ordanyt (3) - 1 freq ordert (3) - 12 freq orient (3) - 1 freq urjent (3) - 1 freq ardently (3) - 1 freq herdent (3) - 1 freq yarbent (3) - 2 freq trident (3) - 18 freq burdent (3) - 1 freq eydent (3) - 20 freq aroont (3) - 1 freq verdant (4) - 7 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 - ARTNT airtin-oot - 1 freq ardent - 2 freq aritenite - 1 freq |
ARDENT |
Time to execute Levenshtein function - 0.362546 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.576995 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.044623 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.038646 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.000916 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. |