php.net |  support |  documentation |  report a bug |  advanced search |  search howto |  statistics |  random bug |  login
Request #17617 levenshtein() param for faster return
Submitted: 2002-06-05 18:33 UTC Modified: 2013-07-12 12:40 UTC
Votes:1
Avg. Score:5.0 ± 0.0
Reproduced:1 of 1 (100.0%)
Same Version:1 (100.0%)
Same OS:1 (100.0%)
From: gonfidentschal at hotmail dot com Assigned:
Status: Wont fix Package: *General Issues
PHP Version: 4.1.2 OS: all
Private report: No CVE-ID: None
View Add Comment Developer Edit
Anyone can comment on a bug. Have a simpler test case? Does it work for you on a different platform? Let us know!
Just going to say 'Me too!'? Don't clutter the database with that please — but make sure to vote on the bug!
Your email address:
MUST BE VALID
Solve the problem:
33 - 31 = ?
Subscribe to this entry?

 
 [2002-06-05 18:33 UTC] gonfidentschal at hotmail dot com
in my case, i want to find strings that are similar to a given one. so a lev() return of >2 means i throw that string away. 

maybe another param to levenshtein() could help speed up the function, in that it could return when the 3rd mismatch was found. it would not have to do it's job to the end.

anyway, i'm surprised how fast it is already. :)

greetings
fab



Patches

Add a Patch

Pull Requests

Add a Pull Request

History

AllCommentsChangesGit/SVN commitsRelated reports
 [2013-07-12 12:40 UTC] maarten@php.net
-Status: Open +Status: Wont fix -Package: Feature/Change Request +Package: *General Issues
 [2013-07-12 12:40 UTC] maarten@php.net
No response in 11 years, so safe to conclude that there's little interest in this feature. Also a very good change issue starter also has moved on (other project / chosen better algorithm).
 
PHP Copyright © 2001-2024 The PHP Group
All rights reserved.
Last updated: Fri Apr 26 16:01:29 2024 UTC