In this paper, an efficient text classification algorithm for repeating-text information on the e-commerce site can automatically classify and sort the similar string. This algorithm will greatly increase the efficiency and accuracy of audited information. All tests show that for the number of information between 100 and 1000 the algorithm is very efficient, and the 1000 text information(strings) comparison can be controlled in two seconds. When the amount of information is over 1000, the computation time will be significantly increased. The precision can be rectified to adjust the relevant parameters of the algorithm, such as the number of the same substring in comparison results and the length of split string. For too short information, such as less than 10 words, the algorithm can be combined with the Levenshtein algorithm, in order to improve the text-search flexibility.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2009) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: