Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © 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: 14 October 2019

Abstract and Keywords

This chapter gives an overview of native compounding in French. It also sketches a description of the two most widespread and productive types among these compounds, V + N and N + N (22.4), with a discussion of previous analyses.

Keywords: French compounds, compounding, verbs, nouns

Bernard Fradin

Bernard Fradin is a researcher at the Laboratoire de Linguistique Formelle (CNRS and University Paris 7 Diderot), Paris, France. His main current research interests centre on morphology and more specifically on the semantics of word-building morphology. Papers by him appeared in the proceedings of various international morphology meetings. He was in charge of the research group (GDR 2220) ‘Description and modelisation in morphology’ (2000–2007), which played a key role in the development of morphology in France in recent years. He published an essay Nouvelles approches en morphologie (Presses Universitaires de France, Paris) in 2003. He is the editor of La raison morphologique (John Benjamins) and co-editor of Aperçu de morphologie du français (Presses Universitaires de Vincennes, to appear), a book which offers new insights on several morphological and morpho-phonological phenomena of French.

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.