Hierarchical Text Record Extraction for Trademark Classifier Navigation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of selecting the correct list of goods and services for trademark registration, particularly in international applications, is hindered by the need for professional knowledge and varying trademark laws across countries, and existing systems lack automated selection of goods and services.
Innovation Solution
A method for creating a multi-level hierarchical database of text records using a hierarchical classifier, enabling automated selection of goods and services by linking associated records through connectivity features, allowing for accurate and comprehensive formation of trademark application lists.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a hierarchical classifier with multiple levels of nesting is used to organize goods and services, then the accuracy and comprehensiveness of trademark application lists improve, but the complexity of selecting and navigating the classifier increases
Solution Approach 1:
The classifier is divided into multiple hierarchical levels (e.g., class, subclass, group, section) where each level represents a progressively finer granularity of goods and services. This segmentation allows users to navigate from broad categories to specific items systematically, improving accuracy while managing complexity through structured organization.
Solution Approach 2:
The patent implements a nested hierarchical structure where classes contain subclasses, subclasses contain groups, and groups contain sections. Each level is contained within the previous level, creating a nested doll-like structure that enables progressive refinement of search results from general to specific, thereby improving selection accuracy while providing a manageable navigation path.
2Productivity
If automated selection of goods and services is implemented, then productivity and efficiency improve, but the need for sophisticated classification systems and processing increases complexity
Solution Approach 1:
The system pre-organizes all goods and services into a hierarchical classifier structure before the trademark application process. This preliminary classification enables automated systems to quickly retrieve and select appropriate goods and services based on input keywords, significantly improving productivity while the complexity is managed through the structured pre-organization of data.
Solution Approach 2:
The hierarchical classifier acts as an intermediary layer between user input and the final goods and services selection. The automated system uses this intermediate structure to map user requests to appropriate classifier entries, enabling efficient automated selection without requiring direct complex processing of the entire goods and services list.
3Reliability
If the entire Nice Classification list is searched for exact or fuzzy matches, then comprehensive results are obtained, but the time required for selection increases significantly
Solution Approach 1:
The classifier is segmented into hierarchical levels that enable progressive filtering. Instead of searching the entire list at once, the system searches at each hierarchical level sequentially, narrowing down results from class to subclass to group to section. This segmentation maintains completeness by systematically exploring all relevant levels while dramatically reducing search time through incremental filtering.
Solution Approach 2:
The patent adds a hierarchical dimension to the classification system, transforming a flat comprehensive list into a multi-level structure. This dimensional change enables the system to maintain comprehensive coverage by exploring all levels while reducing search time through the ability to filter and narrow results at each hierarchical level, effectively adding a filtering dimension to the search process.
Data Source
AI summary
In a preferred embodiment claimed a method for extracting a text record from a database (DB) of text records of a hierarchical classifier with several levels of nesting, performed by the processor of a computing device and containing the following steps: forming request to the database of text records of a hierarchical classifier with several levels of nesting, wherein the database contains at least a set of the associated text records, and each record has an associated at least one first sign of connectivity, and each first sign of connectivity corresponds to one of the subheadings, in which each unique text record is associated with a unique title, and each unique title contains a list consisting of at least plurality of the unique subheadings; and identified unique text records are associated in the database with one of the unique subheadings forming a set of associated text records; extracting at least one associated text record from the database.