Skip to main content

Resolving Modal Anaphora in Dependent Type Semantics

  • Conference paper
  • First Online:
New Frontiers in Artificial Intelligence (JSAI-isAI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9067))

Included in the following conference series:

  • 802 Accesses

Abstract

This paper presents an analysis of modal subordination in the framework of Dependent Type Semantics, a framework of natural language semantics based on dependent type theory. Dependent types provide powerful type structures that have been applied to various discourse phenomena in natural language, yet there has been little attempt to produce an account of modality and its interaction with anaphora from the perspective of dependent type theory. We extend the framework of Dependent Type Semantics with a mechanism of handling explicit quantification over possible worlds, and show how modal anaphora and subordination can be handled within this framework.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Geurts [8] (pages 72–79) admits the importance of inferences with world knowledge in resolving presuppositions, but provides no clues on how to incorporate additional inferential architectures into the framework of DRT.

  2. 2.

    In dependent type theory, terms and types can be mutually dependent; thus, the terms defined here can serve as types as well.

  3. 3.

    Kratzer (2012) derives accessibility relation from a modal base and an ordering source. Our analysis would be compatible with such a decomposition.

  4. 4.

    In this section, might and would will be treated as propositional operators. A fully compositional analysis will be given in Sect. 6.

  5. 5.

    Presuppositional contents can be independent from asserted contents. A classical example is too; for example, John \(_i\) is leaving, too \(_i\) is said to be presupposing that some (particular) person other than John is leaving. Such cases can be treated within the present framework by incorporating the mechanism developed in Bekki and McCready [3] to handle semantic contents independent of the asserted meaning. The aim of Bekki and McCready [3] is to analyze conventional implicature in the framework of DTS, but their analysis can be applied, with a suitable modification, to the analysis of presuppositions that are independent of asserted contents.

References

  1. Asher, N., McCready, E.: Were, would, might and a compositional account of counterfactuals. J. Semant. 24(2), 93–129 (2007)

    Article  Google Scholar 

  2. Bekki, D.: Representing anaphora with dependent types. In: Asher, N., Soloviev, S. (eds.) LACL 2014. LNCS, vol. 8535, pp. 14–29. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  3. Bekki, D., McCready, E.: CI via DTS. In: Proceedings of the 11th International Workshop on Logic and Engineering of Natural Language Semantics (LENLS11), Kanagawa, Japan, pp. 110–123 (2014)

    Google Scholar 

  4. Carlson, G.N., Spejewski, B.: Generic passages. Nat. Lang. Semant. 5(2), 101–165 (1997)

    Article  Google Scholar 

  5. Chatzikyriakidis, S., Luo, Z.: Natural Language Reasoning Using Proof-assistant Technology : Rich Typing and Beyond. In: Proceedings of the EACL 2014 Workshop on Type Theory and Natural Language Semantics (TTNLS), Gothenburg, Sweden, pp. 37–45 (2014)

    Google Scholar 

  6. Clark, H.H.: Bridging. In: Schank, R.C., Nash-Webber, B.L. (eds.) Theoretical Issues In Natural Language Processing, pp. 169–174. Association for Computing Machinery, New York (1975)

    Google Scholar 

  7. Frank, A., Kamp, H.: On Context Dependence in Modal Constructions. In: Proceedings of SALT (1997)

    Google Scholar 

  8. Geurts, B.: Presuppositions and Pronouns. Elsevier, Oxford (1999)

    Google Scholar 

  9. Kratzer, A.: Modals and Conditionals: New and Revised Perspectives. Oxford University Press, Oxford (2012)

    Book  Google Scholar 

  10. Martin-Löf, P.: Intuitionistic Type Theory. Bibliopolis, Naples (1984)

    MATH  Google Scholar 

  11. Muskens, R.: An analytic tableau system for natural logic. In: Aloni, M., Bastiaanse, H., de Jager, T., Schulz, K. (eds.) Logic, Language and Meaning. LNCS, vol. 6042, pp. 104–113. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Ranta, A.: Type-theoretical Grammar. Oxford University Press, Oxford (1994)

    MATH  Google Scholar 

  13. Roberts, C.: Modal subordination and pronominal anaphora in discourse. Linguist. Philos. 12, 683–721 (1989)

    Article  Google Scholar 

  14. Roberts, C.: Anaphora in intensional contexts. In: Lappin, S. (ed.) The Handbook of Contemporary Semantic Theory, pp. 215–246. Blackwell, Oxford (1996)

    Google Scholar 

  15. van Rooij, R.: A modal analysis of presupposition and modal subordination. J. Semant. 22(3), 281–305 (2005)

    Article  Google Scholar 

  16. Steedman, M.: The Syntactic Process. MIT Press/Bradford Books, Cambridge (2000)

    MATH  Google Scholar 

  17. Sundholm, G.: Proof Theory and Meaning. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic. Synthese Library, vol. 166, pp. 471–506. Springer, Netherlands (1986)

    Chapter  Google Scholar 

  18. Tanaka, R., Mineshima, K., Bekki, D.: Resolving modal anaphora in Dependent Type Semantics. In: Proceedings of the 11th International Workshop on Logic and Engineering of Natural Language Semantics (LENLS11), Kanagawa, Japan, pp. 43–56 (2014)

    Google Scholar 

  19. Veltman, F.: Defaults in update semantics. J. Philos. Logic 25, 221–261 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This paper is a revised and expanded version of [18]. We thank the two reviewers of LENLS11 for helpful comments and suggestions on an earlier version of this paper. I also thank the audiences at LENLS11, in particular, Chris Barker and Matthew Stone, for helpful comments and discussion. Special thanks to Nicholas Asher, who gave constructive comments and advice, and to Antoine Venant, Fabio Del Prete, and Márta Abrusán for their feedback and discussions. This research was supported by JST, CREST.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ribeka Tanaka .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tanaka, R., Mineshima, K., Bekki, D. (2015). Resolving Modal Anaphora in Dependent Type Semantics. In: Murata, T., Mineshima, K., Bekki, D. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2014. Lecture Notes in Computer Science(), vol 9067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48119-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48119-6_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48118-9

  • Online ISBN: 978-3-662-48119-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics