Perplexity公司推出免費AI工具Perplexity Patents，旨在簡化專利搜索流程。該工具通過整合多個專利平臺數據，幫助用戶快速獲取專利信息，解決傳統搜索繁瑣耗時的問題。目前處於測試階段，對所有用戶開放使用。
nategro
基於PatentSBERTa的專利矛盾句識別模型，能夠將句子和段落映射到768維稠密向量空間，適用於聚類或語義搜索等任務。
基於PatentSBERTa的專利問題與解決方案句子識別模型，可將句子和段落映射到768維稠密向量空間，適用於聚類或語義搜索等任務。
基於PatentSBERTa的專利矛盾句識別模型，可將句子和段落映射到768維稠密向量空間，適用於聚類或語義搜索等任務。
AAUBS
基於深度NLP的混合模型，使用增強SBERT實現專利距離計算與分類
AI-Growth-Lab
基於深度NLP的混合模型，採用增強型SBERT實現專利距離計算與分類
提供Google Patents搜索功能的MCP服務器
PatentSafe MCP是一個用於連接PatentSafe並檢索文檔的MCP服務器，支持通過Lucene查詢訪問數據庫，適用於Claude等MCP客戶端。
%20--%3e%3cdefs%3e%3cstyle%3e%20.st0%20{%20fill:%20%23061b40;%20}%20.st1%20{%20fill:%20%23306af1;%20}%20.st2%20{%20fill:%20%235ce5cf;%20}%20%3c/style%3e%3c/defs%3e%3cg%3e%3cpath%20class='st0'%20d='M55,10.5h9v3h-9v9h12V7.5h-12v3ZM64,19.5h-6v-3h6v3Z'/%3e%3cpolygon%20class='st0'%20points='69%2016.5%2078%2016.5%2078%2019.5%2069%2019.5%2069%2022.5%2081%2022.5%2081%2013.5%2072%2013.5%2072%2010.5%2081%2010.5%2081%207.5%2069%207.5%2069%2016.5'/%3e%3cpolygon%20class='st0'%20points='95%2010.5%2095%207.5%2083%207.5%2083%2022.5%2095%2022.5%2095%2019.5%2086%2019.5%2086%2016.5%2095%2016.5%2095%2013.5%2086%2013.5%2086%2010.5%2095%2010.5'/%3e%3cpath%20class='st0'%20d='M40,1.5v21h11.6l1.4-1.4v-7.6h0c0,0-1.4-1.5-1.4-1.5l1.4-1.4V2.9l-1.4-1.4h-11.6ZM50,19.5h-7v-6h7v6ZM50,10.5h-7v-6h7v6Z'/%3e%3c/g%3e%3cpath%20class='st1'%20d='M23.1,24L14.7,4.8l-4.9,11.2h3.8l-1.8,4H3.3L12.1,0H2C.9,0,0,.9,0,2v20c0,1.1.9,2,2,2h21.1Z'/%3e%3cpath%20class='st2'%20d='M34,0h-16.8l10.6,24h6.2c1.1,0,2-.9,2-2V2C36,.9,35.1,0,34,0ZM32.5,20h-4V4h4v16Z'/%3e%3c/svg%3e)
