We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Despite its intuitive appeal, the hypothesis that retrieval at the level of “concepts” should outperform purely term-based approaches remains unverified empirically. In addit...
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
Abstract. Most Information Retrieval models take documents as Bagof-Words and are thereby bound to the language of the documents. In this paper, we present an approach using Linked...
There is a growing interest in the use of UML class diagrams as a modeling language to represent domain ontologies. In a series of papers (e.g., [1,2]) we have been using the Gener...