| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| a-quiver (0) - 1 freq quiver (2) - 6 freq a-dunder (3) - 1 freq aiver (3) - 3 freq cuiver (3) - 4 freq quivers (3) - 1 freq quiver' (3) - 1 freq quaver (3) - 2 freq acquire (3) - 3 freq acquired (3) - 10 freq houiver (3) - 17 freq pruive (4) - 22 freq cruive (4) - 1 freq guizer (4) - 4 freq appruived (4) - 1 freq cuiter (4) - 1 freq aquinas (4) - 1 freq ainer (4) - 2 freq admirer (4) - 4 freq auler (4) - 17 freq behuives (4) - 1 freq sliver (4) - 8 freq whaniver (4) - 108 freq cuuver (4) - 1 freq fa-ivver (4) - 2 freq |
a-quiver (0) - 1 freq quiver (3) - 6 freq quaver (4) - 2 freq quiver' (5) - 1 freq acquire (5) - 3 freq houiver (5) - 17 freq quivers (5) - 1 freq aiver (5) - 3 freq cuiver (5) - 4 freq quater (6) - 5 freq neiver (6) - 1 freq quaiter (6) - 4 freq cliver (6) - 12 freq faiver (6) - 3 freq require (6) - 10 freq chiver (6) - 1 freq fativer (6) - 1 freq quiverin (6) - 7 freq slaiver (6) - 1 freq aver (6) - 4 freq houivver (6) - 3 freq uvver (6) - 10 freq kiver (6) - 5 freq n'iver (6) - 4 freq finiver (6) - 18 freq |
SoundEx code - A216 a-quiver - 1 freq aspar - 1 freq aspirins - 1 freq aspereens - 1 freq aspiration - 4 freq aspersions - 1 freq agpression - 1 freq aspire - 4 freq aspirated - 1 freq aspirations - 9 freq a-spoartin - 1 freq aspirin - 3 freq achievers - 1 freq asperities - 1 freq asprin - 1 freq asper- - 1 freq asperger - 1 freq aspirational - 2 freq aspiret - 1 freq aspirate - 1 freq askboris - 1 freq aspiring - 1 freq azhpbr - 1 freq axfroq - 1 freq axcprzrjm - 1 freq |
MetaPhone code - AKFR a-quiver - 1 freq |
A-QUIVER |
| Time to execute Levenshtein function - 0.214275 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.358416 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.027314 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.036979 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.004584 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. |