Data structures for efficient storage and updating of paragraph vectors
US12141182B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 10, 2022 |
| Grant date | Nov 12, 2024 |
| Priority date | — |
| Expiry date | Aug 10, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N3/088
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Systems and methods involving data structures for efficient management of paragraph vectors for textual searching are described. A database may contain records, each associated with an identifier and including a text string and timestamp. A look-up table may contain entries for text strings from the records, each entry associating: a paragraph vector for a respective unique text string, a hash of the respective unique text string, and a set of identifiers of records containing the respective unique text string. A server may receive from a client device an input string, compute a hash of the input string, and determine matching table entries, each containing a hash identical to that of the input string, or a paragraph vector similar to one calculated for the input string. A prioritized list of identifiers from the matching entries may be determined based on timestamps, and the prioritized list may be returned to the client.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.