dominance graph 0.002461584
dominance constraints 0.002333753
dominance edges 0.0021967130000000003
dominance edge 0.002125518
dominance graphs 0.0021034170000000002
normal dominance 0.002089014
tree edges 0.001925803
tree fragments 0.00188941
constraint graph 0.0018410739999999998
internal dominance 0.00183868
hole semantics 0.0017755660000000001
such grammars 0.001678743
mrs constraint 0.00159853
tree frag 0.001591024
recursion semantics 0.001536358
semantic output 0.0015358680000000001
dominance 0.00152862
semantic representations 0.00150748
toy problem 0.00146679
grammar development 0.001465895
other fragments 0.00146124
resource grammar 0.001460522
interesting graph 0.0014487340000000001
such inferences 0.001420859
such gram 0.0014012739999999999
lkb grammar 0.001399574
constraint solver 0.001396923
semantic representa 0.001395949
grammar design 0.0013818559999999999
grammar debugging 0.001377541
xtag grammar 0.001373418
graph algorithms 0.00135658
small constraints 0.00132106
possible readings 0.001307959
scope readings 0.001288556
efficient algorithm 0.001252863
graph format 0.001248914
graph represen 0.001244191
linear time 0.001223599
different underspecification 0.001205408
scope underspecification 0.001182346
semantics 0.00115102
different resources 0.001131136
same size 0.001130168
data set 0.001120758
individual scope 0.001102542
problem 0.00110183
entire runtime 0.001099404
possible read 0.0010942
first phase 0.001076715
mrs nets 0.001075411
scope read 0.001074797
average runtime 0.001058619
runtime comparison 0.001055103
following operations 0.001052203
many readings 0.001052014
inance edges 0.001050773
grammar 0.00104982
underspecified description 0.001047582
different underspecifi 0.001041108
different sizes 0.001039157
different underspecifica 0.001038778
only system 0.0010343449999999999
development system 0.0010340100000000001
different formats 0.001033359
chart data 0.0010253559999999998
gram grammars 0.001023677
free fragments 0.001023398
scope underspecifi 0.0010180459999999999
scope underspecifica 0.001015716
scope ambiguities 0.0010156129999999998
same sub 0.001013633
main formalisms 0.0010078560000000001
nance graphs 0.001005348
individual readings 9.94818E-4
efficient solver 9.9069E-4
second phase 9.89046E-4
directed graphs 9.68956E-4
exponential size 9.685399999999999E-4
lkb system 9.676890000000001E-4
underspecified descriptions 9.65716E-4
fragment sets 9.61003E-4
inance graphs 9.57477E-4
test set 9.537910000000001E-4
data structure 9.49968E-4
new chart 9.39118E-4
graph 9.32964E-4
convenient system 9.299740000000001E-4
constraint 9.0811E-4
connected subgraphs 9.07209E-4
test data 9.02219E-4
counts readings 9.02182E-4
underspecification formalisms 8.90486E-4
minimal recursion 8.84195E-4
practical use 8.781419999999999E-4
underspecified descrip 8.74712E-4
memory limitations 8.647010000000001E-4
general idea 8.61767E-4
median number 8.58768E-4
practical challenge 8.47759E-4
