2178 search results - page 270 / 436 » Inferring complex plans |
140
Voted
ACL
2006
15 years 5 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
156
click to vote
CLA
2004
15 years 5 months ago
2004
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
129
Voted
DLOG
2006
15 years 5 months ago
2006
This work is motivated by the task of describing in natural language a concept defined in an OWL DL ontology. However, rather than focussing on linguistic issues, we address the q...
142
click to vote
IJCAI
2003
15 years 5 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
134
click to vote
NIPS
2003
15 years 5 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...