P04-1051 computing the optimal ordering the discourse ordering problem . We formalise the problem
P04-1051 we have shown how to encode the discourse ordering problems of arbitrary arity d
P06-2103 an A search algorithm for the discourse ordering problem that comes with strong
P06-2103 obtained improved results on the discourse ordering problem compared to the individual
P06-2103 range of practical problems ( discourse ordering of up to 15 units ) , the algorithm
P04-1051 to do this , we first redefine discourse ordering as a graph problem . d-place
P04-1051 literature . We also show that the discourse ordering problem is NP-complete and can
P04-1051 compute good solutions to the discourse ordering problem , as Lapata ( 2003 )
P06-2103 information from this model , as the discourse ordering problem can - not accommodate
P04-1051 GATSP can easily solve practical discourse ordering problems if d = 2 , and are still
E89-1030 chronological sequence , while the discourse ordering might begin instead with the
E14-1028 been shown to be NP-complete in discourse ordering ( Althaus et al. , 2004 ) and
P04-1051 is a family of algorithms for discourse ordering based on genetic programming
P04-1051 literature on TSP to bear on the discourse ordering prob - lem . One straightforward
P04-1051 salesman problem : Even the two-place discourse ordering problem can encode ATSP . This
P04-1051 Ordering and TSP Now we show that discourse ordering and the travel - ling salesman
E06-2026 parse trees ( Klenner , 2005 ) and discourse ordering in generation ( Althaus et al.
P04-1051 this is the first algorithm for discourse ordering that can make any guarantees
P04-1051 can not be approximated . 2 The Discourse Ordering Problem We will first give a
P06-2103 using geometric mean . For the discourse ordering problem , we represent hypotheses
hide detail