Sciweavers

22 search results - page 2 / 5
» Processing Complex Sentences in the Centering Framework
Sort
View
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
AAAI
2000
14 years 11 months ago
A Consistency-Based Model for Belief Change: Preliminary Report
We present a general, consistency-based framework for belief change. Informally, in revising K by , we begin with and incorporate as much of K as consistently possible. Formally, ...
James P. Delgrande, Torsten Schaub
ALT
2007
Springer
15 years 6 months ago
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
Sanjay Jain, Efim B. Kinber
COMPGEOM
2003
ACM
15 years 2 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
PAKM
2004
14 years 11 months ago
Incremental Knowledge Acquisition for Building Sophisticated Information Extraction Systems with KAFTIE
Abstract. The aim of our work is to develop a flexible and powerful Knowledge Acquisition framework that allows users to rapidly develop Natural Language Processing systems, includ...
Son Bao Pham, Achim G. Hoffmann