pith. sign in

arxiv: 2012.13919 · v1 · pith:IKF7GM2Tnew · submitted 2020-12-27 · 💻 cs.IR · cs.DL

PatentMatch: A Dataset for Matching Patent Claims & Prior Art

classification 💻 cs.IR cs.DL
keywords patentpatentmatchclaimsdatasetinformationpriortasktext
0
0 comments X
read the original abstract

Patent examiners need to solve a complex information retrieval task when they assess the novelty and inventive step of claims made in a patent application. Given a claim, they search for prior art, which comprises all relevant publicly available information. This time-consuming task requires a deep understanding of the respective technical domain and the patent-domain-specific language. For these reasons, we address the computer-assisted search for prior art by creating a training dataset for supervised machine learning called PatentMatch. It contains pairs of claims from patent applications and semantically corresponding text passages of different degrees from cited patent documents. Each pair has been labeled by technically-skilled patent examiners from the European Patent Office. Accordingly, the label indicates the degree of semantic correspondence (matching), i.e., whether the text passage is prejudicial to the novelty of the claimed invention or not. Preliminary experiments using a baseline system show that PatentMatch can indeed be used for training a binary text pair classifier on this challenging information retrieval task. The dataset is available online: https://hpi.de/naumann/s/patentmatch.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Formally Verified Patent Analysis via Dependent Type Theory: Machine-Checkable Certificates from a Hybrid AI + Lean 4 Pipeline

    cs.AI 2026-04 unverdicted novelty 8.0 partial

    A Lean 4 system models patent claims as DAGs with match scores in a verified complete lattice and supplies kernel-checked certificates for coverage calculations and five IP use cases, conditional on unverified ML inputs.

  2. Citation-Driven Multi-View Training for Patent Embeddings: QaECTER and Sophia-Bench

    cs.IR 2026-04 unverdicted novelty 7.0

    QaECTER sets new state-of-the-art patent retrieval performance on the new Sophia-Bench benchmark and an external test, outperforming a 23x larger general model and all prior patent-specific models using citation-drive...