decomposition tree 0.001585854
elementary tree 0.0014290190000000001
iary tree 0.001365993
decomposition algorithm 0.001354869
same string 0.001344225
binarization algorithm 0.001261584
efficient algorithm 0.001214378
factorization algorithm 0.001185174
language parsing 0.00117049
parsing problem 0.001164806
new string 0.001161328
same edge 0.001152296
overall algorithm 0.00114789
recursive algorithm 0.001137033
plete algorithm 0.001136832
such edges 0.0011170070000000002
linear time 0.001046115
parsing algorithms 0.001045454
input string 0.001045248
normal form 0.001026379
new production 0.001018197
time complexity 0.00101747
grammar case 0.001014547
following property 0.001005443
natural language 0.001003255
grammar production 9.96803E-4
many parsing 9.958789999999999E-4
same quantities 9.914099999999999E-4
new productions 9.79188E-4
root node 9.71553E-4
tion problem 9.689990000000001E-4
other nonterminals 9.68995E-4
first condition 9.61953E-4
binary form 9.59214E-4
string tuple 9.49762E-4
possible rank 9.45869E-4
data structure 9.39311E-4
other end 9.36262E-4
such vertices 9.34874E-4
free grammars 9.314519999999999E-4
adjoining grammars 9.192759999999999E-4
form anbn 9.18402E-4
first component 9.137069999999999E-4
same convention 9.128529999999999E-4
other partition 9.128E-4
additional data 9.07305E-4
first level 9.05459E-4
empty string 9.04081E-4
algorithm 9.03335E-4
input production 9.02117E-4
factorization problem 8.99866E-4
parsing applications 8.918719999999999E-4
optimal way 8.902249999999999E-4
time improvement 8.889540000000001E-4
different nonterminals 8.88343E-4
polynomial time 8.87096E-4
first range 8.858620000000001E-4
incident set 8.736289999999999E-4
ral language 8.73201E-4
constant time 8.731E-4
similar way 8.67245E-4
optimal decomposition 8.64105E-4
new bundle 8.62916E-4
first part 8.617189999999999E-4
quadratic time 8.608380000000001E-4
input grammar 8.589520000000001E-4
known parsing 8.5841E-4
binarization algorithms 8.56924E-4
lcfrs case 8.54817E-4
following conditions 8.54747E-4
source production 8.53251E-4
nonterminal symbol 8.53013E-4
different decompositions 8.513279999999999E-4
complexity optimization 8.460589999999999E-4
ning time 8.41161E-4
important feature 8.410550000000001E-4
lcfrs production 8.37073E-4
programming algorithms 8.365969999999999E-4
exponential time 8.36398E-4
nonterminal symbols 8.341189999999999E-4
following claim 8.33456E-4
polynomial parsing 8.290139999999999E-4
tabular parsing 8.279279999999999E-4
linear regular 8.27609E-4
linear order 8.248699999999999E-4
free case 8.241450000000001E-4
maximum number 8.2093E-4
above function 8.20502E-4
first discrepancy 8.17417E-4
directed graph 8.13578E-4
optimal rank 8.112289999999999E-4
known algorithms 8.10306E-4
source grammar 8.10086E-4
production factorization 8.01823E-4
phrase structure 7.995599999999999E-4
new range 7.99014E-4
lcfrs productions 7.98064E-4
case gram 7.980330000000001E-4
undirected graph 7.84047E-4
possible existence 7.80834E-4
