Sciweavers

6618 search results - page 408 / 1324
» Natural Logic for Natural Language
Sort
View
CADE
1992
Springer
15 years 11 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
EUSFLAT
2009
120views Fuzzy Logic» more  EUSFLAT 2009»
15 years 5 months ago
On M-Approximative Operators and M-Approximative Systems
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
Alexander P. Sostak
CICLING
2005
Springer
16 years 1 months ago
Unsupervised Evaluation of Parser Robustness
Abstract. This article describes an automatic evaluation procedure for NLP system robustness under the strain of noisy and ill-formed input. The procedure requires no manual work o...
Johnny Bigert, Jonas Sjöbergh, Ola Knutsson, ...
UML
2005
Springer
16 years 1 months ago
Modeling and Analysis of Real-Time and Embedded Systems
: This paper presents an overview of the workshop MARTES on Modeling and Analysis of Real-time and Embedded Systems that has taken place for the first time in association with the ...
Susanne Graf, Sébastien Gérard, &Osl...
CICLING
2004
Springer
16 years 1 months ago
The Challenge of Creative Information Retrieval
Information retrieval (IR) is an effective mechanism for text management that has received widespread adoption in the world at large. But it is not a particularly creative mechanis...
Tony Veale