The account sketched in Section 4 was superimposed on an incremental GRE algorithm , partly because incrementality is well established in this area ( Appelt 1985 ; Dale and Reiter 1995 ) .
computational interpretations of the gricean maximes in the generation of referring expressions
Robbert Dale Ehud Reiter
Incrementality : Help or Hindrance ? The account sketched in Section 4 was superimposed on an incremental GRE algorithm , partly because incrementality is well established in this area ( Appelt 1985 ; Dale and Reiter 1995 ) . But IA may be replaced by any other reasonable7 GRE algorithm , for example , one that always exactly minimizes the number of properties expressed , or one that always `` greedily '' selects the property that removes the maximum number of distractors .
The account sketched in Section 4 was superimposed on an incremental GRE algorithm , partly because incrementality is well established in this area ( Appelt 1985 ; @@CITATION ) .