Patent ID: 8401842
Filing Date: 2013-03-19
Classification: G06F

Abstract:
1. A process for matching predefined phrases in content using a computer system, a phrase comprising a plurality of keywords, comprising the steps performed by the computer system of: constructing a hit list for each of said keywords of a predefined phrase, each hit list indicating for each keyword the positions of occurrences of each keyword in the content; forming, from said hit list, a sorted set of all of the keywords of the phrase, the sorted set comprising for each keyword one position of occurrence of such keyword in a group of consecutive words in the content; comparing a distance between keywords in said sorted set to a predetermined proximity constraint; and indicating a phrase match if all of said keywords are present and said distance is less than or equal to said proximity constraint, wherein forming said sorted set comprises forming an unordered sorted set of all keywords without regard to the order of occurrences of the keywords in the phrase, and wherein comparing the distance between keyword positions comprises comparing the distance between keywords having the highest position and the lowest position in said sorted set, and wherein said proximity constraint comprises a parameter MaxSpan=p(k−1), where p comprises a proximity and k comprises the number of keywords in the phrase.