Licensing German negative polarity items in LTAG

Lichte, Timm; Kallmeyer, Laura

doi:10.3115/1654690.1654701

Cited by 3 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…with the proviso that for any constant c : α of Σ we have L(c) : L(α). 11 We follow [15] and we do not use VP categories. Using it would not change our analysis.…”

Section: Derivation Trees and Derived Treesmentioning

confidence: 99%

“…Another syntax-semantics interface perspective in TAG on NR predicates is proposed in [11] for German. Its modeling relies on multicomponent TAG [22] with an underspecified semantic representation [23].…”

Section: Related Workmentioning

confidence: 99%

“…It is also worth noting that the constraints we model using the fine tuning of types with [Neg = m] and [NPI = n] extensions is also present in [11]. The latter implements specific computations on the Neg features of the verbal spine that extend the usual notion of unification of TAG.…”

Section: Related Workmentioning

confidence: 99%

“…A similar effect on forcing specific readings occurs with NPI. When a NPI occurs in a positive embedded clause, it forces a NR reading of the (negated) matrix predicate [11]. Then, the negation has scope over the embedded sentence, but not over the whole sentence.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars

Danlos

Groote

Pogodalla

2014

New Frontiers in Artificial Intelligence

View full text Add to dashboard Cite

International audienceNeg-Raising (NR) verbs form a class of verbs with a clausal complement that show the following behavior: when a negation syntactically attaches to the matrix predicate, it can semantically attach to the embedded predicate. This paper presents an account of NR predicates within Tree Adjoining Grammar (TAG). We propose a lexical semantic interpretation that heavily relies on a Montague-like semantics for TAG and on higher-order types

show abstract

“…with the proviso that for any constant c : α of Σ we have L(c) : L(α). 11 We follow [15] and we do not use VP categories. Using it would not change our analysis.…”

Section: Derivation Trees and Derived Treesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars

Danlos

Groote

Pogodalla

2014

New Frontiers in Artificial Intelligence

View full text Add to dashboard Cite

show abstract

Chapter 11. The nature and licensing of hi:tʃ elements in Persian

Storoshenko

Nakhaei

2023

Advances in Iranian Linguistics II

View full text Add to dashboard Cite

This paper examines the nature of elements such as hi:tʃkӕs “anyone” in Persian, which have been described as either Negative Polarity Items (Taleghani 2006) or Negative Concord Items (Kwak 2010) in prior literature. Such claims have typically been used to motivate analyses of Persian NegP as being high in the clause structure, above TP. This is in contrast to more recent analyses which have argued for a low position of negation (Kahnemuyipour 2017). Here, we present experimental evidence showing that c-commanding negation is not sufficient for licensing hi:tʃ elements, unlike English any. We also show that hi:tʃ elements have many properties in common with similar elements in Japanese and Korean, where there is less certainty in designating these as Negative Concord Items, and where negation is independently argued to be low. Thus, we claim, the distribution of hi:tʃ elements cannot be upheld as a proof of syntactically high negation, under either a polarity item or concord item analysis. We close the paper with a typological discussion, suggesting that the properties of hi:tʃ elements and their kin seem to be broadly shared among OV languages more generally.

show abstract

Constraint-based computational semantics

Kallmeyer

Richter

2006

Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms - TAGRF '06

Self Cite

View full text Add to dashboard Cite

This paper compares two approaches to computational semantics, namely semantic unification in Lexicalized Tree Adjoining Grammars (LTAG) and Lexical Resource Semantics (LRS) in HPSG. There are striking similarities between the frameworks that make them comparable in many respects. We will exemplify the differences and similarities by looking at several phenomena. We will show, first of all, that many intuitions about the mechanisms of semantic computations can be implemented in similar ways in both frameworks. Secondly, we will identify some aspects in which the frameworks intrinsically differ due to more general differences between the approaches to formal grammar adopted by LTAG and HPSG.

show abstract

Licensing German negative polarity items in LTAG

Cited by 3 publications

References 9 publications

A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars

A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars

Chapter 11. The nature and licensing of hi:tʃ elements in Persian

Constraint-based computational semantics

Contact Info

Product

Resources

About