A fast algorithm for the generalized k-keyword proximity problem given keyword offsets


When searching for information on the Web, it is often necessary to use one of the available search engines. Because the number of results are quite large for most queries, we need some measure of relevance with respect to the query. One of the most important relevance factors is the proximity score, i.e., how close the keywords appear together in a given… (More)
DOI: 10.1016/j.ipl.2004.03.017


2 Figures and Tables