2. The computer-implemented method of claim 1 , wherein identifying one or more segments in the first sequence, comprises: evaluating the subsequences in the first sequence using a sliding window of length (L), wherein an internal entropy expert and a boundary entropy expert each vote a position in each sliding window subsequence at which to split the sliding window sequence; and inducing a segment boundary at each position in the first sequence that receives at least a number of votes satisfying a vote count threshold (V).
2. The computer-implemented method of claim 1 , wherein identifying one or more segments in the first sequence, comprises: evaluating the subsequences in the first sequence using a sliding window of length (L), wherein an internal entropy expert and a boundary entropy expert each vote a position in each sliding window subsequence at which to split the sliding window sequence; and inducing a segment boundary at each position in the first sequence that receives at least a number of votes satisfying a vote count threshold (V). 3. The computer-implemented method of claim 2 , wherein: the internal entropy expert votes to minimize internal entropy by selecting a position which minimizes internal entropy in each respective sliding window sequence, based on the determined entropies; and the boundary entropy expert votes by selecting a position in each respective sliding window that maximizes entropy between segments in the sliding window subsequence.