SYSTEMS AND METHODS FOR IMPROVING TERM GENERATION USING HEURISTIC REFINEMENT AND DEEP LEARNING

1 . A computer-implemented method for using heuristic refinement and a deep learning model to identify at least one high-quality user search query, the method comprising:

filtering, by one or more processors, one or more queries based on one or more user interactions;

determining, by the one or more processors, at least one candidate query based on the filtered one or more queries, the determining including:

determining, by the one or more processors, one or more heuristic candidate queries by applying one or more heuristic processes to the filtered one or more queries;

generating, by the one or more processors, one or more model candidate queries based on one or more deep learning model processes; and

selecting, by the one or more processors, the at least one candidate query from the one or more heuristic candidate queries or the one or more model candidate queries based on a corresponding aggregated token frequency; and

displaying, by the one or more processors, the at least one candidate query on at least one device.

2 . The computer-implemented method of claim 1 , wherein the one or more user interactions include one or more clicks.

3 . The computer-implemented method of claim 1 , wherein the one or more heuristic processes includes at least one of: filtering the filtered one or more queries based on at least one query length, filtering the filtered one or more queries based on at least one popularity score, or applying at least one smoothing strategy to the filtered one or more queries.

4 . The computer-implemented method of claim 3 , wherein the at least one popularity score includes a click-based popularity score, a view-based popularity score, or a Wilson-based popularity score.

5 . The computer-implemented method of claim 1 , wherein generating the one or more model candidate queries based on the one or more deep learning model processes further comprises:

receiving, by the one or more processors, term data from one or more external sources;

concatenating, by the one or more processors, the term data;

extracting, by the one or more processors, one or more tokens from the term data; and

applying, by the one or more processors, at least one language model to the one or more tokens to determine the one or more model candidate queries.

6 . The computer-implemented method of claim 5 , further comprising:

determining, by the one or more processors, the aggregated token frequency for each of the one or more heuristic candidate queries and each of the one or more model candidate queries, the aggregated token frequency based on the term data and a frequency of the one or more heuristic candidate queries or the one or more model candidate queries in the term data; and

selecting, by the one or more processors, the one or more heuristic candidate queries and each of the one or more model candidate queries with a highest aggregated token frequency as the at least one candidate query.

7 . The computer-implemented method of claim 1 , wherein a query length of the at least one candidate query is below a threshold.

8 . The computer-implemented method of claim 1 , the method further comprising:

receiving, by the one or more processors, the one or more queries from one or more devices.

9 . The computer-implemented method of claim 1 , wherein the one or more queries include a plurality of terms.

10 . The computer-implemented method of claim 1 , the method further comprising:

clustering, by the one or more processors, the filtered one or more queries into one or more query groups based on one or more similarities.

11 . The computer-implemented method of claim 10 , wherein the selecting further comprises:

assigning, by the one or more processors, a popularity score to each filtered one or more queries in the one or more query groups; and

selecting, by the one or more processors, based on the popularity score, at least one popular query for each of the one or more query groups.

12 . A computer system for using heuristic refinement and a deep learning model to identify at least one high-quality user search query, the computer system comprising:

a memory having processor-readable instructions stored therein; and

one or more processors configured to access the memory and execute the processor-readable instructions, which when executed by the one or more processors configures the one or more processors to perform a plurality of functions, including functions for:

filtering one or more queries based on one or more user interactions;

determining at least one candidate query based on the filtered one or more queries, the determining including:

determining one or more heuristic candidate queries by applying one or more heuristic processes to the filtered one or more queries;

generating one or more model candidate queries based on one or more deep learning model processes; and

selecting the at least one candidate query from the one or more heuristic candidate queries or the one or more model candidate queries based on a corresponding aggregated token frequency; and

displaying the at least one candidate query on at least one device.

13 . The computer system of claim 12 , wherein generating the one or more model candidate queries based on the one or more deep learning model processes further comprises:

receiving term data from one or more external sources;

concatenating the term data;

extracting one or more tokens from the term data; and

applying at least one language model to the one or more tokens to determine the one or more model candidate queries.

14 . The computer system of claim 13 , further comprising:

determining the aggregated token frequency for each of the one or more heuristic candidate queries and each of the one or more model candidate queries, the aggregated token frequency based on the term data and a frequency of the one or more heuristic candidate queries or the one or more model candidate queries in the term data; and

selecting the one or more heuristic candidate queries and each of the one or more model candidate queries with a highest aggregated token frequency as the at least one candidate query.

15 . The computer system of claim 12 , the functions further comprising:

clustering the filtered one or more queries into one or more query groups based on one or more similarities.

16 . The computer system of claim 15 , wherein the selecting further comprises:

assigning a popularity score to each filtered one or more queries in the one or more query groups; and

selecting based on the popularity score, at least one popular query for each of the one or more query groups.

17 . A non-transitory computer-readable medium containing instructions for using heuristic refinement and a deep learning model to identify at least one high-quality user search query, the instructions comprising:

filtering, by one or more processors, one or more queries based on one or more user interactions;

determining, by the one or more processors, at least one candidate query based on the filtered one or more queries, the determining including:

determining, by the one or more processors, one or more heuristic candidate queries by applying one or more heuristic processes to the filtered one or more queries;

generating, by the one or more processors, one or more model candidate queries based on one or more deep learning model processes; and

selecting, by the one or more processors, the at least one candidate query from the one or more heuristic candidate queries or the one or more model candidate queries based on a corresponding aggregated token frequency; and

displaying, by the one or more processors, the at least one candidate query on at least one device.

18 . The non-transitory computer-readable medium of claim 17 , wherein the one or more user interactions include one or more clicks.

19 . The non-transitory computer-readable medium of claim 17 , wherein the one or more heuristic processes includes at least one of: filtering the filtered one or more queries based on at least one query length, filtering the filtered one or more queries based on at least one popularity score, or applying at least one smoothing strategy to the filtered one or more queries.

20 . The non-transitory computer-readable medium of claim 19 , wherein the at least one popularity score includes a click-based popularity score, a view-based popularity score, or a Wilson-based popularity score.