Analytics in Post-Grant Patent Review: Possibilities and Challenges (Preliminary Report)

Recent analysis of litigation outcomes suggests that nearly half of the patents litigated to judgment were held invalid. Commonly available patent search software is predominantly keyword based and takes a “one-size-fits-all” approach leaving much to be desired from a practitioner’s perspective. We discuss opportunities for using text mining and information retrieval in the domain of patent litigation. We focus on post-grant inter partes review process, where a company can challenge the validity of an issued patent in order, for example, to protect its product from being viewed as infringing on the patent in question. We discuss both possibilities and obstacles to assistance with such a challenge using a text analytic solution. A range of issues need to be overcome for semantic search and analytic solutions to be of value, ranging from text normalization, support for semantic and faceted search, to predictive analytics. In this context, we evaluate our novel and top performing semantic search solution. For experiments, we use data from the database USPTO Final Decisions of the Patent Trial and Appeal Board. Our experiments and analysis point to limitations of generic semantic search and text analysis tools. We conclude by presenting some research ideas that might help overcome these deficiencies, such as interactive, semantic search, support for a multistage approach that distinguishes between a divergent and convergent mode of operation and textual entailment.

[1]  Ido Dagan,et al.  Recognizing Textual Entailment: Models and Applications , 2013, Recognizing Textual Entailment: Models and Applications.

[2]  Wlodek Zadrozny,et al.  Measuring Semantic Relatedness using Mined Semantic Analysis , 2015, ArXiv.

[3]  Christoph Mangold,et al.  A survey and classification of semantic search approaches , 2007, Int. J. Metadata Semant. Ontologies.

[4]  Christian Helmers,et al.  Inter Partes Review and the Design of Post-Grant Patent Reviews , 2015 .

[5]  Mark A. Lemley,et al.  Understanding the Realities of Modern Patent Litigation , 2014 .

[6]  Joakim Nivre,et al.  Characterizing the Errors of Data-Driven Dependency Parsing Models , 2007, EMNLP.

[7]  Michael Schroeder,et al.  Developing Semantic Search for the Patent Domain , 2014, IPaMin@KONVENS.

[8]  Wlodek Zadrozny,et al.  A Visual Semantic Framework for Innovation Analytics , 2016, AAAI.

[9]  Wlodek Zadrozny,et al.  Innovation Analytics Using Mined Semantic Analysis , 2016, FLAIRS Conference.

[10]  Danqi Chen,et al.  A Fast and Accurate Dependency Parser using Neural Networks , 2014, EMNLP.

[11]  Benoît Sagot,et al.  Efficient and Robust LFG Parsing: SxLFG , 2005, IWPT.

[12]  Joel R. Tetreault,et al.  It Depends: Dependency Parser Comparison Using A Web-based Evaluation Tool , 2015, ACL.

[13]  E. Dura Natural Language in Information Retrieval , 2003, CICLing.

[14]  Siddharth Patwardhan,et al.  WatsonPaths: Scenario-Based Question Answering and Inference over Unstructured Information , 2017, AI Mag..

[15]  David L. Schwartz The Rise of Contingent Fee Representation in Patent Litigation , 2012 .

[16]  Carol Collier Kuhlthau,et al.  Information search process of lawyers: a call for 'just for me' information services , 2001, J. Documentation.

[17]  Jaap Kamps,et al.  From multistage information-seeking models to multistage search systems , 2014, IIiX.