Sciweavers

344 search results - page 51 / 69
» The Santa Claus problem
Sort
View
AAAI
1992
13 years 11 months ago
Learning to Disambiguate Relative Pronouns
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
Claire Cardie
COLING
1992
13 years 11 months ago
Dynamic Programming Method for Analyzing Conjunctive Structures in Japanese
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
Sadao Kurohashi, Makoto Nagao
JMLR
2002
78views more  JMLR 2002»
13 years 9 months ago
Shallow Parsing using Specialized HMMs
We present a unified technique to solve different shallow parsing tasks as a tagging problem using a Hidden Markov Model-based approach (HMM). This technique consists of the incor...
Antonio Molina, Ferran Pla
CP
2010
Springer
13 years 8 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
JUCS
2010
135views more  JUCS 2010»
13 years 4 months ago
Model-driven Transformation and Validation of Adaptive Educational Hypermedia using CAVIAr
Abstract: Authoring of Adaptive Educational Hypermedia is a complex activity requiring the combination of a range of design and validation techniques. We demonstrate how Adaptive E...
Mark Melia, Claus Pahl