Sciweavers

732 search results - page 64 / 147
» Using Types to Parse Natural Language
Sort
View
ECML
2003
Springer
14 years 1 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
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...
Yoav Seginer
SIGMOD
1993
ACM
140views Database» more  SIGMOD 1993»
14 years 17 days ago
Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization
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...
Ralf Hartmut Güting
BMCBI
2006
128views more  BMCBI 2006»
13 years 8 months ago
Lexical adaptation of link grammar to the biomedical sublanguage: a comparative evaluation of three approaches
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...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 8 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
HRI
2010
ACM
13 years 8 months ago
Towards robust human robot collaboration in industrial environments
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...
Batu Akan, Baran Çürüklü, Gi...