The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Oct. 06, 2020

Filed:

Feb. 10, 2019
Applicant:

Netapp, Inc., Sunnyvale, CA (US);

Inventor:

Guy Leibovitz, Tel Aviv, IL;

Assignee:

NETAPP, INC., Sunnyvale, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 40/284 (2020.01); G06F 17/18 (2006.01); G06F 16/31 (2019.01); G06F 16/33 (2019.01); G06F 40/242 (2020.01);
U.S. Cl.
CPC ...
G06F 40/284 (2020.01); G06F 16/31 (2019.01); G06F 16/3331 (2019.01); G06F 17/18 (2013.01); G06F 40/242 (2020.01);
Abstract

A method comprising receiving a dictionary comprising a plurality of entities, wherein each entity has a length of between 1 and n tokens; constructing a probabilistic data representation model comprising n Bloom filter (BF) pairs indexed from 1 to n; populating said probabilistic data representation model with a data representation of said entities, wherein, with respect to each BF pair indexed i: (i) a first BF is populated with the first i tokens of all said entities having at least i+1 tokens, and (ii) a second BF in populated with all said entities having exactly i tokens; receiving a text corpus, wherein said text corpus is segmented into tokens; and automatically matching each token in said text corpus against said populated probabilistic data representation model, wherein said matching comprises sequentially querying each said BF pair in the order of said indexing, to determine a match.


Find Patent Forward Citations

Loading…