Systems and methods for querying a graph data structure

Abstract

In some aspects, the techniques described herein relate to a method including: receiving a first list entity vector embedding, wherein the first list entity vector embedding is of a categorical type and is associated with a list entity; generating a first similarity score between the first list entity vector embedding and a stored vector embedding of a plurality of stored vector embeddings, wherein the stored vector embedding of the plurality of stored vector embeddings is of the categorical type and is associated with a stored entity; adding the first similarity score to a second similarity score, wherein the sum of the first similarity score and the second similarity score is an overall similarity score associated with the stored entity; querying a datastore to retrieve data associated with the stored entity; and returning, as output of the list expansion module, the data associated with the stored entity.