Deriving polarity effects
Polarity Items are linguistic expressions known for being a ‘lexically controlled’ phenomenon. In this paper we show how their behavior can be implemented in a deductive system. Further- more, we point out some possible directions to recast the deductive solution into a Tree Ad- joining Grammar system. In particular, we suggest to compare the proof system developed for Multimodal Categorial Grammar (Moot & Puite, 1999) with the Partial Proof Trees proposed in (Joshi & Kulick, 1997).
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Types as Graphs: Continuations in Type Logical Grammar. [REVIEW]Chris Barker & Chung-chieh Shan - 2006 - Journal of Logic, Language and Information 15 (4):331-370.
Licensing and Sensitivity in Polarity Items: From Downward Entailment to (Non)Veridicality.Anastasia Giannakidou - manuscript
Associative Grammar Combination Operators for Tree-Based Grammars.Yael Sygal & Shuly Wintner - 2009 - Journal of Logic, Language and Information 18 (3):293-316.
Negative Contexts: Collocation, Polarity and Multiple Negation.Ton van der Wouden - 1997 - Routledge.
Partial Proof Trees as Building Blocks for a Categorial Grammar.Aravind K. Joshi & Seth Kulick - 1997 - Linguistics and Philosophy 20 (6):637-667.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?