| … | … | @@ -760,8 +760,17 @@ So that is one task: find the statistical distribution of parses that are |
| 760 | 760 | The other task is to learn what the disjuncts are, to learn the cost of |
| 761 | 761 | each disjunct. |
| 762 | 762 | The costs are NOT fixed, we are instead exploring the space of possible |
| 763 | | disjunct assignements. |
| 764 | | For this we need to ... |
| 763 | disjunct assignments. |
| 764 | For this we need to take the other form: |
| 765 | \begin_inset Formula |
| 766 | \[ |
| 767 | H\left(S\right)=\sum_{G\in\mathcal{G}}h\left(G\right) |
| 768 | \] |
| 769 | |
| 770 | \end_inset |
| 771 | |
| 772 | This is the appropriate form, because we want to consider all possible disjunct |
| 773 | cost assignments, and minimize those |
| 765 | 774 | \end_layout |
| 766 | 775 | |
| 767 | 776 | \begin_layout Section* |