13026 search results - page 419 / 2606 » Probabilistic Relational Models |
147
click to vote
RSCTC
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
136
click to vote
AAAI
2008
15 years 7 months ago
2008
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
141
click to vote
NIPS
2001
15 years 6 months ago
2001
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
172
click to vote
COLING
2000
15 years 6 months ago
2000
In this paper, word sense dismnbiguation (WSD) accuracy achievable by a probabilistic classifier, using very milfimal training sets, is investigated. \Ve made the assuml)tiou that...
150
Voted
EMNLP
2010
15 years 3 months ago
2010
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...