4 To turn this likelihood into a certainty , one can add a test at the end of the algorithm , which adds a type-related property if none is present yet ( cfXXX , Dale and Reiter 1995 ) .
computational interpretations of the gricean maximes in the generation of referring expressions
Robbert Dale Ehud Reiter
3 The degree of precision of the measurement ( James et al. 1996 , Section 1.5 ) determines which objects can be described by the GRE algorithm , since it determines which objects count as having the same size . 4 To turn this likelihood into a certainty , one can add a test at the end of the algorithm , which adds a type-related property if none is present yet ( cfXXX , Dale and Reiter 1995 ) . VAGUE uses both of these devices .
4 To turn this likelihood into a certainty , one can add a test at the end of the algorithm , which adds a type-related property if none is present yet ( cfXXX , @@CITATION ) .