Some recent GRE algorithms have done away with the separation between content determination and linguistic realization , interleaving the two processes instead ( Stone and Webber 1998 ; Krahmer and Theune 2002 ) .
efficient contextsensitive generation of referring expressions
Emiel Krahmer Mari¨et Theune
Some recent GRE algorithms have done away with the separation between content determination and linguistic realization , interleaving the two processes instead ( Stone and Webber 1998 ; Krahmer and Theune 2002 ) . We have separated the two phases because , in the case of vague descriptions , interleaving would tend to be difficult .
Some recent GRE algorithms have done away with the separation between content determination and linguistic realization , interleaving the two processes instead ( Stone and Webber 1998 ; @@CITATION ) .