First, with a  greedy bottom-up strategy, we develop a discourse parser with a time complexity linear in the total number of sentences in the document.
for each sentence S k with m k EDUs, the overall time complexity to perform intra-sentential parsing is O(m 2 k ).