| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grange (0) - 4 freq orange (1) - 136 freq grane (1) - 4 freq granme (1) - 1 freq grunge (1) - 1 freq grande (1) - 1 freq gange (1) - 3 freq range (1) - 93 freq granut (2) - 1 freq grandes (2) - 1 freq grace (2) - 153 freq wranged (2) - 2 freq gracie (2) - 21 freq orangey (2) - 2 freq ange (2) - 1 freq trunge (2) - 1 freq gangs (2) - 147 freq fange (2) - 1 freq grandie (2) - 1 freq glance (2) - 47 freq change (2) - 299 freq ornge (2) - 1 freq ranged (2) - 1 freq vrang (2) - 8 freq grasse (2) - 1 freq |
grange (0) - 4 freq grunge (1) - 1 freq range (2) - 93 freq orange (2) - 136 freq grande (2) - 1 freq gange (2) - 3 freq granme (2) - 1 freq grane (2) - 4 freq fringe (3) - 36 freq granit (3) - 2 freq grant (3) - 101 freq runge (3) - 2 freq geang (3) - 3 freq garage (3) - 56 freq grans (3) - 2 freq granda (3) - 274 freq graunie (3) - 1 freq wrang (3) - 811 freq trang (3) - 15 freq oarange (3) - 1 freq gunge (3) - 3 freq crang (3) - 2 freq arrange (3) - 14 freq raenge (3) - 1 freq gyang (3) - 177 freq |
SoundEx code - G652 greyness - 5 freq grunchin - 3 freq grins - 19 freq grimaced - 3 freq grimace - 3 freq graan-sin - 1 freq grans - 2 freq green's - 1 freq gran's - 11 freq greenock - 40 freq grangemooth - 3 freq greens - 55 freq greeance - 18 freq guernica - 1 freq groans - 6 freq grunny's - 6 freq grunnie's - 2 freq girns - 19 freq grannies - 20 freq granny's - 53 freq grains - 11 freq grooms - 2 freq greenocktoun - 1 freq grannie's - 31 freq greying - 2 freq grun's - 3 freq gairnseys - 1 freq growing - 12 freq greenichtie - 1 freq greenish-grey - 1 freq grimness - 2 freq gramsci - 1 freq grahams - 2 freq gurns - 2 freq granchildren - 3 freq granchildren'll - 1 freq grunnies - 4 freq grunch - 1 freq greenness - 3 freq granzies - 1 freq groom's - 2 freq growin's - 1 freq graham's - 1 freq gransha - 1 freq garrins - 1 freq greeances - 1 freq garnsey - 1 freq gruims - 1 freq gramsan - 2 freq garnished - 4 freq gormiess - 1 freq greengowd - 1 freq granes - 1 freq growins - 1 freq greenside - 2 freq geryon's - 1 freq greengables - 1 freq grönkulla - 1 freq greengables' - 1 freq green-gless - 1 freq greenest - 2 freq greenockcut - 1 freq griens - 1 freq greenhoose - 24 freq grange - 4 freq grunched - 2 freq gronach - 1 freq gruns - 7 freq germs - 4 freq grunstane - 19 freq grangemouth - 2 freq grunstanes - 2 freq graniched - 1 freq grayhens - 1 freq grinch - 1 freq gorms - 2 freq greins - 1 freq greenhouse - 3 freq grunsheets - 1 freq greengage - 1 freq grunnnswell - 1 freq grannys' - 1 freq grimacing - 1 freq grunge - 1 freq grungers - 1 freq greenwich - 1 freq grams - 2 freq gromish - 1 freq greenshield - 1 freq grunies - 1 freq grunnies - 1 freq grannyskeetisnuts - 1 freq gornickle - 1 freq groomsport - 1 freq graemec - 4 freq grahamspiers - 2 freq garyinnes - 5 freq grahamjohnjones - 1 freq grnjyv - 1 freq greenwash - 1 freq grahamgarden - 1 freq greenspacetrust - 1 freq growingtheirown - 1 freq grungeviking - 1 freq grannies' - 1 freq |
MetaPhone code - KRNJ carnage - 15 freq carnegie - 8 freq cringe - 33 freq creenge - 19 freq grange - 4 freq creinge - 3 freq grunge - 1 freq karnegie - 1 freq |
GRANGE |
| Time to execute Levenshtein function - 0.288968 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.677793 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.028311 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.103236 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.001050 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. |