| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airtins (0) - 8 freq airtin (1) - 36 freq airtans (1) - 3 freq mairtins (1) - 1 freq pairtins (1) - 1 freq curtins (2) - 5 freq aisins (2) - 1 freq firkins (2) - 2 freq mirkins (2) - 1 freq birlins (2) - 1 freq airtists (2) - 20 freq mairgins (2) - 1 freq airtan (2) - 2 freq fairtin (2) - 1 freq mairkins (2) - 1 freq airtill (2) - 1 freq mairjins (2) - 1 freq pairties (2) - 94 freq mertins (2) - 2 freq airin (2) - 4 freq aiblins (2) - 282 freq airis (2) - 1 freq aittin (2) - 1 freq pairins (2) - 1 freq airlines (2) - 1 freq |
airtins (0) - 8 freq airtans (1) - 3 freq pairtins (2) - 1 freq mairtins (2) - 1 freq airtin (2) - 36 freq gairtens (3) - 2 freq airts (3) - 356 freq martins (3) - 2 freq yirlins (3) - 1 freq airtan (3) - 2 freq arins (3) - 1 freq airlines (3) - 1 freq mertins (3) - 2 freq raitions (3) - 1 freq curtins (3) - 5 freq errins (4) - 1 freq retinas (4) - 1 freq ootins (4) - 2 freq retains (4) - 4 freq railins (4) - 22 freq ritirs (4) - 1 freq yerlins (4) - 1 freq rtin (4) - 1 freq soartins (4) - 2 freq attens (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 - ARTNS airtins - 8 freq airtans - 3 freq |
AIRTINS |
| Time to execute Levenshtein function - 0.309343 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.507483 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.027585 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.044663 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. |