Longest common subsequence takes into account sentence level structure similarity naturally and identifies longest co-occurring insequence n-grams automatically.
we can find the LCS of two sequences of length m and n using standard dynamic programming technique in O(mn) time.