Using genetic algorithm for avoiding redundant matched substring within a web based join framework

The popular AML (Approximate Membership Localization) is the process of delivers a full coverage to the true matched substrings from single given document, but redundancies cause a low efficiency of AML process and deteriorate the performance of the real world applications using the extracted substrings. Though the results of AML are proved to be good over Approximate Membership Extraction (AME), redundancy is still occurring and the results of AML are much closer to AME. In this paper, to refine the results of AML we moved to the genetic algorithm for better efficiency and to avoid the redundancy completely.