  We have attempted in this paper to reduce the number of checked condition
through saving frequency of the tandem replicated words, and also using
non-overlapping iterative neighbor intervals on plane sweep algorithm. The
essential idea of non-overlapping iterative neighbor search in a document lies
in focusing the search not on the full space of solutions but on a smaller
subspace considering non-overlapping intervals defined by the solutions.
Subspace is defined by the range near the specified minimum keyword. We
repeatedly pick a range up and flip the unsatisfied keywords, so the relevant
ranges are detected. The proposed method tries to improve the plane sweep
algorithm by efficiently calculating the minimal group of words and enumerating
intervals in a document which contain the minimum frequency keyword. It
decreases the number of comparison and creates the best state of optimized
search algorithm especially in a high volume of data. Efficiency and
reliability are also increased compared to the previous modes of the technical
approach.
