System for creating a database of text entries in a hierarchical classifier

Abstract

A system for creating a database of text entries in a hierarchical classifier comprises a processor coupled to a memory containing instructions for performing the steps of: identifying a set of unique text entries in a hierarchical classifier having a single nesting level, wherein each unique text entry is associated with a unique heading and each unique heading contains a list consisting of a set of unique subheadings; associating the identified unique text entries with one of the unique subheadings to obtain a set of associated text entries; creating a database of text entries in a hierarchical classifier having several nesting levels, the database containing a set of associated text entries, each of which is associated with a relational feature, wherein each relational feature corresponds to one of the subheadings. The technical results is that of automating the generation of lists of goods and services and increasing the accuracy with which lists of goods and services are generated.

Description

SYSTEM FOR FORMING A DATABASE OF TEXT RECORDS OF A HIERARCHICAL CLASSIFIER WITH SEVERAL NESTING LEVELS AREA OF TECHNOLOGY [OOO 1] This technical solution relates to the field of digital technologies, in particular to methods of forming databases of text records of a hierarchical classifier with several levels of nesting. LEVEL OF TECHNOLOGY

[0002] In the traditional trademark application process, there is a relative difficulty in selecting the correct list of goods and services that accurately reflect the required goods and / or services and, accordingly, the correct selection of classes according to the International Classification of Goods and Services (ICGS).

[0003] As a rule, the complexity of this process is due to the need for the required professional knowledge in terms of trademark registration, which makes the process of properly preparing documents virtually impossible for a person who does not possess such skills.

[0004] Furthermore, when filing a trademark application, a fuzzy search is currently used to find goods and services within the entire Nice Classification to find similar results. However, users who don't understand the Nice Classification methodology will have a very difficult time finding the correct and relevant entries identifying the goods and services. This can also lead to users missing important elements they actually need to properly file a trademark (service mark) application. For example, a clothing store owner might not realize that they actually want to provide "wholesale and retail clothing." Instead, they are asked to search for specific products within the category themselves, such as "women's clothing, men's clothing, shirts."

[0005] On the other hand, in the context of globalization of business, many companies and brands focused on international business attach great importance to the demand for trademarks and their protection. These companies and brands often register trademarks in multiple countries to protect their brand identity and Ensure its uniqueness and recognition worldwide. However, trademark laws and trademark classification systems may differ in each country, so when conducting international trademark registration, the problem of correctly classifying goods and services in accordance with the requirements of a specific country's classification system often arises.

[0006] Application TW 202349324 A (AIPLUX TECHNOLOGY CO LTD, December 16, 2023) proposes the development of a converter for the International Classification of Goods and Services (ICGS) classifier, taking into account the applicable laws of the country in which the trademark application is to be filed. The solution comprises a user-controlled electronic device connected to a server with specialized software implementing an online trademark application module, allowing the user to enter the necessary information for filing the trademark application. When the user selects the option for an international trademark application and specifies at least one other country of filing the trademark application, the processor activates the category conversion module in the application program.

[0007] The main disadvantage is the link to specific formulations of the classifier, as well as the lack of the ability to automatically select goods and services from the classifier for the required area when preparing an application for trademark registration, without the need to review the entire classifier of goods and services. ESSENCE OF THE INVENTION

[0008] The proposed technical solution addresses the problem of creating a more complete and accurate classifier of goods and services, enabling the formation of hierarchical relationships for the subsequent automated selection of required goods and services.

[0009] The technical result is the automation of the formation of a list of goods and services and an increase in the accuracy of the formation of a list of goods and services through the use of hierarchical relationships using the record relatedness feature.

[0010] In a preferred embodiment, a system for forming a database of text records of a hierarchical classifier with several levels of nesting is claimed, containing at least one processor connected to at least one memory that contains instructions executable by the processor, which, when executed by the processor, allow: - identify a set of unique text entries of a hierarchical classifier with one level of nesting, wherein each unique text entry is associated with a unique heading; each unique heading contains a list consisting of at least a set of unique subheadings; - associate said identified unique text entries with one of said unique subheadings to obtain a set of associated text entries; - to form a database of text records of a hierarchical classifier with several levels of nesting, containing at least a plurality of said associated text records, with each of which at least one first feature of relatedness is associated, wherein each first feature of relatedness corresponds to one of said subheadings. [UN] In one particular implementation example, the first attribute of relatedness is a unique identifier of one of the mentioned subheadings.

[0012] In another particular example of implementation, the plurality of unique subheadings includes first unique subheadings and second unique subheadings.

[0013] In another particular implementation example, at least the first unique header is associated with at least the second unique header.

[0014] In another particular example of implementation, the association is accomplished by associating a unique identifier of a first unique subheading with a unique identifier of a second unique subheading to obtain at least a first associated unique subheading and a second associated unique subheading.

[0015] In another particular implementation example, the associated unique subheadings are not each associated with the same unique heading.

[0016] In another particular example of implementation, when an associated text entry is associated with a first associated unique subtitle, such text entry is also associated with a second associated unique subtitle with which said first associated unique subtitle is associated.

[0017] In another particular example of implementation, a database of text records of a hierarchical classifier with several levels of nesting contains at least a plurality of said associated text records, with each of which several relatedness features are associated.

[0018] In another particular example of implementation, the number of relatedness features corresponds to the number of associated unique subheadings, and such associated unique subheadings are associated with each other.

[0019] In another particular implementation example, the associated unique subheadings are not each associated with the same unique heading.

[0020] In another particular example of implementation, the plurality of associated text entries includes a plurality of first associated text entries and a plurality of second associated text entries.

[0021] In another particular example of implementation, at least one second associated text entry is associated with at least one second relatedness feature.

[0022] In another particular implementation example, the second relatedness feature is a unique identifier of one of the first associated text entries.

[0023] In another particular example of implementation, the second associated text entry is associated with the same associated unique subtitle with which the first associated text entry is associated, with which the second associated text entry is associated.

[0024] In another particular example of implementation, at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

[0025] In another particular example of implementation, at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

[0026] In another particular example of implementation, at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

[0027] In another particular example of implementation, at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

[0028] Other specific examples of the implementation of the claimed invention will be set out further in these application materials. BRIEF DESCRIPTION OF DRAWINGS

[0029] Fig. 1 illustrates a method for forming a database of unique entities.

[0030] Fig. 2 illustrates a method for accessing a database.

[0031] Fig. 3 illustrates a method for generating a list of goods and / or services using a database.

[0032] Fig. 4 illustrates an example of a computing device. IMPLEMENTATION OF THE INVENTION

[0033] As shown in Fig. 1, within the framework of the implementation of the claimed solution, a method (100) is proposed for forming a database of text records of a hierarchical classifier with several levels of nesting. During its implementation, the identification (101) of a plurality of unique text records of a hierarchical classifier with a single level of nesting is performed, which is, for example, but not limited to, the Nice Classification of Goods and Services, or any other suitable classifier having only one level of nesting, that is, when entities are directly assigned to a class, bypassing intermediate levels. For example, without limitation, each record in the Nice Classification of Goods and Services, which is a unique record identifying the corresponding product or service, is associated with a unique heading, which has a general description of the class of goods or services corresponding to the heading, for example, class 9 of the Nice Classification of Goods and Services "Control, measuring and signaling equipment".

[0034] Each unique heading contains a list of at least a plurality of unique subheadings that represent a specific name of goods or services, such as: - 90151 Electrical monitoring and control equipment, except medical; - 90149 devices for controlling payment by postage stamps; - 90067 comparators; - 90240 machines and devices for testing materials.

[0035] The description of each subheading is a unique text entry that is associated (102) with one of the mentioned unique subheadings by means of a connectivity feature, which, for example, but not limited to, is an identifier (ID) of the subheading, in particular: 90151, 90149, 90067, etc. This makes it possible to obtain a plurality of associated text entries. Based on the obtained association data, a database of text entries of a hierarchical classifier with several levels of nesting is formed (103), which contains at least a plurality of the mentioned associated text entries, with each of which at least one first connectivity feature is associated, where each first connectivity feature corresponds to one of the mentioned subheadings.

[0036] Some unique subheadings may be related to each other due to the presence of corresponding goods or services that fall under different unique subheadings but may belong to the same field of application and be homogeneous. For example, the field "software" may include both direct goods in Class 9 of the Nice Classification (ICGS), as well as services for their development, which are in Class 42, as well as software licensing services in Class 45 of the Nice Classification (ICGS).

[0037] To associate goods and services without further specification, similar goods and services are associated by linking their unique subheadings. This association is accomplished by associating the unique identifier of the first unique subheading with the unique identifier of the second unique subheading to obtain at least a first associated unique subheading and a second associated unique subheading. However, the associated unique subheadings are not each associated with the same unique heading.

[0038] In this case, if the associated text entry is associated with the first associated unique subtitle, such text entry is also associated with the second associated unique subtitle, with which the mentioned first associated unique subtitle is associated.

[0039] By using the association of unique text records, a database of text records of a hierarchical classifier with several levels is formed The nesting structure contains at least a plurality of the aforementioned associated text entries, each of which is associated with several relatedness features. The number of such relatedness features corresponds to the number of associated unique subheadings, and such associated unique subheadings are associated with each other. However, each associated unique subheading is not associated with the same unique heading.

[0040] A plurality of associated text entries may include a plurality of first associated text entries and a plurality of second associated text entries, wherein at least one second associated text entry is associated with at least one second relatedness feature, which may be a unique identifier of one of the first associated text entries. Moreover, the second associated text entry may be associated with the same associated unique subtitle with which the first associated text entry is associated, with which the second associated text entry is associated.

[0041] The set of associated text entries may include a set of first associated text entries and a set of second associated text entries. At least some of the set of unique text entries may be derived from at least one list of goods and services of a published trademark application or registered trademark. The set of unique subheadings may include first unique subheadings and second unique subheadings.

[0042] As shown in Fig. 2, the database generated in the manner described above is used to access (200) in an automated mode to unique associated text records when forming a list of goods and services by retrieving the data stored therein. First, a request (201) is generated using a computing client or server device, then the database is accessed to retrieve (202) at least the first associated text record and at least the first unique subheading, the unique identifier of which is the first sign of the relatedness of the retrieved first associated text record. The retrieved record is transmitted (203) to the device with which the request for accessing the database was generated to perform the retrieval process. The display of the retrieved record can displayed in a graphical interface implemented on a computing device, or directly transmitted for subsequent formation of a list of goods and / or services.

[0043] Additionally, a second unique subtitle associated with the extracted first unique subtitle may be extracted. Additionally, at least another first associated text entry associated with the extracted second unique subtitle may be extracted. Additionally, at least the first associated text entry and at least a second associated text entry associated with the extracted first associated text entry may be extracted.

[0044] Fig. 3 shows a method (300) for generating a list of goods and services using a generated database of associated records, within the framework of which, based on the results of the implementation of the method (200), identification (301) of a plurality of text records extracted from the database is performed, after which a list of goods and / or services is generated (302), in which the text records are written using a separator, for example, a semicolon (“;”), followed by a space, which is due to the fact that, as a rule, when preparing an application for a trademark, it is necessary to prepare a list of goods and services, where a plurality of goods and services are listed using exactly this separator;however, it will be obvious to one skilled in the art that any suitable separator may be used that is permitted by any of the requirements of the trademark application, or that is required for the electronic trademark application system to be able to process the electronic trademark application file that includes the said list, or the electronic file of the list as such.

[0045] The plurality of extracted text entries may include at least one of, or any combination of: - the first associated text entry associated with the first unique subtitle; - the first unique subtitle; - second unique subtitle; - the first associated text entry associated with the second unique subtitle; - the first associated text entry associated with the first unique subtitle, - the first unique subtitle, - the second unique subtitle, - the first associated text entry associated with the second unique subtitle, - the second associated text entry associated with the retrieved first associated text entry.

[0046] The generated list of goods and / or services at the end of step (302) is displayed on the user's computing device and / or server device, or in the web interface when accessing the list generation via a web browser. Additionally, the generated list can be automatically saved to an XML file.

[0047] The implementation of the above solution in terms of the implementation of the method for generating a database, extracting from the generated database, as well as the associated stages and implementation of the claimed solution can be carried out using a computer device, for example, a personal computer, a server, using a distributed server system or in the form of a client-server implementation.

[0048] Fig. 4 shows a general example of a computing device (400), for example, a computing unit (computing module), a computer, a server, a laptop, a smartphone, a SoC (System-on-a-Chip), etc., which can be used for the full or partial implementation of the claimed solution, in particular, for the implementation of the methods (100, 200, 300). In the general case, the device (400) contains such components as: one or more processors (401), at least one random access memory (402), a persistent data storage means (403), input / output interfaces (404) including relay outputs for connection to belt conveyor motion control controllers, an I / O means (405), and network interaction means (406).

[0049] The processor (401) of the device performs the basic computing operations necessary for the functioning of the device (400) or the functionality of one or more of its components. The processor (401) executes the necessary machine-readable commands contained in the RAM (402).

[0050] Memory (402) is typically implemented as RAM and contains the necessary software logic to provide the required functionality. Data storage (403) can be implemented as HDD, SSD, RAID array, network storage, flash memory, optical storage (CD, DVD, MD, Blue-Ray discs), etc. Data storage (403) enables long-term storage of various types of information, such as request processing history (logs), user identifiers, camera data, images, etc.

[0051] Interfaces (404) are standard means for connecting and working with computing devices. Interfaces (404) may represent, for example, relay connections, USB, RS232 / 422 / 485 or others, RJ45, LPT, UART, COM, HDMI, PS / 2, Lightning, FireWire, etc. for work, including, via Modbus protocols and Probfibus networks. The choice of interfaces (404) depends on the specific design of the device (400), which can be a computing unit (computing module), for example, based on a CPU (one or more processors), a microcontroller, etc., a personal computer, a mainframe, a server cluster, a thin client, a smartphone, a laptop, etc., as well as connected third-party devices.

[0052] The following can be used as I / O data means (405): keyboard, joystick, display (touch display), projector, touchpad, mouse, trackball, light pen, speakers, microphone, etc.

[0053] The network interaction means (406) are selected from a device that provides network reception and transmission of data, for example, an Ethernet card, a WLAN / Wi-Fi module, a Bluetooth module, a BLE module, an NFC module, an IrDa module, an RFID module, a GSM modem, etc. With the help of the means (406), the organization of data exchange is ensured via a wired or wireless data transmission channel, for example, a WAN, PAN, LAN, Intranet, Internet, WLAN, WMAN or GSM, a quantum data transmission channel, satellite communications, etc. The components of the device (400), as a rule, are connected via a common data transmission bus.

[0054] In these application materials, a preferred disclosure of the implementation of the claimed technical solution has been presented, which should not be used as limiting other, particular embodiments of its implementation, which do not go beyond the scope of the requested scope of legal protection and are obvious to specialists in the relevant field of technology.

Claims

FORMULA 1. A system for forming a database of text records of a hierarchical classifier with several levels of nesting, containing at least one processor connected to at least one memory that contains instructions executable by the processor, which, when executed by the processor, allow: - identify a set of unique text entries of a hierarchical classifier with one level of nesting, wherein each unique text entry is associated with a unique heading; each unique heading contains a list consisting of at least a set of unique subheadings; - associate said identified unique text entries with one of said unique subheadings to obtain a set of associated text entries; - to form a database of text records of a hierarchical classifier with several levels of nesting, containing at least a plurality of said associated text records, with each of which at least one first feature of relatedness is associated, wherein each first feature of relatedness corresponds to one of said subheadings.

2. The system according to I. 1, characterized by the fact that the first sign of relatedness is a unique identifier of one of the mentioned subheadings.

3. The system according to any one of claims 1 or 2, characterized in that the plurality of unique subheadings includes first unique subheadings and second unique subheadings.

4. The system according to claim 3, characterized in that at least the first unique title is associated with at least the second unique title.

5. The system according to claim 4, characterized in that the association is accomplished by associating the unique identifier of the first unique subheading with the unique identifier of the second unique subheading to obtain at least the first associated unique subheading and the second associated unique subheading.

6. The system of claim 5, wherein the associated unique subheadings are not each associated with the same unique heading.

7. The system of claim 6, wherein when an associated text entry is associated with a first associated unique subheading, such text entry is also associated with a second associated unique subheading with which said first associated unique subheading is associated.

8. The system according to claim 7, characterized in that the database of text records of the hierarchical classifier with several levels of nesting contains at least a plurality of the mentioned associated text records, with each of which several relatedness features are associated.

9. The system according to claim 8, characterized in that the number of relatedness features corresponds to the number of associated unique subheadings, and such associated unique subheadings are associated with each other.

10. The system according to any one of claims 7-9, characterized in that the associated unique subheadings are not each associated with the same unique heading.

11. The system according to any one of claims 1 or 2, characterized in that the plurality of associated text entries includes a plurality of first associated text entries and a plurality of second associated text entries.

12. The system according to claim 10, characterized in that at least one second associated text entry is associated with at least one second relatedness feature.

13. The system according to claim 11, characterized in that the second sign of relatedness is a unique identifier of one of the first associated text records.

14. The system according to claim 12, characterized in that the second associated text entry is associated with the same associated unique subtitle with which the first associated text entry is associated, with which the second associated text entry is associated.

15. The system according to any one of claims 1, 3-9, 12-14, characterized in that at least part of the plurality of unique text records is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

16. The system of claim 2, wherein at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

17. The system of claim 10, wherein at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

18. The system of claim 11, wherein at least a portion of the plurality of unique text entries is obtained from at least one list of goods and services of a published trademark application or a registered trademark.

Images