Method for quickly querying trademark case

Abstract

The invention relates to the technical field of query, in particular to a method for quickly querying trademark class cases, which specifically comprises the following steps of: S1, applying for rejected classification of trademarks; s2, generating a class case group; s3, cleaning and importing a trademark bureau open data set to form a trademark database; and S4, querying trademark cases. According to the method for quickly querying the trademark class cases, trademark rejection reasons are standardized, corresponding class case generation logics are formulated according to various rejection reasons, real-time query of the trademark class cases is performed based on big data, and compared with traditional manual operation, the class case generation efficiency is improved, and the trademark class cases can be quickly queried. And the dependence on professional business experience is reduced, and the requirement on query personnel is reduced.

Description

Technical Field

[0001] The present invention relates to the field of query technology, and in particular to a method for quickly querying trademark cases. Background Art

[0002] When a trademark application is rejected and a trademark review is required, you can generally conduct a rejection review by finding several groups of trademark cases that are similar to the applied trademark but were ultimately successfully reviewed (i.e., searching for similar trademark cases) in the existing trademark cases.

[0003] There are many trademarks in the database of the Trademark Office, with more than 100 million trademarks, but the trademark search service functions provided by the Trademark Office's official website are not complete. Therefore, the traditional method of searching for trademark cases is to manually search through the search page provided by the Trademark Office based on the trademark name, application number, applicant and other information. This method relies heavily on the operator's business experience and familiarity with trademark data to find relevant cases. For example, based on similar trademarks that may have been seen before, or similar situations that have been handled before, search attempts are made again and again. Each search may have hundreds of results, and users need to manually screen from multiple search results. According to the above process, even if you are just looking for a similar case, it will consume a lot of time for business personnel. If the operator is inexperienced or unfamiliar with trademark data, it is difficult to determine the keywords to be searched, and the requirements for the query are high. On the other hand, since the keywords are manually queried one by one, the query efficiency is extremely low. Summary of the invention

[0004] The present invention provides a method for quickly searching for trademark cases, which can achieve the purpose of high efficiency in searching for trademark cases and accurate search results.

[0005] In order to achieve the above-mentioned purpose, the technical solution of the present invention is to provide a method for quickly searching for trademark cases, the innovation of which is that it specifically comprises the following steps:

[0006] S1. Classification of rejection of trademark applications: Classify the rejection reasons of trademark applications, and distinguish the classification of each rejection reason by similar case generation logic. The similar case generation logic includes general logic, meaning logic, graphic logic and digital logic;

[0007] S2. Generate similar case groups: Generate corresponding similar case groups according to different similar case generation logics. Assume that the number of generated similar case groups is m. For general logic and meaning logic, determine the comparison relationship between the applied trademark and the cited trademark, and then search and generate similar case groups in similar groups based on the comparison relationship; for digital logic, parse the numbers contained in the applied trademark, and search and generate similar case groups in similar groups based on the numbers; for graphic logic, search for similar cases that have been successfully reviewed and where both the applied trademark and the cited trademark are graphic trademarks;

[0008] S3. Cleaning and importing the open data set of the Trademark Office: Based on the full amount of trademark application data provided by the Trademark Office, download the original data, clean the original data, create an index based on the four types of case generation logic, and store it in ElasticSearch to form a trademark database;

[0009] S4 Trademark Class Case Query: Identify and confirm trademark elements based on the applied trademark name, applied trademark similarity group, cited trademark name, cited trademark similarity group and the rejection reason of the applied trademark that the user wants to query, and search for m groups of similar cases in the trademark database according to the method of step S2 for the identification result, thus completing the trademark class case query.

[0010] Furthermore, in step S1, the reasons for rejection of the trademark application are classified into eleven categories, namely:

[0011] (1) The trademark application is rejected because of the Chinese characters; (2) The English characters in the trademark application is rejected because of the English characters in the cited trademark; (3) The English characters in the trademark application is rejected because of the Pinyin characters in the cited trademark; (4) The Pinyin characters in the trademark application is rejected because of the English characters in the cited trademark; (5) The Pinyin characters in the trademark application is rejected because of the Pinyin characters in the cited trademark; (6) The trademark application is rejected because of single words; (7) The Chinese characters in the trademark application is rejected because of the meaning of the English characters in the cited trademark; (8) The English characters in the trademark application is rejected because of the meaning of the Chinese characters in the cited trademark; (9) The trademark application is rejected because of letters; (10) The trademark application is rejected because of graphics; (11) The trademark application is rejected because of numbers.

[0012] Furthermore, in step S1, the classification of each rejection reason is divided into similar case generation logic as follows: (1)(2)(3)(4)(5)(6)(9) of the rejection reasons for the applied trademark are general logic; (7)(8) of the rejection reasons for the applied trademark are meaning logic; (10) of the rejection reasons for the applied trademark are graphic logic; and (11) of the rejection reasons for the applied trademark are digital logic.

[0013] Furthermore, in step S2, the process of generating a similar case group whose similar case generation logic is a general logic is as follows:

[0014] S211. Find the comparative relationship between the applied trademark and the cited trademark. The specific process is: find the similar groups corresponding to the applied trademark and the cited trademark, and find which character positions of the applied trademark name are the same as those of the cited trademark name, that is, the comparative relationship between the applied trademark and the cited trademark when they belong to the common logic;

[0015] S212. Based on the obtained comparison relationship between the applied trademark and the cited trademark, search for trademark cases that meet the same comparison relationship in the similar groups corresponding to the applied trademark and the cited trademark respectively, and form a class case group for each trademark case that meets the same comparison relationship;

[0016] S213. If the number of trademark case groups found in the similarity groups corresponding to the applied trademark and the cited trademark is less than m, search in different similarity groups until the number of similar case groups is m.

[0017] Furthermore, in step S2, the process of generating a similar case group whose similar case generation logic is meaning logic is as follows:

[0018] S221. Find the comparative relationship between the applied trademark and the cited trademark: find the similar groups corresponding to the applied trademark and the cited trademark according to the synonym groups in the meaning database, and find out which character positions in the applied trademark name form the meaning and which character positions in the cited trademark name form the synonyms, that is, obtain the comparative relationship between the applied trademark and the cited trademark when they belong to the meaning logic;

[0019] S222. Based on the obtained comparison relationship between the applied trademark and the cited trademark, search for trademark cases that meet the same comparison relationship in the similar groups corresponding to the applied trademark and the cited trademark respectively, and form a class case group for each trademark case that meets the same comparison relationship;

[0020] S223. If the number of trademark case groups found in the similarity groups corresponding to the applied trademark and the cited trademark is less than m, search in different similarity groups until the number of similar case groups is m.

[0021] Furthermore, in step S2, the process of generating a similar case group whose similar case generation logic is digital logic is as follows:

[0022] S231, find the similar group to which the applied trademark belongs, determine the number contained in the name of the applied trademark, set it as y, and determine the number of digits of y;

[0023] S232. Subtract 1 from the number in the name of the applied trademark, i.e. y-1. In the similar group where the applied trademark is located, search for the trademark corresponding to y-1 and the trademark corresponding to y-2, i.e. a. Then trademark a and trademark b form a group of similar cases. Then search for the trademark corresponding to y-3 and the trademark corresponding to y-4 in the similar group where the applied trademark is located, i.e. c. Then trademark c and trademark d also form a group of similar cases. And so on. If the number of digits in y changes after a digit is subtracted, add 0 in front to keep the number of digits the same as y, and continue to search for the trademark corresponding to the corresponding number. If y is less than 0 after a digit is subtracted, add 1 to y, and continue to search for the trademark corresponding to the corresponding number in the same similar group, and keep the number of digits unchanged, until m groups of similar cases are found. If the number of digits in the last searched number is the same as y, and all digits are 9, after finding the trademark corresponding to the current number, even if m groups of similar cases have not been found, the search will not continue, and the found trademarks will form a group of similar cases in every two according to the search order.

[0024] Furthermore, the process of establishing indexes according to the four case generation logics in step S3 is as follows:

[0025] S31. For general logic and meaning logic, the trademark name is split into independent characters one by one, and the position of each character is recorded as 0, 1, 2, 3, ... from left to right, and the data of whether any character position is the required character is quickly found through the index;

[0026] S32. For digital logic, extract the numbers in the trademark name and search for data containing the numbers through indexes;

[0027] S33. For graphic logic, an index is created for the review result and the trademark type, where the trademark type refers to whether the trademark is a graphic trademark.

[0028] Furthermore, the process of identifying trademark elements in step S4 is as follows: determining which category of similar cases the applied trademark to be queried belongs to based on the rejection reasons and generating logic for similar cases.

[0029] Compared with the prior art, the present invention has the following beneficial effects:

[0030] A method for quickly querying trademark similar cases of the present invention standardizes the reasons for trademark rejection, and formulates corresponding similar case generation logic according to various rejection reasons, and relies on big data to perform real-time query of trademark similar cases. Compared with traditional manual operations, the efficiency of similar case generation is improved, and the dependence on professional business experience and the requirements for query personnel are reduced. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings required for use in the embodiments will be briefly introduced below. Obviously, the accompanying drawings in the following description are only some embodiments described in the present invention. For those of ordinary skill in the art, without creative efforts, other accompanying drawings can be obtained based on these drawings.

[0032] Figure 1 It is a method flow chart of a method for quickly querying trademark-related cases of the present invention. Specific embodiments

[0033] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present invention.

[0034] In the present invention, the explanations of some terms are as follows:

[0035] a. ElasticSearch: A data storage system;

[0036] b. Trademark application: The trademark to be applied for registration currently;

[0037] c. Cited trademark: When the trademark application is rejected, the trademark similar to the applied trademark cited in the rejection;

[0038] d. Trademark-related cases: Refer to a group of trademarks that have the same logical relationship as the applied trademark and the cited trademark, and are used as the basis for review during the review of the trademark application. For example: The applied trademark A is rejected because it is similar to the cited trademark B, but it is known that there are other trademarks C and D that also have a similar similarity situation, but have been successfully applied. When reviewing, trademarks B and C are used as the basis for review, then trademarks B and C are a group of related cases.

[0039] e. Similar group: In trademark classification, the "Distinction Table" (i.e., the "Distinction Table of Similar Goods and Services") divides goods or services with a similar relationship into similar groups, and the similar group is the main reference for judging the similar relationship of goods or services.

[0040] f. Shape similarity library: A dictionary library for storing shape-similar characters. For example: "财" and "贝才", the English letter "O" and the number zero "0"

[0041] g. Meaning library: A dictionary library for storing synonyms. For example: "开心" and "快乐", "狗" and "dog".

[0042] Embodiment 1

[0043] This embodiment provides a method for quickly searching trademark cases. The specific process is as follows: Figure 1 As shown, the specific steps include:

[0044] S1. Classification of rejection of trademark applications: Classify the rejection reasons of trademark applications, and distinguish the classification of each rejection reason by similar case generation logic. The similar case generation logic includes general logic, meaning logic, graphic logic and digital logic;

[0045] S2. Generate similar case groups: Generate corresponding similar case groups according to different similar case generation logics. Assume that the number of generated similar case groups is m. For general logic and meaning logic, determine the comparison relationship between the applied trademark and the cited trademark, and then search and generate similar case groups in similar groups based on the comparison relationship; for digital logic, parse the numbers contained in the applied trademark, and search and generate similar case groups in similar groups based on the numbers; for graphic logic, search for similar cases that have been successfully reviewed and where both the applied trademark and the cited trademark are graphic trademarks;

[0046] S3. Cleaning and importing the open data set of the Trademark Office: Based on the full amount of trademark application data provided by the Trademark Office, download the original data, clean the original data, create an index based on the four types of case generation logic, and store it in ElasticSearch to form a trademark database;

[0047] Data cleaning is to correct data format errors or clear data (such as expired trademarks) from the downloaded original data files. Data cleaning belongs to the existing technology and will not be described in detail here.

[0048] S4 Trademark Class Case Query: Identify and confirm trademark elements based on the applied trademark name, applied trademark similarity group, cited trademark name, cited trademark similarity group and the rejection reason of the applied trademark that the user wants to query, and search for m groups of similar cases in the trademark database according to the method of step S2 for the identification result, thus completing the trademark class case query.

[0049] Example 2

[0050] Based on Example 1, this embodiment classifies the reasons for rejection of the trademark application in step S1 into eleven categories, namely: (1) the trademark application is rejected because of the Chinese characters; (2) the English characters in the trademark application are rejected because of the English characters in the cited trademark; (3) the English characters in the trademark application are rejected because of the Pinyin characters in the cited trademark; (4) the Pinyin characters in the trademark application are rejected because of the English characters in the cited trademark; (5) the Pinyin characters in the trademark application are rejected because of the Pinyin characters in the cited trademark; (6) the trademark application is rejected because of single words; (7) the Chinese characters in the trademark application are rejected because of the meaning of the English characters in the cited trademark; (8) the English characters in the trademark application are rejected because of the meaning of the Chinese characters in the cited trademark; (9) the trademark application is rejected because of letters; (10) the trademark application is rejected because of graphics; and (11) the trademark application is rejected because of numbers.

[0051] Example 3

[0052] Based on Example 2, this example classifies the reasons for rejection into similar cases and generates logical distinctions as follows: (1)(2)(3)(4)(5)(6)(9) of the reasons for rejection of a trademark application are general logics; (7)(8) of the reasons for rejection of a trademark application are meaning logics; (10) of the reasons for rejection of a trademark application are graphic logics; and (11) of the reasons for rejection of a trademark application are digital logics.

[0053] Example 4

[0054] Based on the first embodiment, the process of generating a similar case group whose similar case generation logic is a general logic in step S2 is as follows:

[0055] S211. Find the comparative relationship between the applied trademark and the cited trademark. The specific process is: find the similar groups corresponding to the applied trademark and the cited trademark, and find which character positions of the applied trademark name are the same as those of the cited trademark name, that is, the comparative relationship between the applied trademark and the cited trademark when they belong to the common logic;

[0056] S212. Based on the obtained comparison relationship between the applied trademark and the cited trademark, search for trademark cases that meet the same comparison relationship in the similar groups corresponding to the applied trademark and the cited trademark respectively, and form a class case group for each trademark case that meets the same comparison relationship;

[0057] S213. If the number of trademark case groups found in the similar groups corresponding to the applied trademark and the cited trademark is less than m, search in different similar groups until the number of similar case groups is m.

[0058] In this embodiment, for example, the applied trademark is "Poly Sunshine", the similar group is 0602, the cited trademark is "Paul Sunshine", and the similar group is 0603. The comparison relationship is as follows: The character positions 1, 3, and 4 of the applied trademark and the cited trademark are the same, and the character position 2 is different.

[0059] Search for two trademark cases with the above comparison relationship (i.e., trademark cases where the character positions 1, 3, and 4 are the same and the character position 2 is different) in the similar group 0602 of the applied trademark and the similar group 0603 of the cited trademark respectively. For example, "Hanji Herb" found in the similar group 0602 and "Han Zhen Herb" found in the similar group 0603 have the same comparison relationship as the applied trademark and the cited trademark, so these two cases form a group of similar cases.

[0060] The number of groups of similar cases in this embodiment is preferably 300 groups, that is, m is 300. If the number of groups of similar cases found in the similar groups 0602 and 0603 is less than 300 groups, then search for groups of similar cases with the same comparison relationship as the applied trademark and the cited trademark without restricting the similar groups until 300 groups are satisfied.

[0061] In this embodiment, the number of characters of the applied trademark and the cited trademark may be different.

[0062] Embodiment 5

[0063] Based on Embodiment 1, in this embodiment, the generation process of the group of similar cases with the meaning logic for the similar case generation logic in step S2 is as follows:

[0064] S221. Find the comparison relationship between the applied trademark and the cited trademark: According to the near-synonym groups in the meaning library, find the similar groups corresponding to the applied trademark and the cited trademark, and find which character positions in the name of the applied trademark form a meaning that is a near-synonym of the meaning formed by which character positions in the name of the cited trademark, that is, obtain the comparison relationship when the applied trademark and the cited trademark belong to the meaning logic.

[0065] S222. According to the obtained comparison relationship between the applied trademark and the cited trademark, search for trademark cases with the same comparison relationship in the similar groups corresponding to the applied trademark and the cited trademark respectively. Each trademark case with the same comparison relationship found forms a group of similar cases.

[0066] S223. If the number of groups of trademark cases found in the similar groups corresponding to the applied trademark and the cited trademark respectively is less than m, then search in different similar groups until the number of groups of similar cases reaches m.

[0067] In this embodiment, for example, the applied trademark is "happy dog", the similar group is 4301, the cited trademark is "快乐狗" (Happy Dog), and the similar group is also 4301 (in actual application, the similar groups of the applied trademark and the cited trademark may or may not be the same). The comparison relationship is as follows: The characters at positions 1-5 of the applied trademark and the characters at positions 1-2 of the cited trademark are synonyms.

[0068] In the similar group 4301 of the applied trademark and the cited trademark (if the similar groups of the applied trademark and the cited trademark are not the same, search separately in the two similar groups), search for two trademark cases with the above comparison relationship (that is, the trademark cases where the characters at positions 1-5 of the applied trademark and the characters at positions 1-2 of the cited trademark are synonyms). For example, "lemon food valley" found in the similar group 4301 and "柠檬食谷" (Lemon Food Valley) found in the similar group 0603 have the same comparison relationship as the applied trademark and the cited trademark, so these two cases form a group of similar cases.

[0069] The number of groups of similar cases in this embodiment is preferably 300 groups, that is, m is 300. If the number of groups of similar cases found in the similar group 4301 is less than 300 groups, then search without restricting the similar group for groups of similar cases with the same comparison relationship as the applied trademark and the cited trademark until 300 groups are satisfied.

[0070] Embodiment 6

[0071] Based on Embodiment 1, in this embodiment, the generation process of the group of similar cases with digital logic for the similar case generation logic in step S2 is as follows:

[0072] S231. Find the similar group where the applied trademark is located, and determine the numbers included in the applied trademark name, denoted as y, and determine the number of digits of y.

[0073] S232. Subtract 1 from the numbers in the applied trademark name, that is, y - 1. Search in the similar group where the applied trademark is located for the trademark corresponding to y - 1 as a, and the trademark corresponding to y - 2 as b. Then, trademark a and trademark b form a group of similar cases. Continue to search in the similar group where the applied trademark is located for the trademark corresponding to y - 3 as c, and the trademark corresponding to y - 4 as d. Then, trademark c and trademark d also form a group of similar cases... and so on. If the number of digits changes after subtracting a number from y, add 0 in front to keep the number of digits the same as y and continue to search for the trademark corresponding to the corresponding number. If it is less than 0 after subtracting a number from y, change it to y + 1 and continue to search for the trademark corresponding to the corresponding number in the same similar group while keeping the number of digits unchanged until m groups of similar cases are found. If the number of digits of the last searched number is the same as y and all digits are 9, then even if m groups of similar cases are not fully found after searching for the trademark corresponding to the current number, stop searching. The found trademarks form a group of similar cases every two in the search order.

[0074] In this embodiment, m is also preferably 300.

[0075] In this embodiment, for example, the applied trademark is "Meet in 1999", the similar group is 4301, the number contained in the trademark is 1999, and it is a four-digit number. The search process in the similar group 4301 is as follows: Search for the trademarks corresponding to 1998 and 1997 respectively, and form a group of similar cases with these two found trademarks. Continue to search for the trademarks corresponding to 1996 and 1995 respectively, and form a group of similar cases with these two found trademarks, and so on, until m groups of similar cases are filled.

[0076] For example, the applied trademark is "Meet in 1235", the similar group is 4302, the number contained in the trademark is 1235, and it is a four-digit number. During the search process in the similar group 4302, when the previous searched number is 1000, the next searched number is 999. At this time, a 0 needs to be added in front to make it 0999, and continue to search for trademarks through 0999 until m groups of similar cases are filled.

[0077] For example, the applied trademark is "Meet in 4", the similar group is 4303, the number contained in the trademark is 4, and it is a single-digit number. During the search process in the similar group 4303, when the previous searched number is 0, the next searched number is -1, which is less than 0. Instead of using -1 for searching, use the number 4 + 1 = 5 to search for the corresponding trademark. If the number of digits of the last searched number is the same as y and all digits are 9 (such as the last searched number is 9 in this example), then after searching for the trademark corresponding to the current number, even if m groups of similar cases are not filled, the search will not continue.

[0078] Embodiment 7

[0079] Based on Embodiment 1, the process of establishing an index according to four types of similar case generation logics in step S3 is as follows:

[0080] S31. For the general logic and the meaning logic, split the trademark name into independent characters one by one, and record the position of each character as 0, 1, 2, 3,... from left to right. Quickly search through the index whether the data at any character position is the required character;

[0081] S32. For the digital logic, extract the numbers in the trademark name and query the data containing this number through the index;

[0082] S33. For the graphic logic, establish an index for the review result and the trademark type, where the trademark type indicates whether the trademark is a graphic trademark.

[0083] Embodiment 8

[0084] In this embodiment, based on the embodiment 1, the process of identifying trademark elements in step S4 is as follows: determining which category the applied trademark to be queried belongs to based on the rejection reason and generating logic for similar cases.

[0085] The embodiments described above are merely descriptions of preferred implementation modes of the present invention, and are not intended to limit the concept and scope of the present invention. Without departing from the design concept of the present invention, various modifications and improvements made to the technical solutions of the present invention by ordinary engineering technicians in the field should fall within the protection scope of the present invention. The technical contents for which protection is sought in the present invention have been fully recorded in the technical requirements.

Claims

1. A method for quickly searching for trademark cases, characterized by: The specific steps include: S1. Classification of rejection of trademark applications: Classify the rejection reasons of trademark applications, and distinguish the classification of each rejection reason by similar case generation logic. The similar case generation logic includes general logic, meaning logic, graphic logic and digital logic; S2. Generate similar case groups: Generate corresponding similar case groups according to different similar case generation logics. Assume that the number of generated similar case groups is m. For the general logic and meaning logic, determine the comparison relationship between the applied trademark and the cited trademark, and then search and generate similar case groups in the similar group according to the comparison relationship. For digital logic, the numbers contained in the applied trademark are analyzed, and similar cases are searched in similar groups based on the numbers to generate similar cases; for graphic logic, similar cases that have been successfully reviewed and where both the applied trademark and the cited trademark are graphic trademarks are searched; S3. Cleaning and importing the open data set of the Trademark Office: Based on the full amount of trademark application data provided by the Trademark Office, download the original data, clean the original data, create an index based on the four types of case generation logic, and store it in ElasticSearch to form a trademark database; S4 Trademark Class Case Query: Identify and confirm trademark elements based on the applied trademark name, applied trademark similarity group, cited trademark name, cited trademark similarity group and the rejection reason of the applied trademark that the user wants to query, and search for m groups of similar cases in the trademark database according to the method of step S2 for the identification result, thus completing the trademark class case query.

2. The method for quickly searching for trademark cases according to claim 1 is characterized by: In the step S1, the reasons for rejection of the trademark application are classified into eleven categories, namely (1) the trademark application is rejected because of the Chinese characters; (2) the English characters in the trademark application are rejected because of the English characters in the cited trademark; (3) the English characters in the trademark application are rejected because of the Pinyin characters in the cited trademark; (4) the Pinyin characters in the trademark application are rejected because of the English characters in the cited trademark; (5) the Pinyin characters in the trademark application are rejected because of the Pinyin characters in the cited trademark; (6) the trademark application is rejected because of single words; (7) the Chinese characters in the trademark application are rejected because of the meaning of the English characters in the cited trademark; (8) the English characters in the trademark application are rejected because of the meaning of the Chinese characters in the cited trademark; (9) the trademark application is rejected because of letters; (10) the trademark application is rejected because of graphics; and (11) the trademark application is rejected because of numbers.

3. The method for quickly searching for trademark cases according to claim 2 is characterized by: In step S1, the classification of each rejection reason is carried out to generate similar case logic. Specifically, (1)(2)(3)(4)(5)(6)(9) of the rejection reasons for the applied trademark are general logic; (7)(8) of the rejection reasons for the applied trademark are meaning logic; (10) of the rejection reasons for the applied trademark are graphic logic; and (11) of the rejection reasons for the applied trademark are digital logic.

4. The method for quickly searching for trademark cases according to claim 1 is characterized by: The generation process of the similar case group in step S2 for which the similar case generation logic is the general logic is as follows: S211. Find the comparative relationship between the applied trademark and the cited trademark. The specific process is: find the similar groups corresponding to the applied trademark and the cited trademark, and find which character positions of the applied trademark name are the same as those of the cited trademark name, that is, the comparative relationship between the applied trademark and the cited trademark when they belong to the common logic; S212. Based on the obtained comparison relationship between the applied trademark and the cited trademark, search for trademark cases that meet the same comparison relationship in the similar groups corresponding to the applied trademark and the cited trademark respectively, and form a class case group for each trademark case that meets the same comparison relationship; S213. If the number of trademark case groups found in the similarity groups corresponding to the applied trademark and the cited trademark is less than m, search in different similarity groups until the number of similar case groups is m.

5. The method for quickly searching for trademark cases according to claim 1 is characterized by: The generation process of the similar case group in step S2, where the similar case generation logic is the meaning logic, is as follows: S221. Find the comparative relationship between the applied trademark and the cited trademark: find the similar groups corresponding to the applied trademark and the cited trademark according to the synonym groups in the meaning database, and find out which character positions in the applied trademark name form the meaning and which character positions in the cited trademark name form the synonyms, that is, obtain the comparative relationship between the applied trademark and the cited trademark when they belong to the meaning logic; S222. Based on the obtained comparison relationship between the applied trademark and the cited trademark, search for trademark cases that meet the same comparison relationship in the similar groups corresponding to the applied trademark and the cited trademark respectively, and form a class case group for each trademark case that meets the same comparison relationship; S223. If the number of trademark case groups found in the similarity groups corresponding to the applied trademark and the cited trademark is less than m, search in different similarity groups until the number of similar case groups is m.

6. The method for quickly searching for trademark cases according to claim 1, characterized in that: The generation process of the similar case group in step S2 for the similar case generation logic being digital logic is as follows: S231, find the similar group to which the applied trademark belongs, determine the number contained in the name of the applied trademark, set it as y, and determine the number of digits of y; S232. Subtract 1 from the number in the name of the applied trademark, i.e. y-1. In the similar group where the applied trademark is located, search for the trademark corresponding to y-1 and the trademark corresponding to y-2, i.e. a. Then trademark a and trademark b form a group of similar cases. Then search for the trademark corresponding to y-3 and the trademark corresponding to y-4 in the similar group where the applied trademark is located, i.e. c. Then trademark c and trademark d also form a group of similar cases. And so on. If the number of digits in y changes after a digit is subtracted, add 0 in front to keep the number of digits the same as y, and continue to search for the trademark corresponding to the corresponding number. If y is less than 0 after a digit is subtracted, add 1 to y, and continue to search for the trademark corresponding to the corresponding number in the same similar group, and keep the number of digits unchanged, until m groups of similar cases are found. If the number of digits in the last searched number is the same as y, and all digits are 9, after finding the trademark corresponding to the current number, even if m groups of similar cases have not been found, the search will not continue, and the found trademarks will form a group of similar cases in every two according to the search order.

7. The method for quickly searching for trademark cases according to claim 1, characterized in that: The process of establishing indexes according to the four case generation logics in step S3 is as follows: S31. For general logic and meaning logic, the trademark name is split into independent characters one by one, and the position of each character is recorded as 0, 1, 2, 3, ... from left to right, and the data of whether any character position is the required character is quickly found through the index; S32. For digital logic, extract the numbers in the trademark name and search for data containing the numbers through indexes; S33. For graphic logic, an index is created for the review result and the trademark type, where the trademark type refers to whether the trademark is a graphic trademark.

8. The method for quickly searching trademark cases according to claim 1, characterized in that: The process of identifying trademark elements in step S4 is as follows: determining which category of similar cases the applied trademark to be queried belongs to based on the rejection reasons and generating logic for similar cases.

Images