| C86-1127 | fragment of the presently developed | DRS construction | algorithm . We want to argue |
| C86-1040 | discourse representations the | DRS construction | algorithm found iu Kamp ( 1986 |
| C92-1045 | reference time again . In this way , | DRS construction | can encode the relative temporal |
| P93-1011 | algorithm -LSB- 23 , 24 -RSB- . The | DRS construction | algorithm consists of a set of |
| E83-1009 | contain any other conditions . The | DRS construction | rules specify how these senantic |
| C86-1127 | the correctness definition . The | DRS construction | algorithm is a mapping from natural |
| J89-3002 | syntactic parse as input to the | DRS construction | procedures ( Wada and Asher 1986 |
| C86-1127 | indefinites . When processed by the | DRS construction | algorithm , a singular indefinite |
| C86-1127 | has two basic components : the | DRS construction | algorithm and the correctness |
| C94-2181 | can be constructed by means of | DRS construction | rules whose application reflects |
| C86-1127 | indefinites and anaphoric pronouns , the | DRS construction | algorithm yields the DRS in ( |
| C86-1005 | derive DRSs can he regarded as | DRS construction | algorithm in its own right . |
| J95-2006 | easily , and fragments of the | DRS construction | algorithm now run in LISP and |
| P88-1010 | to a compositional system for | DRS construction | . Barwise -LSB- 2 -RSB- uses |
| C96-1007 | in the scope ( in the sense of | DRS construction | ) of the possible negation . |
| P93-1011 | in mind ; I 'm thinking of the | DRS construction | algorithm -LSB- 23 , 24 -RSB- |
| C86-1127 | implement on a computer not only the | DRS construction | algorithm but also the correctness |
| C94-2126 | sense disambiguation mechanism , a | DRS construction | module , an anaphora resolver |
| C86-1127 | must take place at the level of | DRS construction | ; the assignment of truth conditions |
| J95-2006 | goal . Careful attention to the | DRS construction | process has yielded computational |
