A simple example of syntactic aggregation is merging the two sentencesJohn went to the shop and John bought an apple into the single sentenceJohn went to the shop and bought an apple. Syntactic aggregation can be much more complex than this. For example, aggregation can embed one of the constituents in the other; e.g., we can aggregate John went to the shop and The shop was closed into the sentence John went to the shop, which was closed. From a pragmatic perspective, aggregating sentences together often suggests to the reader that these sentences are related to each other. If this is not the case, the reader may be confused. For example, someone who reads John went to the shop and bought an apple may infer that the apple was bought in the shop; if this is not the case, then these sentences should not be aggregated.
Algorithms and issues
Aggregation algorithms must do two things:
Decide when two constituents should be aggregated
Decide how two constituents should be aggregated, and create the aggregated structure
The first issue, deciding when to aggregate, is poorly understood. Aggegration decisions certainly depend on the semantic relations between the constituents, as mentioned above; they also depend on the genre. They probably should depend on rhetorical and discourse structure. The literacy level of the reader is also probably important. But we have no integrated model which brings all these factors together into a single algorithm. With regard to the second issue, there have been some studies of different types of aggregation, and how they should be carried out. Harbusch and Kempen describe several syntactic aggregation strategies. In their terminology, John went to the shop and bought an apple is an example of forward conjunction Reduction Much less is known about conceptual aggregation. Di Eugenio et al.show how conceptual aggregation can be done in an intelligent tutoring system, and demonstrate that performing such aggregation makes the system more effective.
Software
Unfortunately there is not much software available for performing aggregation. However the SimpleNLG system does include limited support for basic aggregation. For example, the following code causes SimpleNLG to print out The man is hungry and buys an apple. SPhraseSpec s1 = nlgFactory.createClause; SPhraseSpec s2 = nlgFactory.createClause; NLGElement result = new ClauseCoordinationRule.apply; System.out.println;