1404 search results - page 140 / 281 » Complexity of admissible rules |
ACL
1990
13 years 10 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
ANOR
2010
13 years 9 months ago
2010
Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a method to adapt a general parser (Link Parser) to sublanguages, focusing on the parsing of texts in biology. Our main proposal is the use of terminolog...
JUCS
2008
13 years 9 months ago
2008
: This paper analyses aspects about the recommendation process in distributed information systems. It extracts similarities and differences between recommendations in estores and t...
APAL
1999
13 years 8 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...