Abstract
Neg-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.
This work has been supported by the French agency Agence Nationale de la Recherche (ANR-12-CORD-0004).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
We do not discuss here the use of subjunctive in the embedded clause when the matrix predicate is in negative form as it does not add to the constraints we describe.
- 2.
At least some NPI. Some other NPI seems to perfectly occur in a similar position. See [2].
- 3.
For sake of clarity, we use a simplified version here.
- 4.
In addition to defining
on the atomic types and on the constants of \(\varSigma \), we have:-
if \(\alpha \rightarrow \beta \) is a type build on \(\varSigma \) then
; -
if \(x \in \varLambda (\varSigma )\) (resp. \(\lambda x.t \in \varLambda (\varSigma )\) and \(t\,u \in \varLambda (\varSigma )\)) then
(resp. 
and 
);
with the proviso that for any constant \(c: \alpha \) of \(\varSigma \) we have
. -
- 5.
We follow [15] and we do not use
categories. Using it would not change our analysis. - 6.
We use the \(\beta _{{\small \mathrm {\tiny NR~predicate}}}\) notation for constants to be interpreted with the non-NR reading, and \(\beta _{{\small \mathrm {\tiny NR~predicate}}}'\) for those to be interpreted with the NR reading.
- 7.
In the described architecture, the semantic ambiguities are derived from “derivation ambiguities”. We can avoid this in considering an intermediate level between
and \(\varSigma _{{{\textit{trees}}}}\). \(\beta _{{\small \mathrm {pense}}}\) and \(\beta _{{\small \mathrm {pense}}}'\) would map on the same term of this intermediate level, and the latter would be considered as the actual derivation tree representation level. The upper part would then be considered as lying within the semantic device. However this intermediate level would not provide any additional modeling capability so we do not consider it here. - 8.
We should be more careful with the licensed combinations, but this is enough to show how to force the reading.
on the atomic types and on the constants of 
;
(resp. 
and 
);
.
categories. Using it would not change our analysis.
and References
Bartsch, R.: “Negative Transportation” gibt es nicht. Linguistische Berichte 27 (1973)
Gajewski, J.R.: Neg-raising and polarity. Linguist. Philos. 30(3), 289–328 (2007)
Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3. Springer, Berlin (1997)
de Groote, P.: Towards abstract categorial grammars. In: Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148–155 (2001)
Shieber, S.M., Schabes, Y.: Synchronous tree-adjoining grammars. In: Proceedings of the 13th International Conference on Computational Linguistics, Helsinki, Finland, vol. 3, pp. 253–258 (1990)
Nesson, R., Shieber, S.M.: Simpler TAG semantics through synchronization. In: Proceedings of the 11th Conference on Formal Grammar, Malaga, Spain, CSLI Publications, 29–30 July 2006
Storoshenk, D.R., Frank, R.: Deriving syntax-semantics mappings: node linking, type shifting and scope ambiguity. In: hye Han, C., Satta, G. (eds.) Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Framework (TAG+11), pp. 10–18 (2012)
Horn, L.R.: Neg-raising predicates: towards an explanation. In: Proceedings of CLS 11 (1975)
Horn, L.R.: A Natural History of Negation. University of Chicago Press, Chicago (1989)
Horn, L.R.: Negative transportation: unsafe at any speed? In: Proceedings of CLS 7 (1971)
Lichte, T., Kallmeyer, L.: Licensing German negative polarity items in LTAG. In: Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, Sydney, Australia, pp. 81–90. Association for Computational Linguistics, July 2006
Danlos, L.: Connecteurs de discours adverbiaux: Problèmes à l’interface syntaxe-sémantique. Lingvisticæ Investigationes 36(2) (2013)
Danlos, L.: D-STAG: a formalism for discourse analysis based on SDRT and using synchronous TAG. In: de Groote, P., Egg, M., Kallmeyer, L. (eds.) FG 2009. LNCS (LNAI), vol. 5591, pp. 64–84. Springer, Heidelberg (2011)
XTAG Research Group: A lexicalized tree adjoining grammar for English. Technical report IRCS-01-03, IRCS, University of Pennsylvania (2001)
Abeillé, A.: Une grammaire électronique du français. CNRS Éditions (2002)
de Groote, P.: Tree-adjoining grammars as abstract categorial grammars. In: TAG+6, Proceedings of the sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, Università di Venezia, pp. 145–150 (2002)
Pogodalla, S.: Advances in abstract categorial grammars: language theory and linguistic modeling. ESSLLI 2009 Lecture Notes, Part II (2009)
Shieber, S.M.: Unifying synchronous tree adjoining grammars and tree transducers via bimorphisms. In: Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL-2006), pp. 377–384 (2006)
de Groote, P., Maarek, S.: Type-theoretic extensions of abstract categorial grammars. In: New Directions in Type-Theoretic Grammars, Proceedings of the Workshop, 18–30 (2007). http://let.uvt.nl/general/people/rmuskens/ndttg/ndttg2007.pdf
de Groote, P., Maarek, S., Yoshinaka, R.: On two extensions of abstract categorial grammars. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 273–287. Springer, Heidelberg (2007)
Abusch, D.: Presupposition triggering from alternatives. J. Semant. 27(1), 37–80 (2010)
Weir, D.J.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania (1988)
Kallmeyer, L., Romero, M.: Scope and situation binding for LTAG. Res. Lang. Comput. 6(1), 3–52 (2008)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Danlos, L., de Groote, P., Pogodalla, S. (2014). A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars. In: Nakano, Y., Satoh, K., Bekki, D. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2013. Lecture Notes in Computer Science(), vol 8417. Springer, Cham. https://doi.org/10.1007/978-3-319-10061-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-10061-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10060-9
Online ISBN: 978-3-319-10061-6
eBook Packages: Computer ScienceComputer Science (R0)