Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 16 May 2021

Abstract and Keywords

This chapter provides an overview of, while examining various proposals for, ellipsis in Japanese. Fragments are examined, and it is claimed to be reasonable to assume that stripping, sluicing, and ellipsis in comparatives are a uniform phenomenon while short answers are distinct. It is also argued that the properties of Right-Node Raising can be best captured by a non-constituent string deletion analysis. Three approaches to null arguments are examined, and shortcomings in each are discussed. N’-deletion is then explored and claimed to be ambiguous between two structural possibilities: ellipsis and non-ellipsis. VP-ellipsis, gapping, and pseudo-gapping are also touched upon. One significant aspect of the ellipsis phenomena in Japanese illustrated in this chapter is that the presence and absence of a case-marker plays a crucial role, with case-marked and non-case-marked fragments being analyzed as instances of surface anaphora and deep anaphora, respectively. This indicates the importance of focusing on case-marked versions in the syntactic investigation of these phenomena.

Keywords: Japanese, sluicing, stripping, comparative, short answer, Right-Node Raising, null argument N’-deletion, case marker, Subjacency

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.