uncleflo
Registered since September 28th, 2017
Has a total of 4281 bookmarks.
Showing top Tags within 1 bookmarks
howto information development guide reference administration design website software solution online service product business uk tool company linux code server application system web list video marine create data experience tutorial description explanation learn technology build article blog world project boat download windows lookup security free performance javascript technical london beautiful control network tools support course file research purchase image library programming youtube example php construction install opensource community html quality computer feature profile power browser music platform process mobile work user share manage professional database hardware buy industry advice internet dance developer installation search 3d camera customer access travel material standard money test develop documentation review css engineering photography webdesign engine device digital speed event api source management question program client phone discussion content simple story water marketing yacht app account setup interface package idea fast communication compare cheap script market study easy live google resource operation demonstration contact startup
Tag selected: levenshtein.
Looking up levenshtein tag. Showing 1 results. Clear
PHP: levenshtein
Saved by uncleflo on January 19th, 2011.
levenshtein — Calculate Levenshtein distance between two string: int levenshtein ( string $str1 , string $str2 ). Or: int levenshtein ( string $str1 , string $str2 , int $cost_ins , int $cost_rep , int $cost_del ). The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform str1 into str2. The complexity of the algorithm is O(m*n), where n and m are the length of str1 and str2 (rather good when compared to similar_text(), which is O(max(n,m)**3), but still expensive). In its simplest form the function will take only the two strings as parameter and will calculate just the number of insert, replace and delete operations needed to transform str1 into str2. A second variant will take three additional parameters that define the cost of insert, replace and delete operations. This is more general and adaptive than variant one, but not as efficient.
php programming function logic search similar compare levenshtein text string
No further bookmarks found.