| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eringrieve (0) - 7 freq ringpiece (3) - 1 freq retrieve (4) - 7 freq reprieve (4) - 5 freq e-scrieve (4) - 1 freq grieve (4) - 52 freq riggies (5) - 1 freq kelvingrove (5) - 5 freq springtime (5) - 10 freq thingie (5) - 9 freq dingied (5) - 3 freq principle (5) - 27 freq entrie (5) - 5 freq briggie (5) - 2 freq wringe (5) - 1 freq crinoline (5) - 1 freq mingie (5) - 2 freq meringue (5) - 3 freq orgreave (5) - 2 freq thingmie (5) - 1 freq emigrate (5) - 2 freq ringer (5) - 6 freq kingriks (5) - 1 freq brendrie (5) - 3 freq bringer (5) - 1 freq |
eringrieve (0) - 7 freq ringpiece (5) - 1 freq orgreave (6) - 2 freq ringer (6) - 6 freq grieve (6) - 52 freq retrieve (6) - 7 freq reprieve (6) - 5 freq mangrove (6) - 1 freq ingrid (7) - 17 freq greve (7) - 2 freq ringed (7) - 7 freq rangers (7) - 55 freq angrier (7) - 6 freq keingryke (7) - 5 freq penitrive (7) - 1 freq raingeese (7) - 1 freq engraved (7) - 6 freq ringlet (7) - 1 freq erdinger (7) - 1 freq arrive (7) - 51 freq ringel-ee (7) - 1 freq argive (7) - 1 freq ringtone (7) - 1 freq lingerie (7) - 1 freq cringers (7) - 2 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 42 freq ermchair - 10 freq earnestly - 4 freq earrings - 7 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 1 freq earns - 3 freq erns - 1 freq ee-wharms - 1 freq ern-cairriers - 1 freq erin's - 3 freq ernie's - 2 freq erm-chair - 1 freq eernest-like - 1 freq erne's - 1 freq euromosaic - 1 freq eerans - 1 freq ernes - 1 freq eringrieve - 7 freq eerrans - 1 freq |
MetaPhone code - ERNKRF eringrieve - 7 freq |
ERINGRIEVE |
| Time to execute Levenshtein function - 0.197086 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.379317 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.030403 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.056595 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.003729 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. |