W07-2216 |
Kahane et al. ( 1998 ) provides a
|
polynomial parsing
|
algorithm for a constrained class
|
W09-3841 |
time . For non-linear RCGs , this
|
polynomial parsing
|
time can not be guaranteed anymore
|
P09-1112 |
- yses . In order to obtain a
|
polynomial parsing
|
al - gorithm , we need to avoid
|
P98-2130 |
distance dependencies , and a
|
polynomial parsing
|
algorithm . The formalism is
|
J91-3002 |
possesses the Mildly CS properties .
|
Polynomial Parsing
|
. Since parsing is dependent
|
D13-1034 |
context-free grammars that retains
|
polynomial parsing
|
time-complexity . Sec - ondly
|
C04-1026 |
fragments of XDG with provably
|
polynomial parsing
|
algorithms , and which contain
|
W15-3117 |
et al. , 1991 ) , which enjoys
|
polynomial parsing
|
. The word " par - allel " in
|
E09-2015 |
fully context-sensitive , with
|
polynomial parsing
|
complexity ( Ljungl ¨ of
|
N03-2011 |
because that would turn an otherwise
|
polynomial parsing
|
algorithm like chart parsing
|
P09-1112 |
specializations of the above techniques .
|
Polynomial parsing
|
results for tree rewriting systems
|
J91-3002 |
2 . constant growth , and 3 .
|
polynomial parsing
|
roughly characterize a class
|
J98-2003 |
algorithms and their complexity .
|
Polynomial parsing
|
algorithms were found for a few
|
J93-4002 |
of CCG , this provides the only
|
polynomial parsing
|
algorithm ( apart from a slight
|
W08-1701 |
Context Free Rewriting Systems and a
|
polynomial parsing
|
complexity ) and there exist
|
P97-1069 |
include : ( i ) an extension of the
|
polynomial parsing
|
algorithm of ( Vijay-Shanker
|
E97-1069 |
include : ( i ) an extension of the
|
polynomial parsing
|
algorithm of ( Vijay-Shanker
|
P83-1002 |
be generated by TAG 's . ( 3 )
|
Polynomial parsing
|
: TAL 's can be parsed in time
|
P12-1070 |
dencies , constant growth , and
|
polynomial parsing
|
. The first condition is only
|
J91-4006 |
better average-time performance . "
|
Polynomial parsing
|
of extensions of context-free
|