| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quiver (0) - 6 freq cuiver (1) - 4 freq quiver' (1) - 1 freq quaver (1) - 2 freq quivers (1) - 1 freq guiser (2) - 1 freq suiner (2) - 27 freq fiver (2) - 46 freq reiver (2) - 22 freq quidder (2) - 1 freq quaiter (2) - 4 freq muived (2) - 22 freq sliver (2) - 8 freq iver (2) - 312 freq neiver (2) - 1 freq chiver (2) - 1 freq haiver (2) - 6 freq kuiper (2) - 11 freq oliver (2) - 10 freq quile (2) - 1 freq 'niver (2) - 2 freq cuuver (2) - 1 freq quater (2) - 5 freq wuiven (2) - 3 freq quiet (2) - 239 freq |
quiver (0) - 6 freq quaver (1) - 2 freq quivers (2) - 1 freq quiver' (2) - 1 freq cuiver (2) - 4 freq quativer (3) - 4 freq a-quiver (3) - 1 freq taiver (3) - 2 freq queer (3) - 146 freq siver (3) - 2 freq kiver (3) - 5 freq caiver (3) - 1 freq river (3) - 264 freq faiver (3) - 3 freq houiver (3) - 17 freq quiverin (3) - 6 freq niver (3) - 849 freq wiver (3) - 1 freq aiver (3) - 3 freq quivered (3) - 2 freq uvver (3) - 10 freq luver (3) - 8 freq diver (3) - 5 freq queirer (3) - 1 freq daiver (3) - 4 freq |
SoundEx code - Q160 quiver - 6 freq quaver - 2 freq quiver' - 1 freq qubare - 1 freq qxypr - 1 freq qgphr - 1 freq |
MetaPhone code - KFR cover - 148 freq quiver - 6 freq quaver - 2 freq gaffer - 35 freq kiver - 5 freq cuuver - 1 freq quiver' - 1 freq caviar - 11 freq cuiver - 4 freq 'cover - 1 freq kivver - 6 freq gfur - 1 freq caviaar - 1 freq gowfer - 1 freq caviare - 1 freq kivvver - 1 freq kaffir - 2 freq caiver - 1 freq cfar - 1 freq cuvver - 1 freq |
QUIVER |
| Time to execute Levenshtein function - 0.184739 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.386281 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.027712 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.041189 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.001053 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. |