Timeline for Find a best fuzzy match for a string
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 12, 2019 at 8:11 | answer | added | JanM | timeline score: 2 | |
| Mar 12, 2019 at 3:00 | history | tweeted | twitter.com/StackCodeReview/status/1105302610821763072 | ||
| Mar 11, 2019 at 15:43 | vote | accept | barciewicz | ||
| Mar 11, 2019 at 11:17 | history | became hot network question | |||
| Mar 11, 2019 at 8:46 | answer | added | 200_success | timeline score: 7 | |
| Mar 11, 2019 at 8:43 | comment | added | Dillon Davis | Someone else asked about this on stack overflow once before, and I suggested they try downloading python-levenshtein since the github page suggests it may speed up execution by 4-10x. They later confirmed that it did in fact speed up their solution, so you may want to try that as well. | |
| Mar 11, 2019 at 8:38 | history | edited | 200_success | CC BY-SA 4.0 |
edited tags; edited title
|
| Mar 11, 2019 at 8:33 | history | asked | barciewicz | CC BY-SA 4.0 |