Abstract

The goal of the current paper is to describe the TLGbank, a treebank of type-logical proof semi-automatically extracted from the French Treebank. Though the framework chosen for the treebank are multimodal type-logical grammars, we have ensured that the analysis is compatible with other mondern type-logical grammars, such the displacement calculus and first-order linear logic. We describe the extraction procedure, analyse first results and compare the treebank to the CCGbank.

Highlights

  • This paper describes the TLGbank, a treebank developed in the framework of type-logical grammar

  • Categorial grammars in the logical tradition initiated by Lambek (1958) (Moortgat 2011; Morrill 2011; Moot and Retoré 2012) have stayed somewhat behind in terms of their application to large-scale linguistic data

  • The goal of the current paper is to describe the TLGbank, a semi-automatically extracted treebank containing type-logical proofs, created with the explicit goal of making similar wide-coverage parsing and semantics possible in the type-logical context

Read more

Summary

Richard Moot

This paper describes the TLGbank, a treebank developed in the framework of (multimodal) type-logical grammar. The TLGbank has been developped with applications to wide-coverage semantics in mind. This means that the TLGbank has richer structure than the original French Treebank, especially where it concerns semantically relevant information such as passives, coordination, extraction and gapping. Categorial grammars in the logical tradition initiated by Lambek (1958) (Moortgat 2011; Morrill 2011; Moot and Retoré 2012) have stayed somewhat behind in terms of their application to large-scale linguistic data. The goal of the current paper is to describe the TLGbank, a semi-automatically extracted treebank containing type-logical proofs, created with the explicit goal of making similar wide-coverage parsing and semantics possible in the type-logical context. The intrepid reader interested in the full technical details can find the complete presentation in Appendix A, with further applications in Appendix B

We will abbreviate the lexicon rule as w A
Hyp elle np
Splitting multiword expressions
The basic case
Verb clusters
Coordination and punctuation symbols
The unary connectives
Quoted speech
The structural rules
Findings
Coordination of multiple arguments
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call