| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awrfie (0) - 2 freq awfie (1) - 392 freq awffie (1) - 1 freq awfle (2) - 1 freq awfae (2) - 29 freq arnie (2) - 5 freq airie (2) - 1 freq airlie (2) - 47 freq awfe (2) - 4 freq lawrie (2) - 4 freq awtie (2) - 1 freq affie (2) - 6 freq awie (2) - 1 freq airdie (2) - 2 freq arvie (2) - 1 freq awfte (2) - 1 freq airfix (2) - 1 freq 'awfie (2) - 8 freq argie (2) - 17 freq airmie (2) - 15 freq awhie (2) - 2 freq aerlie (2) - 10 freq awfil (2) - 4 freq wyfie (2) - 2 freq aurrie (2) - 1 freq |
awrfie (0) - 2 freq awffie (2) - 1 freq awfie (2) - 392 freq awfe (3) - 4 freq wyfie (3) - 2 freq wifie (3) - 328 freq awrite (3) - 36 freq awfi (3) - 5 freq awfae (3) - 29 freq wrait (4) - 6 freq warkie (4) - 1 freq worrie (4) - 3 freq awfa (4) - 90 freq arfu (4) - 1 freq wirrie (4) - 6 freq wifi (4) - 7 freq awffy (4) - 1 freq warie (4) - 1 freq wirdie (4) - 17 freq awfu (4) - 132 freq wife (4) - 818 freq owre (4) - 607 freq wraik (4) - 1 freq wurdie (4) - 9 freq awroon (4) - 1 freq |
SoundEx code - A610 arrive - 52 freq awrfie - 2 freq arabia - 3 freq arab - 4 freq arabia' - 1 freq arabi - 1 freq arp - 1 freq ahrb - 1 freq arvie - 1 freq arb - 4 freq arfu - 1 freq |
MetaPhone code - ARF arrive - 52 freq awrfie - 2 freq 'aaargh - 1 freq 'aargh - 1 freq arghhh - 1 freq aaaargh - 1 freq argh - 4 freq €˜aaaargh - 1 freq €œaargh - 2 freq arvie - 1 freq aaaaaargh - 1 freq arfu - 1 freq |
AWRFIE |
| Time to execute Levenshtein function - 0.190150 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.328704 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.027024 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.036943 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.000907 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. |