| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brora (0) - 15 freq rora (1) - 2 freq brom (2) - 1 freq flora (2) - 11 freq borra (2) - 2 freq lora (2) - 1 freq broon (2) - 500 freq burra (2) - 62 freq broat (2) - 14 freq broch (2) - 86 freq boa (2) - 16 freq 'rona (2) - 1 freq broo (2) - 164 freq brose (2) - 22 freq roka (2) - 3 freq uprora (2) - 1 freq brods (2) - 6 freq bron (2) - 1 freq broup (2) - 1 freq bore (2) - 41 freq brava (2) - 1 freq boord (2) - 157 freq braa (2) - 60 freq brr (2) - 5 freq smora (2) - 1 freq |
brora (0) - 15 freq birra (2) - 9 freq brer (2) - 2 freq borr (2) - 1 freq brur (2) - 23 freq brr (2) - 5 freq burra (2) - 62 freq rora (2) - 2 freq barra (2) - 27 freq borra (2) - 2 freq broona (3) - 1 freq arra (3) - 32 freq brook (3) - 22 freq brox (3) - 2 freq born (3) - 333 freq baira (3) - 1 freq grory (3) - 1 freq brurs (3) - 1 freq brod (3) - 18 freq broak (3) - 2 freq orra (3) - 172 freq borh (3) - 1 freq erra (3) - 3 freq aurora (3) - 10 freq broad (3) - 54 freq |
SoundEx code - B660 beirer - 1 freq brawer - 9 freq brur - 23 freq breer - 11 freq brier - 5 freq bearer - 7 freq barrier - 13 freq brer - 2 freq brewery - 6 freq brawery - 1 freq bruar - 5 freq braar - 1 freq brewer - 1 freq briar - 1 freq €œbriar - 1 freq brurr - 1 freq braer - 1 freq brora - 15 freq |
MetaPhone code - BRR beirer - 1 freq brur - 23 freq breer - 11 freq brier - 5 freq bearer - 7 freq barrier - 13 freq brer - 2 freq bruar - 5 freq braar - 1 freq briar - 1 freq €œbriar - 1 freq brurr - 1 freq braer - 1 freq brora - 15 freq |
BRORA |
| Time to execute Levenshtein function - 0.234050 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.344016 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.027334 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.036622 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.000864 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. |