A study of string matching system based on database set operation

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, people can easily get various data and information through Internet. People can copy the entire downloaded data, digitized information into own paper work, and form some plagiarism problems. Previous studies use of statistics, vectors matrices to compare string among documents. When someone change the location of words, and add some superfluous words or sentences between strings, it will be greatly reduced the accurate rate of matching system; Moreover, it may cause students keep plagiarism if matching system cannot find the alignments correctly. This study uses Chinese Word Segmentation and Database Set Operation as a base to construct a string matching system to solve the excessive superfluous words and order problems. Database Set Operation may be more efficient than the program with lots of words inside its memory. This study creates a prototype system, and the result of the prototype shows that the accuracy performance is performed well.

Cite

CITATION STYLE

APA

Ying, M. H., & Lin, C. Y. (2014). A study of string matching system based on database set operation. In Lecture Notes in Electrical Engineering (Vol. 308, pp. 301–307). Springer Verlag. https://doi.org/10.1007/978-3-642-54900-7_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free