Sciweavers

3653 search results - page 269 / 731
» On Recognizable Timed Languages
Sort
View
SLP
1993
117views more  SLP 1993»
15 years 8 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz
CORR
1998
Springer
84views Education» more  CORR 1998»
15 years 7 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta
DLOG
2010
15 years 5 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...
EMNLP
2009
15 years 5 months ago
Fast Translation Rule Matching for Syntax-based Statistical Machine Translation
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence d...
Hui Zhang, Min Zhang, Haizhou Li, Chew Lim Tan
EMNLP
2009
15 years 5 months ago
A Syntactified Direct Translation Model with Linear-time Decoding
Recent syntactic extensions of statistical translation models work with a synchronous context-free or tree-substitution grammar extracted from an automatically parsed parallel cor...
Hany Hassan, Khalil Sima'an, Andy Way