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).
5. The computer-implemented method of claim 2 , wherein the vote count threshold (v) is determined as follows V = ⌈ ∑ i = 1 n ⁢ argmax ⁡ ( H ^ I ) i + argmax ⁡ ( H ^ B ) i 2 ⁢ n ⌉ , wherein Ĥ I and Ĥ B , represent a standardized entropy value for the entropy measure determined for each node in the ngram trie, wherein n represents a total number of branches in the ngram trie and argmax( ) returns a level of the node in the trie with the greatest entropy values for Ĥ I and Ĥ B .