Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Journal of Language Modelling

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: type-logical grammar

Sortuj według:

Ogranicz wyniki do:

Serial verb constructions and covert coordinations in Edo : an analysis in Type Logical Grammar

Naumann Ralf, Gamerschlag Thomas

Journal of Language Modelling

2020

Vol. 8, No. 2

337--413

Based on both syntactic and semantic criteria, Stewart (2001) and, following him, Baker and Stewart (1999), distinguish two types of serial verb constructions (SVC) and one type of covert coordination (CC) in Edo. In this article, we present an analysis of these constructions, using Type Logical Grammar (TLG) with an event-based semantic component. We choose as base logic the non-associative Lambek calculus augmented with two unary multiplicative connectives (NL(◊, □)). SVCs and CCs are interpreted as complex event structures. The complex predicates underlying these structures are derived from simple verbs by means of a constructor. SVCs and CCs differ in terms of which part of the complex event structure is denoted. For SVCs, this is the sum of all events in the structure whereas for a CC this is only the first event in the sequence. The two verbs in an SVC and a CC are treated asymmetrically by assuming that the first verb has an extended subcategorization frame. The additional argument is of type vp (possibly modally decorated). Constraints on word order and the realization of arguments are accounted for using structural rules like permutation and contraction. The application of these rules is enforced by making use of the unary connectives.

Combining logical and distributional methods in type-logical grammars

Moot R.

Journal of Language Modelling

2018

Vol. 6, No. 2

287--317

We propose a low-level way of combining distributional and logical ideas into a single formal system. This will be an instantiation of a more general system, adding weights to proof rules. These weights will not measure some sort of “confidence the proof is valid”, but Rather act as a way to prefer some proofs over others, where preference can mean “easier to process (for humans)” or “more coherent (combining words that make sense together)”. The resulting system of weighted theorem proving can be implemented either as a best-first proof serach strategy or as a polynomial-time approximation of proof search for NP-complete parsing problems.

A type-logical treebank for French

Moot R.

Journal of Language Modelling

2015

Vol. 3, No. 1

229--264

This paper describes the TLGbank, a treebank developed in the framework of (multimodal) type-logical grammar. Using the French Treebank as a starting point, a combination of automated and manual techniques are applied to obtain type-logical derivations (parses) corresponding to the phrases of the French Treebank. 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.