Patent Document ID: 7747083
Application ID: 11390001

Base Claim:
1. A computer-implemented method for clustering text, comprising: representing at least one text in a set of texts as a dimensional vector of words; representing an other text in the set of texts as a dimensional vector of words; determining a dot-product of the dimensional vector of the other text and the dimensional vector of the at least one text; comparing the dot-product to a threshold, wherein the threshold comprises an upper bound of a value in a range from zero to one that represents a cosine similarity between the other text and the at least one text; if the dot-product exceeds the threshold, determining the at least one text to be the good nearest neighbor of the other text; clustering the other text in a cluster; and clustering the at least one text determined to be the good nearest neighbor of the other text in the cluster.

---

Claim 2:
2. The method of claim 1 further comprising: comparing the dot-product to a similarity threshold; determining a measure of a number of words used both by the at least one text and the other text; comparing the measure of the number of words to an overlap threshold; and if the dot-product exceeds the similarity threshold and the measure of the number of words also exceeds the overlap threshold, determining the at least one text to be the good nearest neighbor of the other text.