A search path is a series of steps in the search for a referent, representing visits to nodes in the domain tree D. The path will be modeled by an ordered list of visited nodes: O = n 1 , n 2 , .
we want to consider situations in which FI and SL have produced a complete description, and investigate how much gain has been made by using this compared to a less complete description that is still more complete than MD.