It always generates shortest possible referring description to identify an object. But Reiter and<cite> Dale (1995)</cite> later proved that Full Brevity requirement is an NP-Hard task, thus computationally intractable and offered an alternative polynomial time Incremental Algorithm.