Prior art searching demands systematic analysis of millions of documents across multiple databases, languages, and jurisdictions. A typical comprehensive search evaluates 50-100 potentially relevant documents, each containing detailed technical disclosures that must be mapped to specific claim elements. The challenge is magnified when searching non-patent literature, which lacks the structured format of patent documents but often contains critical technical disclosures.

The fundamental challenge lies in balancing search breadth and precision while managing the cognitive load of analyzing complex technical relationships across large document sets.

This page brings together solutions from recent research—including AI-assisted claim element mapping, iterative classification-based refinement, concept-driven triage approaches, and automated search string optimization. These and other approaches focus on improving search accuracy while reducing the time required to identify and analyze relevant prior art.

1. Artificial Intelligence System for Semantic and Relationship Analysis of Patent Documents with Automated Metadata Consolidation and Visualization

IP.COM I LLC, 2025

Artificial intelligence (AI) system for analyzing patent documents to provide insights into technology development trends, competitive intelligence, and patent analysis. The system uses AI techniques like semantic analysis and relationship analysis to automatically identify the most critical patents and documents in a collection, determine what they reveal, and provide summaries and visualizations. It consolidates metadata like citations, litigation, and expiration dates to provide statistics like citation indices and influence factors. The AI also generates alerts, flags, and indicators based on patent quality, relevance, and expiration. The system aims to automate tasks like competitive analysis, prior art search, patentability assessment, and freedom to operate analysis using AI instead of manual review.

US2025124055A1-patent-drawing

2. Legal Research System with AI-Driven Natural Language Query Processing and Document Relevance Analysis

THOMSON REUTERS ENTERPRISE CENTRE GMBH, 2025

AI-assisted legal research system that enables more effective and efficient legal research by using AI techniques like large language models (LLMs) to generate summaries and analyze legal documents based on user inputs. The system receives natural language search queries instead of keywords and synthesizes responses using LLMs. It also ranks and quantifies relevance of documents to the query. This provides more accurate and conversational search results compared to traditional keyword-based search engines.

3. AI-Based System for Analyzing Claim Characteristics and Flagging Potential Issues Using Comparative Analysis

INTERNATIONAL BUSINESS MACHINES CORP, 2025

Cognitively identifying potential issues with claims using AI to analyze claim characteristics and compare them to similar claims to determine if an alert is warranted. The AI model identifies similarities and differences between a new claim and past claims to flag potential issues. If the new claim has similar characteristics to ones with issues, it generates an alert notification to the user.

4. Intellectual Property Portfolio Analysis Platform with Similarity Identification and Technical Aspect Clustering

MOAT METRICS INC, 2025

A platform for analyzing intellectual property portfolios of entities by identifying similarities between portfolios and clustering IP assets based on technical aspects. The platform allows users to seed searches based on technical fields, competitor portfolios, etc. to find IP assets similar to their own. It then clusters the assets at varying levels of granularity and generates visual representations of the clusters. This helps users efficiently analyze and compare portfolios, identify gaps and saturation, and assess exposure.

5. Document Search and Analysis System with Search Engine-Based Indexing and Complex Query Interface

PALANTIR TECHNOLOGIES INC, 2025

Searching and analyzing extremely large numbers of documents efficiently, with tools for complex query building, visualization, and publishing results. The system uses a search engine to index all fields of the documents instead of a database for faster searching. The system organizes documents into collections based on format, and allows querying across collections. The interface allows building complex queries, viewing results, flagging, and directly accessing documents. It also generates visualizations and lets sharing/publishing results. This scales for millions of documents by using a search engine instead of a database.

US12271432B2-patent-drawing

6. System for Automated Patent Claim Analysis Using Stemming and Normalization Techniques

MOAT METRICS INC, 2025

Automated analysis of patent claims to help evaluate relative breadth, identify corresponding products, and find related patents. The system analyzes claims using techniques like stemming and normalization to extract features like unique word counts. It generates claim profiles based on these features and compares them to determine relative breadth. It also searches for products and related patents based on identified elements in the claims.

US12271691B2-patent-drawing

7. Document Comparison System with Grouping and Shared Difference Highlighting Mechanism

EVERLAW INC, 2025

Efficiently comparing and viewing differences in large sets of documents to speed up document review processes. The method involves identifying shared text with variations across multiple documents, sorting documents into groups based on those variations, and generating a single "shared difference" document that highlights areas of variation between sections of shared text. This allows quickly comparing and navigating through many documents at once instead of reading them one by one.

8. Information Retrieval System Utilizing Voronoi Cell-Based Vector Embedding Indices for Efficient Query Processing

Intuit, Inc., 2025

Large language model (LLM)-based information retrieval for large datasets using indices to improve query response times and scalability. The method involves creating an index of the input text files containing vector embeddings of the text in voronoi cells. When a query comes in, the query embedding is compared to the vectors in the voronoi cell with the closest match to generate a response without needing to search the full text. This allows using a subset of embeddings for querying instead of the entire text. The indices can also be merged and partitioned to further reduce the search space.

US20250086215A1-patent-drawing

9. Overlay Graph-Based Method for Cross-Ontology Knowledge Graph Search

INTERNATIONAL BUSINESS MACHINES CORPORATION, 2025

Searching across multiple ontologic knowledge graphs using an overlay graph to improve efficiency and accuracy. The method involves generating overlay graphs that map entities and relations from multiple source graphs. When a search request comes in, an appropriate overlay graph is selected based on the entity and relation. The search is then executed on the overlay graph, which translates the request into queries for the source graphs. Results are received from the sources and used to respond to the search.

10. Dynamic Search Space Partitioning with Asynchronous Secondary Query Execution

PRODIGO SOLUTIONS INC, 2025

Dynamic indexing and searching technique to improve search efficiency and reduce search times. The search space is split into a primary subset and a secondary subset. When a query is received, only the primary subset is initially searched. If the results are insufficient, a supplemental search is performed on the secondary subset using the same query. This asynchronous secondary search occurs after the primary search and presents additional results. Items from the secondary search can also be moved to the primary subset for future queries. This reduces search times by prioritizing the most relevant subset for initial searches.

US12242553B1-patent-drawing

11. Patent Document Retrieval Method Utilizing Machine Learning for Claim Element Parsing and Synonym Identification

Dizpersion Corporation, 2024

Method for searching for relevant patent documents using machine learning and AI techniques to improve the effectiveness and efficiency of patent searching. The method involves parsing claim elements, selecting keywords, identifying synonyms, forming search strings, ranking documents, determining citations, and mapping elements. This allows targeted searching of databases using user-defined elements instead of keywords, improving recall and reducing false positives compared to keyword-based searching.

12. Patent Document Retrieval System Utilizing Metadata and Semantic Conversion with Multi-Method Filtering

BEIJING KINGSOFT CLOUD NETWORK TECH CO LTD, BEIJING KINGSOFT CLOUD NETWORK TECHNOLOGY CO LTD, 2024

Patent document retrieval method that uses metadata and semantic conversion to improve efficiency and accuracy compared to keyword search. The method involves selecting a retrieval method: 1) similarity search using metadata fields like invention title, patent type, etc., 2) keyword search in metadata, or 3) semantic search using a summary field. For method 1, similarity to metadata fields filters doc IDs. For method 2, keywords filter doc IDs from metadata. For method 3, semantic similarity to summary field filters top 5 doc IDs.

CN118035381A-patent-drawing

13. Patent Management System with Claim Scope Determination and Prior Art Analysis Using Mapping, Mining, and Analytics Techniques

Black Hills IP Holdings, LLC, 2024

Patent management system that provides tools to help in decision making at each stage of the patenting process. The system allows quick claim scope determination, prior art analysis, portfolio management, and other tasks. It uses mapping, mining, and analytics techniques to organize, search, and visualize patent concepts. The system also provides features like expanded search results, claim similarity indexing, and highlighting key terms across claims. It aims to enable efficient patent research, comparison, and analysis.

14. Iterative Patent Search Method Using User-Guided Classification and Keyword Refinement

KKLAB TECH PTE LTD, KKLAB TECHNOLOGIES PTE LTD, 2023

Assisting patent retrieval using user selection instructions to iteratively refine and expand search criteria. The method involves selecting a patent document, extracting classification data and keywords, generating new search conditions based on the selected patent's classification and keywords, then searching for more documents matching those conditions. This iterative refinement allows refining and expanding the search beyond the initial search criteria.

TWI824370B-patent-drawing

15. Hybrid AI System for Patent Claims Analysis with Machine Learning-Driven Embedding and User-Guided Search Mechanisms

DAYSTROM INFORMATION SYSTEMS, LLC, 2023

A hybrid AI system for patent claims analysis that combines machine learning and user input to accurately search and analyze patent documents. The system allows users to initiate searches based on reference documents, narrow the search focus, and select sections. It uses ML to transform the document and claims into embeddings representing their meaning. Element-by-element searches find matches based on these embeddings. Confidence scores rank the results. The system provides feedback to improve future searches.

16. System for Semi-Automatic Patent Claims Analysis Using Preconditioning and Claim Construction Rules with AI-Based Ranking

Daystrom Information Systems, LLC, 2023

Semi-automatic patent claims analysis that improves the speed and accuracy of a computer or server when performing a patent search, particularly for infringement analysis. The analysis involves using preconditioning rules to determine relevant portions of a reference document, a query is submitted to find a set of patents that are similar to the reference document, a set of matching patents from the query are received and claim construction rules are used to determine how a meaning of claim elements of the patents will be ascertained in further analysis, Patent infringement rules and an artificial intelligence (AI) system are used to search the relevant portions of the reference document with the claim constructed claim elements of the patents returned from the search, the set of patents are ranked based on assigned confidence scores indicating a degree to which respective claim elements match the relevant portions of the reference document, and the results are presented to a client device.

US11699034B2-patent-drawing

17. Iterative Patent Search Method Using Classification Code and Tag-Based Criteria Extraction

KKLAB TECHNOLOGIES PTE. LTD., 2023

A method for assisting users in searching patents. The method involves enabling users to select and search within patent documents based on key criteria like classification codes and related tags. The system retrieves patent documents matching the initial search criteria. Users can then select one or more patents of interest and extract additional criteria like classification codes from them. The system generates a refined search using the extracted criteria to find more relevant patents. This iterative process allows users to navigate and refine patent searches using criteria specific to patents.

US20230214399A1-patent-drawing

18. Iterative Patent Search System with Keyword Extraction and Criteria Refinement

KKLAB TECHNOLOGIES PTE. LTD., 2023

Patent search system that helps users find relevant patents by assisting with search criteria selection. The system receives an initial search criteria, then when a user selects a patent, it extracts keywords from that patent. The system generates a refined search with those keywords. This iterative process of selecting patents and extracting keywords allows focusing the search.

US2023124176A1-patent-drawing

19. Method for Generating Search Strings from Content Analysis of Seed Documents

AON RISK SERVICES, INC. OF MARYLAND, 2022

Generating search strings from seed documents or collection of seed documents. The search strings are generated based on the content of the seed documents, the number of claims analyzed, the number of associated documents, and the number of search strings generated from the search strings.

US20220180059A1-patent-drawing

20. System for Automatic Generation of Patent Application Templates via Prior Art Parsing and Sectional Filtering

Dennis J M Donahue, III, 2022

A system to automatically create patent application templates based on prior art references to reduce the time and expertise needed to draft patent applications. The system parses prior art documents to identify sections related to the invention. It then generates a template patent application by removing claims and sections from the prior art that are not relevant to the invention. The template can be edited by the drafter to insert the novel features of the invention.

21. Patent Search and Analysis Platform Integrating AI, Machine Learning, and Blockchain with Natural Language Processing

22. User Interface for Filtering and Analyzing Patent Documents with Specific Drawing Search Capability

23. Patent Document Screening Method Using Concept Mapping and Automated Triage

24. Patent Similarity Search System Utilizing Claim Tree Diagrams and Word Set-Based Search Formulas

25. Patent Search System with Data-Driven Key Patent Identification Mechanism

The prior art-finding process can be greatly improved by combining these developments with human skills and efficient search techniques. Inventors and patent experts can more successfully navigate the patenting process and improve their chances of getting a patent for their ideas by using these resources.

Get Full Report

Access our comprehensive collection of patents related to this technology