Timeline for Neighbourhood of a word and Levenshtein distance
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 18, 2016 at 14:00 | 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 18, 2016 at 12:43 | answer | added | Maximilian | timeline score: 2 | |
| May 25, 2016 at 6:03 | answer | added | Daniel Cullina | timeline score: 2 | |
| May 12, 2016 at 11:43 | comment | added | Johannes Trost | @Distance Thank you for adding a question. | |
| May 12, 2016 at 3:16 | comment | added | usul | Is there a particular regime of parameters $|\Sigma|, k, n$ that you're interested in? | |
| May 11, 2016 at 17:05 | comment | added | Gro-Tsen | @JohannesTrost OP's question, as I understand it, is "for what $n$-letter words $U$ on an alphabet of size $σ$ is the cardinality of the ball of radius $k$ for the edit distance the greatest possible? what are the words and what is the maximum cardinality in question?" It's a reasonably well-posed question. | |
| S May 11, 2016 at 16:39 | history | suggested | ZbimZbamZboum | CC BY-SA 3.0 |
Add question
|
| May 11, 2016 at 16:26 | review | Suggested edits | |||
| S May 11, 2016 at 16:39 | |||||
| May 11, 2016 at 16:20 | comment | added | Johannes Trost | What is the question ? | |
| May 11, 2016 at 14:23 | review | First posts | |||
| May 11, 2016 at 14:36 | |||||
| May 11, 2016 at 14:14 | history | asked | Distance | CC BY-SA 3.0 |