As far as time complexity is concerned, the graph-partitioning models discussed above are quadratic with regards to N , i.e., O(M N 2 ), where M ≪ N ; M and N denoting the number of bullets and utterances, respectively, with the loop kernel computing and filling D[i, j, k] in equation 3, which is a M × N × N matrix.
the cohesion conveyed by the repetition of the words that appear in transcripts but not in slides could be additionally helpful; this is very likely to happen considering the significant imbalance of text lengths between bullets and transcripts, from which the alignment models by themselves may suffer.