DeepAI AI Chat
Log In Sign Up

Extracting and Learning a Dependency-Enhanced Type Lexicon for Dutch

by   Konstantinos Kogkalidis, et al.

This thesis is concerned with type-logical grammars and their practical applicability as tools of reasoning about sentence syntax and semantics. The focal point is narrowed to Dutch, a language exhibiting a large degree of word order variability. In order to overcome difficulties arising as a result of that variability, the thesis explores and expands upon a type grammar based on Multiplicative Intuitionistic Linear Logic, agnostic to word order but enriched with decorations that aim to reduce its proof-theoretic complexity. An algorithm for the conversion of dependency-annotated sentences into type sequences is then implemented, populating the type logic with concrete, data-driven lexical types. Two experiments are ran on the resulting grammar instantiation. The first pertains to the learnability of the type-assignment process by a neural architecture. A novel application of a self-attentive sequence transduction model is proposed; contrary to established practices, it constructs types inductively by internalizing the type-formation syntax, thus exhibiting generalizability beyond a pre-specified type vocabulary. The second revolves around a deductive parsing system that can resolve structural ambiguities by consulting both word and type information; preliminary results suggest both excellent computational efficiency and performance.


page 1

page 2

page 3

page 4


Constructive Type-Logical Supertagging with Self-Attention Networks

We propose a novel application of self-attention networks towards gramma...

The Grail theorem prover: Type theory for syntax and semantics

As the name suggests, type-logical grammars are a grammar formalism base...

Making first order linear logic a generating grammar

It is known that different categorial grammars have surface representati...

First order linear logic and tensor type calculus for categorial grammars

We study relationship between first order multiplicative linear logic (M...

Type-Driven Incremental Semantic Parsing with Polymorphism

Semantic parsing has made significant progress, but most current semanti...

Schematic Polymorphism in the Abella Proof Assistant

The Abella interactive theorem prover has proven to be an effective vehi...