We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...
Background: We study the adaptation of Link Grammar Parser to the biomedical sublanguage with a focus on domain terms not found in a general parser lexicon. Using two biomedical c...
Sampo Pyysalo, Tapio Salakoski, Sophie Aubin, Adel...
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
In this paper a system, which is driven through natural language, that allows operators to select and manipulate objects in the environment using an industrial robot is proposed. I...