Upload a patent dataset to classify patents into technology categories using CPC codes and keywords.
Extracted from your dataset. Review the building blocks before forming categories.
Based on keywords and CPC classes. Edit names, add/remove items, or delete entire categories.
Drag and drop an Excel (.xlsx, .xls) or CSV file. Supports exports from Quartet, Lens.org, and PatSnap.
The tool scans CPC codes to build initial categories. Review them in the sidebar — edit, delete, or keep as-is.
Click + New Category to define categories using CPC codes and keywords with precise matching logic.
Click Run Taxonomy to classify all patents. Export as XLSX for use in the Patent Landscape Dashboard.
Click + New Category in the sidebar. Each category has a name and two groups of matching conditions:
Every item here is required. A patent must match all of them. Use for precise targeting.
Example: CPC G06N + keyword neural network = only patents about neural networks classified under G06N.
A patent matching any single item here qualifies. Use to cast a wider net.
Example: CPC G06K7/10 or CPC G06F16/33 = patents from either classification.
A patent qualifies if it matches all required items, OR if it matches any optional item. This lets you define a core condition with broader alternatives.
Categories you create always take priority over auto-generated ones when assigning patents.
After running the taxonomy, each patent shows:
Use the search bar to filter patents by title, assignee, CPC code, or any other field.
Click any patent row to open a detail panel showing all fields and category information.
Click Export XLSX in the top bar. The file includes all original columns plus:
The exported file can be uploaded directly to the Patent Landscape Dashboard for visual analysis with charts and maps.
The simplest approach. Counts how many of your conditions a patent matches and divides by the total number of conditions.
How it works:
Example: Category has 3 conditions (CPC G06N, keyword “neural”, keyword “learning”). A patent matches 2 of 3 → confidence = 67%
Best for: Categories defined primarily by CPC codes, where keyword matching is secondary. Quick exploratory classification.
Combines Term Frequency–Inverse Document Frequency (TF-IDF) for keywords with CPC classification depth analysis. This is the default algorithm.
Three scoring factors:
1 + log(tf) prevents repeated words from inflating scores.G06N3/08 (7 chars) scores more than G06N (4 chars). Exact matches get a +2 bonus.Example: Keyword “quantum” appears in 12 of 8,700 patents (IDF = 6.6). A patent with “quantum” in the title scores 1 × 6.6 × 2 = 13.2. Keyword “method” appears in 4,000 patents (IDF = 0.78) → only 0.78.
Best for: Categories that mix CPC codes with keywords. The smart weighting helps when some keywords are generic and others are highly specific.
The ranking function used by search engines like Elasticsearch and Apache Lucene. An evolution of TF-IDF that better handles varying document lengths and term saturation.
Key advantages over TF-IDF:
k₁ = 1.5. Prevents keyword-stuffed patents from dominating.b = 0.75.log((N - df + 0.5) / (df + 0.5) + 1) which handles edge cases more gracefully than standard IDF.Example: Two patents match keyword “autonomous”. Patent A: 150 words, 2 mentions. Patent B: 3,000 words, 8 mentions. TF-IDF ranks B higher (more mentions). BM25 ranks them similarly because B’s length dilutes the signal.
Best for: Large datasets with abstracts of varying lengths. Categories defined mainly by keywords rather than CPC codes. When you want the most robust text-based matching.
| Simple | TF-IDF | BM25 | |
|---|---|---|---|
| Speed | ⚡ Fastest | ⚡ Fast | ⚡ Fast |
| Keyword weighting | Equal | By rarity | By rarity + saturation |
| Doc length handling | None | None | Normalized |
| Title vs Abstract | Same | Title 2× | Title 2× |
| CPC depth scoring | Prefix only | Depth-weighted | Depth-weighted |
| Best for | CPC-heavy | Mixed CPC + KW | Keyword-heavy |
After uploading your patent file, the system analyzes the entire dataset and extracts two sets of building blocks:
+ suffix for prefix matching. comput+ captures computer, computing, computational, etc.The system auto-generates 7–8 categories by matching keywords to CPC classes. Each category is shown as an editable card.
+ for prefix matching (e.g., sensor+).CPC G06N → patent must be in Machine Learning/AI classificationKW neural+ | KW deep learn+ | KW reinforc+CPC H04L | CPC H04W | KW wireless+ | KW network+Click “Apply & Classify” to run the taxonomy. Every patent is scored against each category and assigned to its best match.
detect+ matches detect, detection, detecting, detector, detectable.neural network+ is better than just neural+ which might match unrelated uses.G06N3 (Neural Networks) is more precise than G06N (all AI/ML).