Efficient Constituency Parsing by Pointing
Table 3: Parsing speed for different models computed on the PTB WSJ test set.
['[BOLD] Model', '# sents/sec']
worse-case time complexity while the one used by shen-etal-2018-straight can theoretically run at O(nlogn) time complexity. To elaborate further, the algorithm presented in shen-etal-2018-straight can only run at O(n2) complexity. To achieve O(nlogn) Recursive algorithms tend to be less empirically efficient than their equivalent while/for loops in handling low-level memory allocations and function call stacks.