Bernardi, R. and R. Moot, `Generalized quantifiers in declarative and interrogative sentences'. Proceedings ICoS2. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Structural Equations in Language Learning - Moortgat (Correct)
....## decoration in its result subtype. In the base logic, we have s (np ##s) s (np s) i.e. the ## decoration on argument subtypes can be simplified away, allowing a derivation of e.g. Nobody left where there is no polarity item to be checked. This strategy of unary decoration is extended in [3] to lexically enforce constraints on the scopal possibilities of generalized quantifier expressions such as discussed in [1] For the use of unary type decoration to provide controlled access to structural reasoning, we can rely on the results of [11] In that paper, we present embedding ....
Bernardi, R. and R. Moot, `Generalized quantifiers in declarative and interrogative sentences'. Proceedings ICoS2.
Solving Structural Equations - Moortgat (Correct)
....We have the following agreement patterns in function argument structures: ##A . # # # ##A B # B A B # B ##A B # B A . # # # ##A B ## B A B # B ##A B # B ##A . # # # ##A B ## B A B ## B ##A B # B # no need for subtyping postulates as in [Lambek 98] Applications: polarity [Bernardi 2000]; case, agreement [Moortgat Oehrle 99] Contents First Last Prev Next # 2. Solving type equations 2.1. Acquiring a lexicon lexicon: type assignment relation Alice # np Tweedledum # np . learning new words: solving for unknowns. Example: Alice slaapt ( Alice sleeps ) np . ....
Bernardi, R. and R. Moot, `Generalized quantifiers in declarative and interrogative sentences'. Proceedings ICoS2. (electronic version)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC