Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:03 | history | edited | CommunityBot | Commonmark migration | |
| Mar 16, 2017 at 16:03 | history | edited | CommunityBot | replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/ | |
| Mar 16, 2017 at 16:03 | history | edited | CommunityBot | replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/ | |
| Mar 16, 2017 at 16:03 | history | edited | CommunityBot | replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/ | |
| Mar 16, 2017 at 16:03 | history | edited | CommunityBot | replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/ | |
| Mar 16, 2017 at 16:03 | history | edited | CommunityBot | replaced http://meta.codegolf.stackexchange.com/ with https://codegolf.meta.stackexchange.com/ | |
| Jun 4, 2015 at 13:30 | history | edited | JNV | CC BY-SA 3.0 | added 327 characters in body |
| Jun 4, 2015 at 13:26 | comment | added | JNV | @MartinBüttner Leave them unchanged. Thank you for your support. | |
| Jun 4, 2015 at 13:25 | history | edited | JNV | CC BY-SA 3.0 | added 327 characters in body |
| Jun 4, 2015 at 13:19 | comment | added | Martin Ender Mod | Right, but the question is what do we do with words that have neither an identical word nor a word with 1 distance from the 1st input. Remove them? Leave them changed? Also, that second point might be worth mentioning in the spec. | |
| Jun 4, 2015 at 13:19 | comment | added | JNV | As for the 'lay' in the first example, I'll fix it now, thanks. | |
| Jun 4, 2015 at 13:10 | comment | added | JNV | @MartinBüttner Yes, it's possible for a word to have neither an identical word nor a word with 1 distance from the 1st input. You can ignore the words that are followed by a punctuation, like blood in the 1st input. They won't be in the test cases. (E.g. I won't ask for the correction of 'blod') Thank you for your help. | |
| Jun 4, 2015 at 12:43 | comment | added | Martin Ender Mod | I was asking for distance "no more than 1 away". That is, could there be a word that has neither a word with distance 1 nor an identical word in the first input? "You can assume words are just sequences of letters separated by spaces." Yet in the first input, there is punctuation. What sort of punctuation should we expect? The rest looks good. | |
| Jun 4, 2015 at 5:02 | history | edited | JNV | CC BY-SA 3.0 | Clarified challenge. |
| Jun 4, 2015 at 4:56 | comment | added | JNV | @MartinBüttner Good point. It's case insensitive, and the output can be in any case. (e.g. If the first input includes 'The' and there's 'teh' in the second input, it should output 'the' or 'THE' or 'tHE' or ...). No, you're not guaranteed that there's a word with a distance of 1 in the first input. Take a look at the example #2, 'I' was not changed. Also, in your previous post, you asked what counts as a word. I already said it in the post 'You can assume all words in the 2nd input are separated by spaces.' I'll edit it for clarity. | |
| Jun 4, 2015 at 4:49 | comment | added | JNV | @MartinBüttner I clarified it in the bullet point above it. Only transposition of adjacent letters, one missing letter, one extra letter and a wrong letter. I guess that's Damerau-Levenshtein distance. Regarding the two words problem, I guess you could output either of them. I'm not really sure about this. I'm open for ideas. | |
| Jun 3, 2015 at 20:34 | comment | added | Martin Ender Mod | Is the input case insensitive? If so, is case of the output arbitrary too or do we have to preserve the input capitalisation? And are we guaranteed that every word in the second string has a word in the first string that is no more than distance 1 away? | |
| Jun 3, 2015 at 20:33 | comment | added | Martin Ender Mod | There are several definitions of "distance". Since the most common one is probably Levenshtein, you might want to specifically say that original and mistake have to have Damerau–Levenshtein distance of one. Other questions: what is a word? Only sequences of letters? What about "doesn't" or "up-to-date"? (It's probably simplest to rule those out.) What do we output if there are two different words with distance one? E.g. does en become in or on if both are in the first string? | |
| Jun 3, 2015 at 20:03 | history | answered | JNV | CC BY-SA 3.0 |