4 A caveat is that the worst-case time complexity of arc-swift is O(n 2 ) instead of O(n), which existing transition-based parsers enjoy.
in practice the runtime is nearly 4 This is easy to show because in arc-eager, all Reduce transitions can be viewed as preparing for a later LArc or RArc transition.