Patent Document ID: 10089585
Application ID: 15203841

Base Claim:
1. A non-transitory computer readable medium including code that is executed by a computer system comprising one or more processors, a main memory, a secondary storage, a communications bus, one or more input or output devices, and a network interface to perform a method of managing relevance of a plurality of project description (PD) documents with respect to a plurality of request for proposal (RFP) documents, said plurality of PD documents stored in a data store, the method comprising: receiving using at least one of said input devices, said communications bus, or said network interface an RFP document; creating using said one or more processors an RFP-document decomposition by decomposing said RFP document into RFP segments; establishing using said one or more processors hierarchical relationships for said RFP-document decomposition comprising contains-as-a-segment relationships, is-a-segment-of relationships, or both said relationships between said RFP document and said RFP segments; determining using said one or more processors a PD-document-to-RFP-segment relevance for a PD document from said plurality of PD documents and said RFP segments using document similarity processing and a metric, wherein said determining said PD-document-to-RFP-segment relevance comprises creating a relevance matrix R 1 of dimensions 1 by M, where M is a number of said RFP segments, and populating each element R 1 [1, m] of said relevance matrix R 1 with a relevance value produced by said document similarity processing and said metric that represents a similarity of said PD document to a corresponding RFP segment m of said RFP segments; aggregating using said one or more processors said PD-document-to-RFP-segment relevance by said hierarchical relationships for said RFP-document decomposition to produce a PD-to-RFP relevance, wherein said aggregating comprises performing a summation by said dimension M of said element R 1 [1, m] relevance values of said relevance matrix R 1 ; and transmitting using at least one of said output devices, said communications bus, or said network interface said PD-to-RFP relevance, said PD-document-to-RFP-segment relevance, or both said relevances to an originator of said RFP document.

---

Claim 7:
7. The computer readable medium of claim 1 , wherein determining the PD-document-to-RFP-segment relevance further comprises: determining using said one or more processors said PD-document-to-RFP-segment relevance for said PD document and said RFP segments of said RFP-document decomposition using a template-based transitive match processing, said relevance matrix R 1 , said document similarity processing, and said metric, wherein said template-based transitive match processing comprises: receiving using at least one of said input devices, said communications bus, or said network interface a standard template (ST) document; creating using said one or more processors an ST-document decomposition by decomposing said ST document into ST segments, where a number of ST segments is S; determining using said one or more processors a PD-document-to-ST-segment relevance for a said PD document and an ST segment of said ST-document decomposition using said document similarity processing and said metric, wherein said determining said PD-document-to-ST-segment relevance comprises creating a relevance matrix R PS of dimensions 1 by S, and populating each element R PS [1, s] of said relevance matrix R PS with a relevance value produced by said document similarity processing and said metric that represents a similarity of said PD document and said ST segment s of said ST segments; determining using said one or more processors an RFP-segment-to-ST-segment relevance for an RFP segment of said RFP-document decomposition and an ST segment of said ST-document decomposition using said document similarity processing and said metric, wherein said determining said RFP-segment-to-ST-segment relevance comprises creating a relevance matrix R RS of dimensions M by S, where M is the number of said RFP segments in said RFP-document decomposition, and populating each element R RS [m, s] of said relevance matrix R RS with a relevance value produced by said document similarity processing and said metric that represents a similarity of an RFP segment m of said RFP segments and said ST segment s of said ST segments; and determining using said one or more processors the relevance of said PD document to said RFP segment as said matrix R 1 having said dimensions 1 by M by a matrix-product type traversal of said matrix R PS by a transpose R RS T of said matrix R RS , wherein an operation performed for said matrix-product type traversal to produce said element R 1 [1, m] that takes as inputs an element R PS [1, s] of said R PS and an element R RS T [s, m] of said R RS T comprises one or more of the following operations: a minimum of said element of R PS [1, s] and said element of R RS T [s, m], or a product of said element R PS [1, s] and said element R RS T [s, m].