Titlebook: Logical Aspects of Computational Linguistics; 6th International Co Sylvain Pogodalla,Jean-Philippe Prost Conference proceedings 2011 Spring

缺陷

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types,epeatable dependencies. For these grammars, it is known that they are not learnable from dependency structures..We propose two different ways of modelling the repeatable dependencies through iterated types and the two corresponding families of CDG which cannot distinguish between the dependencies re

cartilage

Closure Properties of Minimalist Derivation Tree Languages, regular tree languages [4, 5]. Using a variation of a proof technique devised by Thatcher [17], I show that even though closure under intersection does not obtain, it holds for every MG and regular tree language that their intersection is identical to the derivation tree language of some MG . categ

GULP

Well-Nestedness Properly Subsumes Strict Derivational Minimalism,le string languages as .. Adding another LC to MGs, the ., results in a proper subclass of derivable languages. It is rather straightforward to see this class is embedded within the class of languages derivable by some . . .. In this paper we show that the embedding is even proper. We partially do s

Cholecystokinin

Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages,ed. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages. This allows us to conclude that taking into account the possibility of ‘semantic crashes’ in the standard approach to interpreting

Ophthalmologist

constitutional

Contextual Analysis of Word Meanings in Type-Theoretical Semantics,ings of words may be represented in type-theoretical semantics, the formal semantics based on modern type theories. It is shown, in particular, that the framework of coercive subtyping provides various useful tools in the representation.

Critical

Logic Programming of the Displacement Calculus,ccommodated alongside continuity in a logic which is free of structural rules and which enjoys Cut-elimination, the subformula property, decidability, and the finite reading property. The calculus deploys a new kind of sequent calculus which we call hypersequent calculus in which types and configura

esculent

Conditional Logic ,, and Its Tableau System, has been pointed out in the literature that empirical problems plague all of the previously proposed conditional logics. Moreover, . . and . . are defined by imposing certain restrictions on their Kripke frames, and there exist no corresponding proof systems..In order to solve these problems, we pr

沙发

myalgia

Event in Compositional Dynamic Semantics,hetorical relations are embedded in the resulting interpretation of the framework. We assume discourse and sentence are distinct semantic objects, that play different roles in meaning evaluation. Moreover, two sets of composition functions, for handling different discourse relations, are introduced.