Comparing Complex Concepts with Transformers: Matching Patent Claims Against Natural Language Text

Matthias Blume, Ghobad Heidari, Christoph Hewel
7/14/2024
cs.CL

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

A key capability in managing patent applications or a patent portfolio is comparing claims to other text, e.g. a patent specification. Because the language of claims is different from language used elsewhere in the patent application or in non-patent text, this has been challenging for computer based natural language processing. We test two new LLM-based approaches and find that both provide substantially better performance than previously published values. The ability to match dense information from one domain against much more distributed information expressed in a different vocabulary may also be useful beyond the intellectual property space.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{blume2024comparing,
  title  = {Comparing Complex Concepts with Transformers: Matching Patent Claims Against Natural Language Text},
  author = {Matthias Blume and Ghobad Heidari and Christoph Hewel},
  year   = {2024},
  eprint = {2407.10351},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.10351v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.10351.svg)](https://codeofpaper.com/paper/2407.10351)

Discussion