path constraint 0.0011879619999999999
same rule 0.001181616
input word 0.001165896
general constraint 0.001112503
category feature 0.001103994
parsing algorithm 0.001005443
feature owner 0.00100163
mon features 9.77831E-4
extraction function 9.66728E-4
relevant features 9.625910000000001E-4
features par 9.572690000000001E-4
detection function 9.55431E-4
tion function 9.52713E-4
identity function 9.45499E-4
different grammars 9.33117E-4
enough features 9.31843E-4
constant constraint 9.2292E-4
general method 8.98231E-4
other grammars 8.720189999999999E-4
tion model 8.69571E-4
first application 8.51033E-4
following process 8.338449999999999E-4
rule application 8.330099999999999E-4
processing time 8.29431E-4
other approaches 8.05293E-4
propagation path 8.02334E-4
top node 8.00812E-4
broad grammar 7.94429E-4
rule applications 7.93372E-4
unification grammars 7.896520000000001E-4
following cases 7.883499999999999E-4
general con 7.78458E-4
path concatenation 7.75972E-4
ful rule 7.729569999999999E-4
rule dag 7.59281E-4
funct ion 7.590419999999999E-4
iscuss ion 7.56471E-4
feature 7.55916E-4
propagat ion 7.556619999999999E-4
case analysis 7.53433E-4
notat ion 7.52066E-4
detect ion 7.52066E-4
rule dad 7.44103E-4
agation path 7.43435E-4
possible loop 7.28525E-4
formal power 7.24024E-4
following fragment 7.18653E-4
features 7.12625E-4
future work 7.08531E-4
function 7.07884E-4
head sem 6.95006E-4
new vari 6.92758E-4
general dag 6.89484E-4
method let 6.82916E-4
possible situations 6.81711E-4
unification equations 6.71385E-4
constraint 6.63814E-4
minimum set 6.62024E-4
exhaustive case 6.55473E-4
strictor set 6.51834E-4
unification equation 6.48038E-4
teachability table 6.41113E-4
nontermination problem 6.4085E-4
parse efficiency 6.39639E-4
efficient performance 6.33577E-4
reachablity table 6.27706E-4
current definition 6.26637E-4
model 6.24742E-4
predicative power 6.11221E-4
npo head 6.10862E-4
ypo head 6.10862E-4
similar solution 6.1046E-4
finite number 6.095320000000001E-4
second application 6.08575E-4
cal analysis 6.04009E-4
side category 6.03126E-4
above example 6.01855E-4
algorithm 5.97699E-4
initial application 5.97336E-4
preliminary analysis 5.88494E-4
propagation paths 5.803679999999999E-4
recursive applications 5.71145E-4
link sys 5.63811E-4
process tops 5.63521E-4
incompatible con 5.633120000000001E-4
efficient perfor 5.59312E-4
constraints 5.5916E-4
sem owner 5.534299999999999E-4
above approaches 5.49585E-4
teachability relation 5.49379E-4
equality relation 5.41218E-4
grammar 5.3826E-4
aeyclie graphs 5.37577E-4
cyclic propagation 5.37169E-4
subsumption relation 5.37062E-4
obvious difficulty 5.34936E-4
leaf terms 5.306250000000001E-4
approach 5.28267E-4
owner arc 5.22631E-4
infinite loop 5.22009E-4
