Finding Meaningful Regions Containing Given Keywords from Large Text Collections

this paper, we show an algorithm for finding regions of documents in which all given keywords appear in neighboring places. This algorithm is based on the planesweep algorithm. It runs in O(n log n) time where n is the number of occurrences of given keywords and it does not depend on the number of given keywords. We also show demonstrations of the algorithm using Web texts