Deriving polarity effects
|Abstract||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||No categories specified (fix it)|
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Chris Barker & Chung-chieh Shan (2006). Types as Graphs: Continuations in Type Logical Grammar. Journal of Logic, Language and Information 15 (4).
Anastasia Giannakidou, Licensing and Sensitivity in Polarity Items: From Downward Entailment to (Non)Veridicality.
Yael Sygal & Shuly Wintner (2009). Associative Grammar Combination Operators for Tree-Based Grammars. Journal of Logic, Language and Information 18 (3).
Ton van der Wouden (1997). Negative Contexts: Collocation, Polarity and Multiple Negation. Routledge.
Aravind K. Joshi & Seth Kulick (1997). Partial Proof Trees as Building Blocks for a Categorial Grammar. 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?