dominance graph 0.0025097799999999997
dominance constraints 0.002120356
dominance edge 0.002010052
dominance edges 0.002001074
dominance graphs 0.001908539
normal dominance 0.001847386
outgoing dominance 0.001780949
dominance chart 0.0017574449999999998
tree edges 0.0017470939999999998
dominance con 0.001725833
dominance nets 0.001692518
elimination algorithm 0.0016605209999999999
hnc dominance 0.001635971
dominance charts 0.001627479
labelled dominance 0.001627183
puted dominance 0.0016219539999999999
fine dominance 0.001621076
efficient algorithm 0.0016178499999999999
complete algorithm 0.001602578
complete graph 0.0015749479999999998
entire graph 0.001572682
correct algorithm 0.00153755
outgoing tree 0.001526969
directed graph 0.0015106769999999998
inance graph 0.0015074519999999998
algorithm baseline 0.001501692
present algorithm 0.001488044
naive algorithm 0.001478751
hnc graph 0.0014579109999999999
original graph 0.001453582
whole graph 0.0014500329999999999
ample graph 0.0014434259999999998
other fragments 0.001411371
incoming tree 0.001390694
data set 0.001352654
semantic representations 0.001346594
other readings 0.001346123
dominance 0.00134392
semantic representation 0.001339528
first time 0.001317541
such formulas 0.00128333
first corpus 0.00128114
other elimination 0.0012761130000000002
equivalence problem 0.00127101
elimination problem 0.001248258
other split 0.0012361120000000001
other algorithms 0.0012312640000000001
other underspecification 0.00123106
such mrss 0.001225927
different fragments 0.0012178430000000001
such charts 0.001214105
semantic representa 0.00120924
semantic represen 0.001200777
algorithm 0.00119349
graph 0.00116586
configuration set 0.0011621280000000001
entire set 0.00115879
different configurations 0.0011411120000000001
full set 0.00111798
same hole 0.001112137
other hand 0.001106883
resource grammar 0.00110461
first redundancy 0.001099424
other equiv 0.001089013
classes figure 0.001086656
labelling function 0.00107795
following redundancy 0.001077343
large number 0.001074783
rule schemata 0.001071818
undecidable problem 0.001064159
ubiquitous problem 0.001064159
rule application 0.001053704
verted rule 0.001053704
mrs representations 0.001043173
second split 0.001031551
baseline figure 0.001028503
enumeration figure 0.001026583
polynomial time 0.001006824
underspecified redundancy 0.001004916
hpsg grammar 0.0010017519999999999
inance edges 9.98746E-4
recursion semantics 9.98607E-4
negligible time 9.912649999999999E-4
rondane corpus 9.839270000000001E-4
semantics construc 9.81833E-4
equivalent readings 9.76016E-4
much time 9.74291E-4
ing configurations 9.74241E-4
grammar designer 9.70739E-4
montague grammar 9.70739E-4
scope ambiguity 9.6985E-4
equivalent configurations 9.64533E-4
style corpus 9.614770000000001E-4
further readings 9.60979E-4
underspecified representation 9.582080000000001E-4
root fragments 9.52591E-4
many readings 9.52088E-4
underspecified chart 9.48831E-4
permutability relation 9.47479E-4
root fragment 9.457509999999999E-4
