The Application of Levenshtein Algorithm in the Examination of the Question Bank Similarity

摘要

The question database similarity detection is a test that can quickly in the huge, find the similarity is very high, which questions repeated also need screening. General use Excel API JAVA program with the distance editing algorithm, to achieve a direct access to the excel question bank. In designing a question bank repeated questions detection algorithm, we have found that based on the Levenshtein algorithm often appear memory overrun and unable to output, to improve exam similarity detection efficiency brings great negative effect. Through the actual operation of the study, using the string segmentation and increase the control statement can be very good to improve the problem, to improve the test efficiency is very favorable.