Sciweavers

1124 search results - page 192 / 225
» Mobile robot programming using natural language
Sort
View
ACL
1989
13 years 8 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
OSDI
1994
ACM
13 years 8 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 7 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
AAAI
1990
13 years 8 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha
WIA
2001
Springer
13 years 12 months ago
Finite-State Transducer Cascade to Extract Proper Names in Texts
This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with...
Nathalie Friburger, Denis Maurel