首页> 外文会议>World Multi-Confernece on Systemics, Cybernetics and Informatics >Combinatorial Document Matching: A Patent Case Study
【24h】

Combinatorial Document Matching: A Patent Case Study

机译:组合文件匹配:专利案例研究

获取原文

摘要

We address a challenge in knowledge management and document processing that involves matching similar documents, especially when the matching is semantically one-to-many. Specifically, we propose a linguistic solution that automatically discovers a set of documents, which only in combination match a target document. We apply the solution to patents, and in particular address the problem of detecting obviousness in patents. Detection of patent obviousness is generally a hard problem, since it involves finding a combination of relevant patents that, combined together, subsume the claims of a new patent application. Our approach, based on combinatorial document matching, yields good results when applied to semantic analysis of the first independent claim of patents, therefore promising to save time and resources in patent prosecution, examination, and the discovery phase in patent litigation. Further, this approach lays a foundation for the broader problem of combinatorial document matching.
机译:我们在知识管理和文档处理中解决了涉及匹配类似文件的文件处理的挑战,尤其是当匹配是语义上的一对一时。具体而言,我们提出了一种语言解决方案,它自动发现一组文档,只有在组合匹配目标文档中。我们将该解决方案应用于专利,特别是解决了专利中检测到显而易见的问题。专利明显的检测通常是一个难以解决的问题,因为它涉及找到相关专利的组合,结合在一起,分组新的专利申请的权利要求。我们的方法基于组合文件匹配,在应用于对第一个独立专利的语义分析时产生了良好的结果,因此有希望节省专利诉讼中专利起诉,检查和发现阶段的时间和资源。此外,这种方法为组合文件匹配的更广泛问题奠定了基础。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号