9. The method of claim 1 , wherein determining longest contiguous common subsequences comprises: aligning pairs of strings having possible contextual matches; normalizing the pairs of strings by extracting matching segments having a given length; and aggregating the normalized pairs of strings.
9. The method of claim 1 , wherein determining longest contiguous common subsequences comprises: aligning pairs of strings having possible contextual matches; normalizing the pairs of strings by extracting matching segments having a given length; and aggregating the normalized pairs of strings. 10. The method of claim 9 , further comprising applying a greedy contiguity heuristic to the aggregated normalized pairs of strings.