Sciweavers

6618 search results - page 1305 / 1324
» Natural Logic for Natural Language
Sort
View
COLING
1996
13 years 8 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
COLING
1992
13 years 8 months ago
Generating Coherent Argumentative Paragraphs
Q Should I take AI this semester? We address the problem of generating a coherent A If you want to take courses likeparagraph presenting arguments for a conclusion in a Natural La...
Michael Elhadad
WOTUG
2007
13 years 8 months ago
A Process-Oriented Architecture for Complex System Modelling
Abstract. A fine-grained massively-parallel process-oriented model of platelets (potentially artificial) within a blood vessel is presented. This is a CSP inspired design, expres...
Carl G. Ritson, Peter H. Welch
BIRTHDAY
2009
Springer
13 years 8 months ago
Towards the Automatic Acquisition of a Valence Dictionary for Polish
This article presents the evaluation of a valence dictionary for Polish produced with the help of shallow parsing techniques and compares those results to earlier results involving...
Adam Przepiórkowski
CIDR
2009
129views Algorithms» more  CIDR 2009»
13 years 8 months ago
Extracting and Querying a Comprehensive Web Database
Recent research in domain-independent information extraction holds the promise of an automatically-constructed structured database derived from the Web. A query system based on th...
Michael J. Cafarella
« Prev « First page 1305 / 1324 Last » Next »