Titlebook: Logical Aspects of Computational Linguistics; Second International Alain Lecomte,François Lamarche,Guy Perrier Conference proceedings 1999

软膏

Type Grammar Revisitedxplore the assignment of elements of a free protogroup to English words as an aid for checking which strings of words are well-formed sentences, though ultimately we may have to relax the requirement of freeness. By a pregroup we mean a protogroup which also satisfies 1 ≤ .. and 1 ≤ .., rendering ..

发出眩目光芒

等待

Nutrient

Derivational and Representational Views of Minimalist Transformational Grammar light. We claim that the argument itself is misguided: a transformational grammar should have . a derivational and representational interpretation, connected by soundness and completeness results. Second, we argue that the proper form of the representational interpretation is as an axiomatization o

POWER

The MSO Logic-Automaton Connection in Linguisticseak monadic second-order (MSO) logic on trees to implement linguistic processing and theory verification. Despite a staggering complexity bound, the success of and the continuing work on these techniques in computer science promises a usable tool to test formalizations of grammars. The advantages ar

hermetic

粗鲁的人

correspondent

Underspecification in Type-Logical Grammarsation logic for the unary connectives, ◊., □. is used to define a feature checking procedure. Each mode . represents some morphosyntactic feature. Underspecification is dealt with by assuming general modes that are related to specific instances by .. The distribution of features is regulated by mean

该得

On Fibring Feature Logics with Concatenation Logicsurrent .bring, in which feature-terms "live in" types. The dual-fibring contains also arrow-introduction rules for hypothetical reasoning. It is used to explain some "privileged features" in HPSG and their non-unification manipulation.

GUILE

An Operational Model for Parsing De.nite Clause Grammars with In.nite Termsion of context-free parsing. In particular, definite clause grammars can be interpreted as an extension of the classic context-free formalism where the notion of finite set of non-terminal symbols is generalized to a possibly infinite domain of directed graphs. In this case, standard polynomial pars