# US 11,907,277 B2 · Method, apparatus, and computer program product for classification and tagging of textual data > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,907,277 B2 - Document ID: US11907277B2 - Status: Granted - Kind: B2 - Application number: 18/165,156 - Filed: 2023-02-06 - Published: 2023-10-05 - Granted: 2024-02-20 - Earliest claimed: 2013-05-13 - Assignees: Groupon, Inc. - Applicants: Groupon, Inc. - Inventors: Nick Pendar - Web page: https://patentgrep.com/patent/US11907277B2 ## CPC - G06F 16/35: Clustering; Classification - G06F 16/328: {Management therefor} - G06F 16/338: Presentation of query results - G06F 16/355: Creation or modification of classes or clusters - G06F 16/93: Document management systems - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Provided herein are systems, methods and computer readable media for classification and tagging of textual data. An example method may include accessing a corpus comprising a plurality of documents, each document having one or more labels indicative of services offered by a merchant, generating a query based on extracted features and the documents, generating a precision score for at least a portion of the generated query and selecting a subset of the generated queries based on an assigned precision score satisfying a precision score threshold, the selected subset of the generated queries configured to provide an indication of one or more labels to be applied to machine readable text. A second example method, utilized for tagging machine readable text with unknown labels, may include assigning a label to textual portions of the machine readable text based on results of the application of the queries. ## Claims ### Claim 1 A method for tagging machine readable text associated with a merchant, the machine readable text recovered from one or more electronic sources, the method comprising: applying one or more queries to the machine readable text, wherein the one or more queries are automatically generated from a corpus having one or more documents with one or more labels indicative of one or more services offered by one or more merchants, wherein each of the one or more queries has an associated weight and the one or more queries are based on an extracted feature set and a precision score; assigning, using a processor, a label to textual portions of the machine readable text based on results of the application of the queries to the machine readable text; and classifying the merchant based on the label. ### Claim 2 (depends on 1) The method according to claim 1, wherein each query comprises a score indicative of an ability to return relevant results, the method further comprising: accessing the corpus having one or more documents; generating at least one query based on one or more extracted features of the extracted feature set and the one or more documents; generating the precision score for at least a portion of the generated at least one query; and selecting a query subset from the generated at least one query based on an assigned precision score satisfying a precision score threshold, wherein the selected query subset is configured to provide an indication of one or more labels to be applied to machine readable text. ### Claim 3 (depends on 2) The method according to claim 2, wherein the precision score is calculated based on a number of true positive documents returned by a query of the generated at least one query divided by a total number of documents returned. ### Claim 4 (depends on 2) The method according to claim 2, wherein generating the at least one query further comprises: generating an array of feature index pairs, the array of feature index pairs comprising one or more features and a position of the one or more features in a sentence; generating the at least one query as a function of one or more combinations of feature index pairs based on the array of feature index pairs; and outputting the at least one query. ### Claim 5 (depends on 4) The method according to claim 4, wherein generating the at least one query further comprises: calculating a distance between a first feature in the at least one query and a second feature in the at least one query; and generating a distance measure for the at least one query. ### Claim 6 (depends on 5) The method according to claim 5, further comprising rounding the distance between the first feature and the second feature to a next highest multiple of a predetermined number. ### Claim 7 (depends on 1) The method according to claim 1, further comprising: receiving the corpus; causing a first subset of words to be ignored in the corpus, the first subset of words comprising at least one of rare words or stop words; scoring a second subset of words based on a relationship between a word of the second subset of words and the label; and extracting features, the features comprising one or more words from the second subset of words that satisfy a predetermined threshold. ### Claim 8 (depends on 1) The method according to claim 1, further comprising: calculating a normalization factor based on the precision score. ### Claim 9 (depends on 8) The method according to claim 8, wherein assigning the label to textual portions of the machine readable text based on results of the application of the queries to the machine readable text further comprises: generating a score for the machine readable text, the generated score being a function of the precision score of a query of a query subset divided by the normalization factor; and generating at least one label for the machine readable text. ### Claim 10 (depends on 9) The method according to claim 9, wherein the at least one label is a sub-dominant level in a hierarchical structure of service categories. ### Claim 11 An apparatus for tagging machine readable text associated with a merchant, the machine readable text recovered from one or more electronic sources, the apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, causing the apparatus to at least: apply one or more queries to the machine readable text, wherein the one or more queries are automatically generated from a corpus having one or more documents with one or more labels indicative of one or more services offered by one or more merchants, wherein each of the one or more queries has an associated weight and the one or more queries are based on an extracted feature set and a precision score; assign, using the at least one processor, a label to textual portions of the machine readable text based on results of the application of the queries to the machine readable text; and classifying the merchant based on the label. ### Claim 12 (depends on 11) The apparatus according to claim 11, wherein each query comprises a score indicative of an ability to return relevant results, and wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: access the corpus having one or more documents; generate at least one query based on one or more extracted features of the extracted feature set and the one or more documents; generate the precision score for at least a portion of the generated at least one query; and select a query subset from the generated at least one query based on an assigned precision score satisfying a precision score threshold, wherein the selected query subset is configured to provide an indication of one or more labels to be applied to machine readable text. ### Claim 13 (depends on 12) The apparatus according to claim 12, wherein the precision score is calculated based on a number of true positive documents returned by a query of the generated at least one query divided by a total number of documents returned. ### Claim 14 (depends on 11) The apparatus according to claim 11, wherein generating the at least one query further comprises: generating an array of feature index pairs, the array of feature index pairs comprising one or more features and a position of the one or more features in a sentence; generating the at least one query as a function of one or more combinations of feature index pairs based on the array of feature index pairs; and outputting the at least one query. ### Claim 15 (depends on 14) The apparatus according to claim 14, wherein generating the at least one query further comprises: calculating a distance between a first feature in the at least one query and a second feature in the at least one query; and generating a distance measure for the at least one query. ### Claim 16 (depends on 15) The apparatus according to claim 15, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: round the distance between the first feature and the second feature to a next highest multiple of a predetermined number. ### Claim 17 (depends on 11) The apparatus according to claim 11, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: receive the corpus; cause a first subset of words to be ignored in the corpus, the first subset of words comprising at least one of rare words or stop words; score a second subset of words based on a relationship between a word of the second subset of words and the label; and extract features, the features comprising one or more words from the second subset of words that satisfy a predetermined threshold. ### Claim 18 (depends on 11) The apparatus according to claim 11, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: calculate a normalization factor based on the precision score. ### Claim 19 (depends on 18) The apparatus according to claim 18, wherein assigning the label to textual portions of the machine readable text based on results of the application of the queries to the machine readable text further comprises: generating a score for the machine readable text, the generated score being a function of the precision score of a query of a query subset divided by the normalization factor; and generating at least one label for the machine readable text. ### Claim 20 (depends on 19) The apparatus according to claim 19, wherein the at least one label is a sub-dominant level in a hierarchical structure of service categories.