|Title||Weight-Ordered Enumeration of Referents and Cutting Off Lengthy Enumerations|
|Year of Publication||2011|
|Assignee||Tatu Ylönen Oy|
|Patent Number||US 2011/0131033 A1|
In many reference resolution problems there are many candidate referents, and the overhead of enumerating them can be considerable. The overhead is reduced by stopping enumeration before all candidate referents have been enumerated, utilizing the properties of ordered and semi-ordered enumerators. Converting semi-ordered enumerators into ordered enumerators and combining several ordered enumerators into a single using dynamic weightings for handling determiner interpretations are disclosed.