Aggregation with Strong Regularities and Alternatives
Helmut Horacek · 2002
Aggregation is typically treated in NLG as a local optimization measure, and methods exist only for building conjoined expressions with 'and'. In contrast to that, solutions to logical problems are characterized by regularly occurring commonalities, including complete subsets of possible value combinations and alternatives. In order to address constellations of this kind, we extend current aggregation techniques, envisioning high degrees of condensation.