Timeline for Match dictionary to misspelled word, corner cases
Current License: CC BY-SA 3.0
26 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2018 at 8:44 | answer | added | gnasher729 | timeline score: 1 | |
| Feb 28, 2018 at 2:39 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 29, 2018 at 2:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 30, 2017 at 1:50 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 30, 2017 at 0:56 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 31, 2017 at 0:22 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 30, 2017 at 23:56 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 31, 2017 at 23:13 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 1, 2017 at 22:29 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 2, 2017 at 21:55 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 2, 2017 at 21:47 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 3, 2017 at 21:47 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 3, 2017 at 21:39 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 4, 2017 at 21:23 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 2, 2017 at 20:32 | answer | added | paparazzo | timeline score: 0 | |
| Feb 2, 2017 at 19:41 | history | edited | D.W.♦ | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Feb 2, 2017 at 19:15 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 2 characters in body
|
| Feb 2, 2017 at 17:37 | answer | added | D.W.♦ | timeline score: 0 | |
| Feb 2, 2017 at 16:17 | comment | added | Nyfiken Gul | Hm, maybe.. Sounds kind of tedious though, and I'm not really sure at what point in my algorithm I would implement it | |
| Feb 2, 2017 at 16:09 | comment | added | user3853544 | You could use a suffix and a prefix tree. Maybe a combination of both to determine possible matches then sort the possible matches using Levenshtein distance | |
| Feb 2, 2017 at 16:08 | comment | added | Nyfiken Gul | Right, thanks - but I'm not really sure how it'd effectivize my program since it's not only prefixes that determine the editing distance between two words. | |
| Feb 2, 2017 at 15:59 | comment | added | user3853544 | I could but Wikipedia will do a better job :) en.wikipedia.org/wiki/Trie | |
| Feb 2, 2017 at 15:33 | comment | added | Nyfiken Gul | Never used that data structure before, care to explain how I could use of it? | |
| Feb 2, 2017 at 15:18 | comment | added | user3853544 | Use a trie. You can lookup prefixes for words and see all possible endings. | |
| Feb 2, 2017 at 14:45 | history | edited | Yuval Filmus |
edited tags
|
|
| Feb 2, 2017 at 14:44 | history | asked | Nyfiken Gul | CC BY-SA 3.0 |