C88-1018 be too strict . The problem of quantifier scoping is a case in point . Zeevat 1987
C90-3045 a grammar in which alternative quantifier scopings may be generated for a single
A94-1022 FMRL . The basic strategy for quantifier scoping is a descendant of that used
E91-1044 describes an algorithm for generating quantifier scopings . The algorithm is designed to
E87-1039 semantic component that deals with quantifier scoping . Graphics to text . A dialogue
H86-1022 the representational power of quantifier scoping , belief spaces , etc. , to the
E95-1002 implements syntactic conditions on quantifier scoping and distributivity .1 The construction
A88-1008 earliest attempts to incorporate quantifier scoping into natural language understanding
E95-1032 order-sensitive interleaving of quantifier scoping and ellipsis resolution . It
A92-1003 lexical and structural ambiguities , quantifier scoping , anaphorical references , discourse
C90-3034 presented an algorithm to generate quantifier scopings from a representation of " predicate-argument
E93-1034 , and allows all the relative quantifier scopings at S nodes . 6.3 Pied Piping
H90-1010 ) \ -RSB- for more details on quantifiers scoping with Synchronous TAG ) . In particular
A92-1003 algorithm for the resolution of quantifier scopings generates all possible readings
A97-1002 such as reference resolution and quantifier scoping . The TINSEL interpreter is primarily
A92-1003 still neutral with respect to quantifier scopings . Each lexical entry , along
C82-1014 dependencies recorded in the DIS : quantifier scoping is determined primarily by surface
C90-3034 Xerox 1186 and Sun4 . <title> A Quantifier Scoping Algorithm without A Free Variable
C90-3045 Quantifiers In order to characterize quantifier scoping possibilities , we use a synchronous
A94-1022 performance . 4 Quantification The quantifier scoping module in Delphi takes a semantic
hide detail