tree adjunction 0.002621636
ing tree 0.002489211
auxiliary tree 0.002360817
elementary tree 0.002355194
complement tree 0.002178558
tree yield 0.002145413
tree substitution 0.002112424
tree adjoining 0.0020988969999999997
athematic tree 0.002061305
tag grammar 0.002037038
wrapping tree 0.002032493
ping tree 0.002021437
iliary tree 0.002013843
iary tree 0.0020125209999999998
auxiliary trees 0.001815287
elementary trees 0.0018096639999999999
derivation trees 0.0018057239999999999
language tag 0.001798793
right trees 0.001692618
left trees 0.0016432069999999998
complement trees 0.001633028
tag parsing 0.00162523
initial trees 0.001603546
input grammar 0.0015997820000000001
only trees 0.00155018
athematic trees 0.001515775
iary trees 0.001466991
trees fir 0.001463121
tag algorithm 0.0014065710000000001
grammar transformation 0.00137493
root node 0.0013474329999999999
foot node 0.001343169
tag recognition 0.001325415
form adjunction 0.001316185
leaf node 0.001310379
tag derivations 0.00126765
tag restriction 0.001261295
adjunction step 0.001251214
complement adjunction 0.001250954
distinct node 0.001234795
tag analyses 0.001231391
trees 0.00122909
tag pars 0.001223925
unrestricted tag 0.0011963850000000001
tag recog 0.001182773
tag recogni 0.00118146
adjunction restriction 0.001162013
natural language 0.001155417
adjunction site 0.001145644
adjunction sites 0.0011437650000000001
adjunction oper 0.0011164410000000001
wrapping adjunction 0.001104889
case time 0.001099366
ural language 0.001094051
grammar 0.00109074
strain adjunction 0.00108201
adjunction opera 0.00108201
plement adjunction 0.00108201
inference rule 0.0010544719999999999
parsing problem 0.001002731
complement auxiliary 9.90135E-4
above algorithm 9.78227E-4
lud ing 9.67487E-4
first step 9.643589999999999E-4
adjoining grammars 9.58304E-4
other languages 9.47499E-4
linguistic distinction 9.42722E-4
same yield 9.416170000000001E-4
input string 9.28153E-4
new set 9.12702E-4
time complexity 9.11942E-4
other hand 9.02213E-4
other arguments 8.88072E-4
other proposals 8.84506E-4
general case 8.76064E-4
athematic auxiliary 8.72882E-4
foot nodes 8.68985E-4
internal structure 8.686400000000001E-4
language 8.52495E-4
adjunction 8.47016E-4
spine nodes 8.454159999999999E-4
above restriction 8.329510000000001E-4
lexical projection 8.32518E-4
derivation struc 8.31005E-4
same span 8.23619E-4
generative power 8.202649999999999E-4
ment auxiliary 8.19844E-4
time cost 8.11497E-4
rary results 8.079350000000001E-4
input positions 8.03847E-4
possible extens 8.03576E-4
average case 8.00902E-4
syntactic processing 7.944250000000001E-4
syntactic constructions 7.93669E-4
way con 7.93002E-4
inference rules 7.90677E-4
frontier nodes 7.89089E-4
lexical category 7.85904E-4
form restriction 7.84166E-4
ciated set 7.84139E-4
