1. A computerized method for creating an acyclic directed keyword graph, the method comprising: electronically selecting a unique unused pair of terms from a keyword pool; calculating, by using a processor, a plurality of cross reference matrices for each of the terms in the selected pair of terms, the plurality of cross reference matrices including results from a web search of each term in the unique unused pair of terms; calculating, by using a processor, relevancy between the terms based on the plurality of cross reference matrices; electronically creating a node connection based on the relevancy between the terms; and repeating for another unique pair of terms until the acyclic directed keyword graph is of sufficient size.