derivation tree 0.0017495689999999999
elementary tree 0.001717574
tree structure 0.001713295
tree address 0.001561794
tree addresses 0.00154924
valid tree 0.001545567
initial tree 0.001544545
tree descriptions 0.001538193
tary tree 0.001486232
lementary tree 0.001480361
tree names 0.001477228
tree traversals 0.001476227
such grammars 0.001334004
derivation trees 0.001289473
trees automaton 0.001262411
elementary trees 0.001257478
parse trees 0.001250704
many trees 0.001229896
original grammar 0.001193501
several trees 0.001191139
root node 0.001175588
grammar structures 0.001149927
grammar formalism 0.001143426
grammar formalisms 0.00114246
first input 0.00113303
single node 0.001121578
grammar share 0.001117882
transitions trees 0.001109233
other approaches 0.001088768
first step 0.001087656
node label 0.001087154
other entries 0.001085685
valid trees 0.001085471
ltag trees 0.001079873
input language 0.001078687
parsing algorithm 0.001071873
standard algorithm 0.001056602
ing parse 0.001046705
merged trees 0.001045142
related trees 0.001036986
following automaton 0.001030015
foot node 0.001013495
anchor node 0.001002086
such search 9.89007E-4
possible parser 9.80786E-4
node labels 9.804079999999999E-4
same input 9.654399999999999E-4
common parser 9.5585E-4
ion phase 9.42978E-4
ing automata 9.42146E-4
such cases 9.418829999999999E-4
partial function 9.325329999999999E-4
ltag grammars 9.220420000000001E-4
different structures 9.196879999999999E-4
last rule 9.19345E-4
lexical item 9.14502E-4
iscuss ion 9.021560000000001E-4
recognit ion 8.95711E-4
parse table 8.92647E-4
recognition process 8.91001E-4
input string 8.89568E-4
different perspectives 8.889709999999999E-4
grammar 8.87317E-4
possible parsing 8.865209999999999E-4
first pass 8.86499E-4
state automaton 8.8572E-4
ing algorithms 8.790110000000001E-4
following transitions 8.768370000000001E-4
common structure 8.75755E-4
parsing time 8.74307E-4
input symbols 8.71265E-4
single automaton 8.67404E-4
xicalized grammars 8.61678E-4
input symbol 8.59849E-4
final derivation 8.552669999999999E-4
transition relation 8.54091E-4
possible way 8.51926E-4
step process 8.43907E-4
elementary computation 8.3888E-4
complete item 8.385280000000001E-4
ltag parser 8.383189999999999E-4
final input 8.34314E-4
parser control 8.31525E-4
final automaton 8.28205E-4
parser optimisation 8.280809999999999E-4
previous work 8.16572E-4
recover ing 8.14879E-4
combin ing 8.14879E-4
merg ing 8.14879E-4
next input 8.1416E-4
complete auxiliary 8.091940000000001E-4
root label 8.0442E-4
portant feature 8.03602E-4
next item 8.01037E-4
parser actions 8.004209999999999E-4
fixed parser 7.99035E-4
following sections 7.91942E-4
parser action 7.88902E-4
following assumup 7.881240000000001E-4
trees 7.87424E-4
