Identifying superphrases of text strings

摘要

Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.