W09-3807 data-driven parser utilized here has linear parsing time . These results are only
N09-1073 to actually result in roughly linear parsing time , not quadratic . Finally
J14-2001 the span ) . In order to obtain linear parsing complexity , all preconditions
J14-2001 is a PDG . In order to obtain linear parsing complexity , we must also be
W98-0508 theoretically that deterministic , linear parsing of dependency structures is possible
P05-1012 and Roark ( 2004 ) presented a linear parsing model trained with an averaged
N09-1073 complexity in fact yields observed linear parsing time , suggesting that tighter
Q13-1026 grammars yields approximately linear parsing time in the input length ( see
W98-0508 appropriately . A possibility for linear parsing has been proved theoretically
N09-1073 pursue this method by the observed linear parsing time achieved with the quadratic
P88-1013 computational linguistics do not permit linear parsing except for highly artificial
N09-1073 constraints in this way . The observed linear parsing time in Figure 3 with the quadratic
C88-1056 levels of sentence hierarchies . Linear parsing time ensues for unambiguous well-formed
Q13-1026 grammars to achieve approximately linear parsing time , introduced a rescaling
J14-2002 input sentence , which guarantees linear parsing complexity for greedy ( and beam
P05-1012 dependency parsers . We use simple linear parsing models trained with margin-sensitive
N03-1028 the application side , ( log - ) linear parsing models have the potential to
J13-4002 divisible transition systems that give linear parsing complexity when combined with
N04-1013 non-context-free grammar , and linear parsing time is possible for sentences
hide detail