Timeline for Identifying plagiarized jokes? [closed]
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:01 | history | edited | CommunityBot |
Commonmark migration
|
|
| Dec 17, 2015 at 13:01 | comment | added | yannis | This question is being discussed in our Meta site: Are our judgments of "too broad" too broad? | |
| Dec 15, 2015 at 18:37 | comment | added | Jim Mischel | You will drive yourself crazy trying to use edit distance for something like this. Look into w-shingling, Rabin fingerprint or the bag-of-words model. I suspect you could get something up and limping quickly with Bag-of-words. | |
| Dec 7, 2015 at 0:06 | comment | added | user40980 | As an aside, the "it's potentially expensive" - you are going to have to check each new submission against all the others no mater what the approach that is used. It will be expensive no matter what algorithm you use. This can be mitigated somewhat by using a Levenshtein Automata and serializing that so that the calculation of the calculation of this structure is done only once. | |
| Dec 7, 2015 at 0:04 | comment | added | user40980 | @CorbinMarch as you can see, it didn't get closed as a duplicate. However, the question as described here (even kind of with the edits) is solvable with edit distance. To get to the point where "use edit distance" isn't the answer, we need a better corpus of material to work from. However, I must agree with Brian and Ixrec in this point that once you start going down that path, you get into deep NLP problems that are not answerable within the space provided here. | |
| Dec 6, 2015 at 17:54 | history | closed |
user40980 Brian Ixrec |
Needs more focus | |
| Dec 6, 2015 at 11:29 | history | edited | Patrick Collins | CC BY-SA 3.0 |
added 943 characters in body
|
| Dec 6, 2015 at 6:53 | answer | added | Avner Shahar-Kashtan | timeline score: 3 | |
| Dec 6, 2015 at 6:01 | comment | added | Patrick Collins | @MichaelT: I'm aware of string edit distance but I'd think the best solution here would be word-level rather than character-level, since swapping names may lead to large string edit distances (e.g. "New York City" for "LA") that we'd prefer to call a small number of word-level swaps rather than a large number of character-level swaps. | |
| Dec 6, 2015 at 3:58 | review | Close votes | |||
| Dec 6, 2015 at 17:54 | |||||
| Dec 6, 2015 at 3:53 | comment | added | user40980 | Incidentally, the Levenshtein distance of the two strings you provide is 22. On the other hand, comparing the edit distance of the first string to "I wondered why the frisbee was getting bigger, and then it hit me." is 76. Folding to lower case, the difference between the two you provide is 20. | |
| Dec 6, 2015 at 3:41 | comment | added | user40980 | Possible duplicate of Match two strings but allow for a degree of error | |
| Dec 6, 2015 at 3:33 | history | asked | Patrick Collins | CC BY-SA 3.0 |