| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airlann (0) - 20 freq airlannn (1) - 2 freq airlan (1) - 174 freq airland (1) - 2 freq birlan (2) - 18 freq airtans (2) - 3 freq airline (2) - 1 freq airtan (2) - 2 freq irland (2) - 6 freq fairlan' (2) - 1 freq birlinn (2) - 8 freq dirlan (2) - 3 freq tirlan (2) - 5 freq gairland (2) - 1 freq airplane (2) - 4 freq eireann (2) - 1 freq mairlan (2) - 1 freq airlan's (2) - 10 freq airlann's (2) - 1 freq grann (3) - 1 freq tarlan (3) - 4 freq nirvana (3) - 2 freq airlift (3) - 1 freq tarland (3) - 4 freq strann (3) - 1 freq |
airlann (0) - 20 freq airland (2) - 2 freq airlan (2) - 174 freq airlannn (2) - 2 freq eireann (3) - 1 freq birlinn (3) - 8 freq irland (3) - 6 freq airline (3) - 1 freq irelan (4) - 3 freq yirlins (4) - 1 freq alanna (4) - 2 freq arlene (4) - 13 freq arknn (4) - 1 freq airlines (4) - 1 freq alonn (4) - 1 freq ireland (4) - 142 freq airnin (4) - 1 freq eirinn (4) - 1 freq irelan' (4) - 1 freq dirlan (4) - 3 freq airlan's (4) - 10 freq gairland (4) - 1 freq birlan (4) - 18 freq fairlan' (4) - 1 freq airlann's (4) - 1 freq |
SoundEx code - A645 airlann's - 1 freq airlan - 174 freq arlene - 13 freq airlan's - 10 freq airland - 2 freq airlann - 20 freq airlannn - 2 freq airline - 1 freq arlenefoster - 1 freq arlinklater - 1 freq airlines - 1 freq |
MetaPhone code - ARLN airlan - 174 freq arlene - 13 freq airlann - 20 freq airlannn - 2 freq airline - 1 freq |
AIRLANN |
| Time to execute Levenshtein function - 0.303591 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.677917 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.075145 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.036730 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.000798 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. |