Data structures for efficient storage and updating of paragraph vectors

A method comprising:

• receiving, by a server device and from a client device, an input text string, wherein a database associated with the server device contains incident reports each associated with a unique identifier, and each including a text string and a timestamp, and wherein memory associated with the server device stores a look-up table that contains entries for respective unique text strings from the incident reports, wherein each of the entries associates:
• a pre-calculated paragraph vector for the respective unique text string, a hash of the respective unique text string, and a set of the unique identifiers associated with incident reports that contain the respective unique text string;
• determining a hash of the input text string;
• determining, from the look-up table, one or more matching entries for the input text string, wherein each of the one or more the matching entries either:
• (i) contains an identical copy of the hash of the input text string, or (ii) contains a pre-calculated paragraph vector that is within pre-defined matching criteria of, but not identical to, a paragraph vector calculated for the input text string;
• based at least on the timestamps within the incident reports specified by the set of unique identifiers in the one or more matching entries, determining a prioritized list of unique identifiers from an aggregate of the sets of unique identifiers in the one or more matching entries;
• and
• transmitting, to the client device, at least one of:
• (i) the prioritized list of unique identifiers, or (ii) information related to incident reports associated with the prioritized list of unique identifiers.

An article of manufacture including a non-transitory computer-readable medium, having stored thereon program instructions that, upon execution by a computing system, cause the computing system to perform operations comprising:

• receiving, from a client device, an input text string, wherein a database associated with the server device contains incident reports each associated with a unique identifier, and each including a text string and a timestamp, and wherein memory associated with the server device stores a look-up table that contains entries for respective unique text strings from the incident reports, wherein each of the entries associates:
• a pre-calculated paragraph vector for the respective unique text string, a hash of the respective unique text string, and a set of the unique identifiers associated with incident reports that contain the respective unique text string;
• determining a hash of the input text string;
• determining, from the look-up table, one or more matching entries for the input text string, wherein each of the one or more the matching entries either:
• (i) contains an identical copy of the hash of the input text string, or (ii) contains a pre-calculated paragraph vector that is within pre-defined matching criteria of, but not identical to, a paragraph vector calculated for the input text string;
• based at least on the timestamps within the incident reports specified by the set of unique identifiers in the one or more matching entries, determining a prioritized list of unique identifiers from an aggregate of the sets of unique identifiers in the one or more matching entries;
• and
• transmitting, to the client device, at least one of:
• (i) the prioritized list of unique identifiers, or (ii) information related to incident reports associated with the prioritized list of unique identifiers.