Method of searching text to find relevant content
AssigneeNeedlebot Incorporated
InventorsJohn Barrett Collins, Jerome Verlin, Can Deniz Akyuz, Stuart Donnelly
Life of this patent
Estimating the term…
Loading patent…
AssigneeNeedlebot Incorporated
InventorsJohn Barrett Collins, Jerome Verlin, Can Deniz Akyuz, Stuart Donnelly
Estimating the term…
A method of locating relevant documents wherein documents are given a fingerprint comprising weights associated with particular topic categories of a classification system, each weight representing a degree to which the document relates to the particular topic category, a first piece of text is identified and given a fingerprint comprising a list of other weights associated with similar topic categories, the other weights representing a degree to which the first piece of text relates to the particular topic category. All or a portion of the universe of documents is searched by comparing the fingerprint for the first piece of text with the fingerprint for each document. You select those documents whose fingerprints have a predetermined degree of mathematical overlap with the fingerprint of the first piece of text. A user fingerprint of the user's recently accessed texts can be used in place of the first piece of text.
A method of locating relevant documents within a universe of documents, the documents of said universe having been classified so that each document in the universe has a fingerprint, said fingerprint comprising a list of weights associated with particular topic categories in a classification system, each of the weights representing a degree to which the document relates to the particular topic category that the weight is associated with, the weights obtained automatically from a computer program, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of locating relevant documents within a universe of documents, the documents of said universe having been classified so that each document in the universe has a fingerprint, said fingerprint comprising a list of weights associated with particular topic categories in a classification system, each of the weights representing a degree to which the document relates to the particular topic category that the weight is associated with, the weights obtained automatically from a computer program, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of locating relevant documents within a universe of documents, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of locating relevant documents within a universe of documents, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of re-ranking a list of documents obtained from a search wherein a ranking of a document in the list is determined by a relevance of the document to a search text, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of re-ranking a list of documents obtained from a search wherein a ranking of a document in the list is determined by a relevance of the document to a search text, and wherein each document in the list has a fingerprint, said fingerprint comprising a list of weights associated with particular topic categories in a classification system, each of the weights representing a degree to which the document related to the particular topic category that the weight is associated with, the weights obtained automatically from a computer program, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of re-ranking a list of document obtained from a search wherein a ranking of a document in the list of documents is determined by a relevance of the document to a search text, wherein the list of documents has been classified and appears in an inverted list, said inverted list comprising for each topic category of a classification system a weight associated with a particular document of the list of documents, the weight representing a degree to which the particular document relates to said each topic category, the weights obtained automatically from a computer program, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and comprising:
A method of re-ranking a list of documents obtained from a search wherein a ranking of a document in the list is determined by a relevance of the document to a search text, the method performed by a computer processor, having a scalable time complexity of O(Nx) where 0<=X<=1.0, and comprising:
A method of re-ranking a list of documents obtained from a search wherein a ranking of a document in the list is determined by a relevance of the document to a search text, and wherein each document in the list has a fingerprint, said fingerprint comprising a list of weights associated with particular topic categories in a classification system, each of the weights representing a degree to which the document relates to the particular topic category that the weight is associated with, the weights obtained automatically from a computer program, the method performed by a computer processor, having a scalable time complexity of O(Nx) where 0<=X<=1.0, and comprising:
A method of re-ranking a list of documents obtained from a search wherein a ranking of a document in the list is determined by a relevance of the document to a search text, wherein the list of documents has been classified and appears in an inverted list, said inverted list comprising for each topic category of a classification system a weight associated with a particular document of the list of documents, the weight representing a degree to which the particular document relates to said each topic category, the weights obtained automatically from a computer program, the method performed by a computer processor, having a scalable time complexity of O(Nx) where 0<=X<=1.0, and comprising:
A method of locating relevant documents within a universe of documents, the documents of said universe having been classified and appears in an inverted list,
A method of locating relevant documents within a universe of documents, the documents of said universe having been classified and appears in an inverted list,
A method of locating relevant documents within a universe of documents, the documents of said universe having been classified so that each document in the universe has a fingerprint, said fingerprint comprising a list of weights associated with particular topic categories in a classification system, each of the weights representing a degree to which the document relates to the particular topic category that the weight is associated with, the weights obtained automatically from a computer program, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and performed by a computer processor and comprising:
A method of locating relevant documents within a universe of documents, the documents of said universe having been classified so that each document in the universe has a fingerprint, said fingerprint comprising a list of weights associated with particular topic categories in a classification system, each of the weights representing a degree to which the document relates to the particular topic category that the weight is associated with, the weights obtained automatically from a computer program, the method having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web and performed by a computer processor comprising:
A method performed by a computer processor of locating relevant documents within a universe of documents, comprising:
A method of locating relevant documents within a universe of documents, the method performed by a computer processor and having a scalable time complexity of O(Nx) where 0<=X<=1.0 for a universe of text on the world wide web, the method comprising:
Dependencies are inferred from the claim text.