5. The method of claim 1 , wherein the step of generating the optimized list further includes performing the following steps in sequence until all elements have been sorted: a) computing, by the processor circuit, for each element of the elements list, an added singleton coverage increase so that the higher number of singleton the element contains, the higher the coverage increase, b) regardless of the elements score, placing, by the processor circuit, the element with the highest coverage at a bottom of a sorted list, c) repeating steps a) and b) until singleton coverage cannot be increased anymore, d) removing ordered elements from the elements list, and e) repeating step a) until the elements list is fully depleted.
5. The method of claim 1 , wherein the step of generating the optimized list further includes performing the following steps in sequence until all elements have been sorted: a) computing, by the processor circuit, for each element of the elements list, an added singleton coverage increase so that the higher number of singleton the element contains, the higher the coverage increase, b) regardless of the elements score, placing, by the processor circuit, the element with the highest coverage at a bottom of a sorted list, c) repeating steps a) and b) until singleton coverage cannot be increased anymore, d) removing ordered elements from the elements list, and e) repeating step a) until the elements list is fully depleted. 6. The method of claim 5 , wherein in the placing step, if several elements have the same coverage increase, the method includes placing the element with highest total popularity score at the bottom of the sorted list.