Algorithms for approximate string matching
Information and Control
How hard is computing the edit distance?
Information and Computation
A bit-vector algorithm for computing Levenshtein and Damerau edit distances
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Measuring the structural similarity of semistructured documents using entropy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
| Hi-index | 0.00 |
Recently, the network environment in classroom has been much improved. However, the facilities may promote the imprudent plagiarism of the other's answer in online report submission. We are developing the detection tool for report plagiarism based on similarity. We adopt two kinds of approach for similarity judgment. The one is text base by editorial distance. Another is binary base by file compression ratio. We prepare some preprocess methods like morphological analysis and removing redundant information. We aim to realize adequate judgment precision and cost performance. The tool incorporated as a function of WebBinder, which is online report task support system. It uses not only for exposure of the fraudulent activity by a teacher but also for the warnings at the time of students' uploading files. As preliminary experiment, we applied the prototype tool for similarity calculation and detection plagiarism. The samples are the three kinds of data; explanation text of information engineering term, mathematical document in binary file and C language source code.