11. The computer readable non-transitory medium of claim 9 wherein said process for setting an initial UP uses computing resources insertion costs, deletion costs, and sentence boundary costs, and includes a process for setting an upper bound for the overall cost of the expected best solution using a greedy minimum set covering algorithm.
9. A computer readable non-transitory medium having computer readable program code embodied therein for processing an optimization method for instance based sentence boundary determination, the computer readable program code comprising: process for setting an initial upper bound (UB) of a cost associated with an optimized solution to the lowest cost derived by several greedy algorithms; process for identifying all corpus instances stored in electronic database that contain one or more of a plurality of desired propositions; forming a search tree structure with branches for each of plurality of identified corpus instances that contain one or more of said plurality of desired propositions; process for deleting one or more of a plurality of undesired propositions from said identified corpus instances; process for updating the overall cost with one or more deletion cost; process for inserting one or more of said plurality of desired propositions that were not contained in said corpus instance into said corpus instance; process for updating the overall cost with one or more insertion cost; process for calculating the lower bound (LB) of the cost associated with the current solution (or partial solution); process for pruning the current search branch if the LB is greater than the established UB; process for recursively computing the best solution associated with generating one or more additional sentences to convey the rest of said plurality of desired propositions that were not contained in said corpus instance; updating the overall cost with a boundary cost plus the cost associated with the best solution found by the recursive procedure; process for updating UB if the current overall cost is lower than UB; process for outputting a solution that has the lowest overall cost using a set of said identified corpus instances with a set of said deletion, insertion and sentence break operations.