Sciweavers

681 search results - page 81 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
VL
1993
IEEE
159views Visual Languages» more  VL 1993»
15 years 1 months ago
A Visual Logic Programming Language Based on Sets and Partitioning Constraints
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
Lindsey L. Spratt, Allen L. Ambler
ICALP
1997
Springer
15 years 1 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
TAL
2004
Springer
15 years 3 months ago
SisHiTra : A Hybrid Machine Translation System from Spanish to Catalan
In the current European scenario, characterized by the coexistence of communities writing and speaking a great variety of languages, machine translation has become a technology of ...
José R. Navarro, Jorge González, Dav...
EMNLP
2011
13 years 9 months ago
Compositional Matrix-Space Models for Sentiment Analysis
We present a general learning-based approach for phrase-level sentiment analysis that adopts an ordinal sentiment scale and is explicitly compositional in nature. Thus, we can mod...
Ainur Yessenalina, Claire Cardie
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 9 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen