1. A computer implemented method for determining a largest common series of statements from one or more sets of ordered statements comprising: compiling, in a first Elements Plain Text Table (EPTT), each statement from the one or more sets of ordered statements, wherein each statement comprises a portion of plain text computer program code; wherein each EPTT comprises a respective script identifier, a respective script direct reference, a respective step number, and a plain text corresponding to each respective statement; recording, in a first Plain Text Count Table (PTCT) and based on the first EPTT, a respective number of appearances of each respective statement; determining, based on the first PTCT, a statement having a largest number of appearances; compiling, in a second EPTT, each respective statement following the statement having a largest number of appearances, wherein each statement following the statement having a largest number of appearances comprises a first order sequential statement; wherein each respective first order sequential statement comprises a statement in the first EPTT having a respective step number sequential to and greater than a respective step number of the statement having a largest number of appearances; recording, in a second PTCT and based on the second EPTT, a respective number of appearances of each first order sequential statement; determining, based on the second PTCT, a first order sequential statement having a largest number of appearances following the statement having a largest number of appearances; and storing each appearance of the statement having a largest number of appearances and the first order sequential statement having a largest number of appearances in a Keywords Reference Links Table (KRLT) as the largest common series; wherein the KRLT comprises a respective potential keyword ID, a respective script, a respective keyword row number, and a respective script step number for each respective appearance.