IP Library Granted Patent US 6,983,345
Granted Patent B2
US 6,983,345 · App. 10/362,027 · Granted Jan 3, 2006

Associative memory

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 6,983,345
App. No.
10/362,027
Granted
Jan 3, 2006
Kind
B2
Abstract

A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure between the query and parts or the whole of the stored documents; and said method further comprising one or a combination of the following: retrieval of one or more stores documents based on the obtained similarity measure; and or storing a representation of a document through its feature vector into the above matrix.

Claims (51)

1. A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more of said stored documents similar to an inputted query document, said method comprising:

coding each of said stored document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document;

arranging said feature vectors in a matrix;

generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix;

for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure between the query and parts or the whole of the stored documents; and said method further comprising one or a combination of the following;

retrieval of one or more stored documents based on the obtained similarity measure; and or

storing a representation of a document though its feature vector into the above matrix.

2. The method of claim 1 , wherein there is a plurality of result columns which code a similarity score which is based on the following:

the number how often a certain feature or a set of features defined by the logical 1's in the query vector occurs within a row of the matrix.

3. The method of claim 1 , wherein based on said similarity measure a set of candidate documents is chosen for further inspection, said set of candidate documents being further evaluated with respect to their similarity to the query documents being further evaluated with respect to their similarity measures reflecting the similarity between query and candidate under one or more aspects.

4. The method of claim 3 , wherein based on said one or more further similarity measures there is obtained a final similarity measure based on which it is decided which documents are finally to be retrieved.

5. The method of claim 3 , wherein said further inspection comprises comparing the query elements with the elements of the candidate documents to obtain one or more of the following further similarity measures:

a measure for the similarity between the textual query elements and textual document elements;

obtaining for each query element a corresponding textual document element based on said similarity measure;

obtaining measure for the degree of coincidence between the sequential order of the textual query elements and the sequential order of the corresponding textual document elements;

obtaining a measure for the similarity between the distance between elements in the query and the corresponding distance between elements in the document.

6. The method of claim 1 , wherein results returned which lie above a certain similarity treshold, and/or

wherein a user definable number of documents are retrieved which have the highest similarity.

7. The method of claim 1 , wherein a desired degree similarity can be defined by the user to be:

identity;

an settable degree of similarity or a similarity treshold; and or

identity for certain features and a settable degree of similarity for the other features.

8. The method of claim 1 wherein features coded by a feature vector for their presence or absence comprise one or more of the following;

unigrams, diagrams, multigrams, words, fragments of text, sentences, paragraphs, or a combination of them;

semantic classes reflecting a certain meaning which elements in the text to be represented may have;

concept classes reflecting an abstract concept to which elements in the text to be represented belong;

one or more classification classes classifying the document according to a classification scheme;

one or more attributes which may be assigned to a document.

9. The method of claim 8 , wherein the classification classes or the attributes may be attributes of the documents such as Date, author, title, publisher, editor, topic of the text, or classification results form classifications by the user or by an automatic classification engine.

10. The method of claim 8 , wherein the query document is assigned automatically an attribute or class based on the attribute or classes of one or more result documents obtained through the query according to one of the preceding claims.

11. The method of claim 1 , wherein the matrix formed by the feature vectors representing the documents to be searched is stored column-wise, and wherein said method further comprises:

for those columns of the matrix where the query feature vector bit is set, performing a processor supported bitwise operation between the columns of the matrix to obtain one or more result columns, the values in the result columns representing the similarity between the query and the stored documents.

12. The method of claim 1 , wherein there is a plurality of result columns such that the result columns form a matrix, and wherein a row of the thus formed result column matrix represents a degree of similarity between the query and the stored document corresponding to said row.

13. The method of claim 1 further comprising the steps of:

obtaining a set of examples for a certain classification class by carrying out a search for documents belonging to a particular class; and

training a classification engine by said obtained set of examples as the learning input.

14. The method of claim 13 , wherein said search for example documents is carried out in a subset of the set of stored documents, said subset being defined through the presence of one or more attributes or classification classes specified by the user in the query, thereby selecting for said query only the documents of said subset.

15. The method of claim 13 , said method being applied to realize a self-improving system through the steps of

retrieving relevant documents from a set of documents through an associative search;

using the retrieved documents from a set of documents through an associative search;

using the retrieved documents for improving a classification engine,

using the classification through a classification engine to improve the retrieval through an associative memory; and

using the improved retrieval to improve the classification engine.

16. An apparatus for realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said apparatus comprising:

means for carrying out a method of realizing an associative memory capable of storing a set of documents and retrieving one or more of said stored documents similar to an inputted query document, said method comprising:

coding each of said stored document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document;

arranging said feature vectors in a matrix;

generating a query feature vector based on the query document and according tot he rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix;

for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure between the query and parts of the whole of the stored documents; and said method further comprising one or a combination of the following:

retrieval of one or more stored documents based on the obtained similarity measure; and or

storing a representation of a document though its feature vector into the above matrix.

Assignments (11)
RELEASE OF SECURITY INTEREST RECORDED AT REEL/FRAME 045430/0405 Recorded Sep 24, 2023
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, AS COLLATERAL AGENT, A BRANCH OF CREDIT SUISSE
To: KOFAX INTERNATIONAL SWITZERLAND SARL
Reel/Frame 065018/0421 →
RELEASE OF SECURITY INTEREST RECORDED AT REEL/FRAME 045430/0593 Recorded Sep 24, 2023
From: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, AS COLLATERAL AGENT, A BRANCH OF CREDIT SUISSE
To: KOFAX INTERNATIONAL SWITZERLAND SARL
Reel/Frame 065020/0806 →
CHANGE OF NAME Recorded Feb 20, 2019
From: KOFAX INTERNATIONAL SWITZERLAND SÀRL
To: HYLAND SWITZERLAND SÀRL
Reel/Frame 048389/0380 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT SUPPLEMENT (FIRST LIEN) Recorded Feb 23, 2018
From: KOFAX INTERNATIONAL SWITZERLAND SARL
To: CREDIT SUISSE
Reel/Frame 045430/0405 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT SUPPLEMENT (SECOND LIEN) Recorded Feb 23, 2018
From: KOFAX INTERNATIONAL SWITZERLAND SARL
To: CREDIT SUISSE
Reel/Frame 045430/0593 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 20, 2017
From: LEXMARK INTERNATIONAL TECHNOLOGY SARL
To: KOFAX INTERNATIONAL SWITZERLAND SARL
Reel/Frame 042919/0841 →
ENTITY CONVERSION Recorded Feb 11, 2016
From: LEXMARK INTERNATIONAL TECHNOLOGY S.A.
To: LEXMARK INTERNATIONAL TECHNOLOGY SARL
Reel/Frame 037793/0300 →
CHANGE OF NAME Recorded Feb 2, 2015
From: BDGB ENTERPRISE SOFTWARE S.A.R.L.
To: LEXMARK INTERNATIONAL TECHNOLOGY, S.A.
Reel/Frame 034872/0271 →
RE-RECORD TO CORRECT PREVIOUSLY RECORDED UNDER R/F 019246/0766 TO CORRECT ERRORS APPERING IN THE RECORDATION Recorded Jul 12, 2007
From: SER SOLUTIONS, INC.
To: BDGB ENTERPRISE SOFTWARE S.A.R.L.
Reel/Frame 019580/0303 →
CHANGE OF NAME Recorded May 4, 2007
From: SER SOLUTIONS, CINC.
To: BDGB ENTERPRISE SOFTWARE LTD. LIAB. CO.
Reel/Frame 019246/0766 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 5, 2005
From: LAPIR, GANNADY; URBSCHAT, HARRY
To: SER SOLUTIONS, INC.
Reel/Frame 016471/0504 →