Sciweavers

5904 search results - page 621 / 1181
» Requirements for a Composition Language
Sort
View
ICLP
2009
Springer
16 years 8 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
EACL
2009
ACL Anthology
16 years 8 months ago
N-Gram-Based Statistical Machine Translation versus Syntax Augmented Machine Translation: Comparison and System Combination
In this paper we compare and contrast two approaches to Machine Translation (MT): the CMU-UKA Syntax Augmented Machine Translation system (SAMT) and UPC-TALP N-gram-based Statisti...
José A. R. Fonollosa, Maxim Khalilov
EACL
2009
ACL Anthology
16 years 8 months ago
Using Lexical and Relational Similarity to Classify Semantic Relations
Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-bas...
Ann A. Copestake, Diarmuid Ó Séaghdh...
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 7 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
ICFP
2005
ACM
16 years 7 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones