5 citations · 14 across the 5 of their papers we have counts for
7 papers
Higher-order Cons-free Interpreters
Cynthia Kop, Jakob Grue Simonsen
Constructor rewriting systems are said to be cons-free if any constructor term occurring in the rhs of a rule must be a subterm of the lhs of the rule. Roughly, such systems cannot…
Evaluation Measures for Relevance and Credibility in Ranked Lists
Christina Lioma, Jakob Grue Simonsen, Birger Larsen
Recent discussions on alternative facts, fake news, and post truth politics have motivated research on creating technologies that allow people not only to access information, but a…
The Power of Non-Determinism in Higher-Order Implicit Complexity
Cynthia Kop, Jakob Grue Simonsen
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders,…
Deep Learning Relevance: Creating Relevant Information (as Opposed to Retrieving it)
Christina Lioma, Birger Larsen, Casper Petersen +1
What if Information Retrieval (IR) systems did not just retrieve relevant information that is stored in their indices, but could also "understand" it and synthesise it into a singl…
Complexity Hierarchies and Higher-Order Cons-Free Rewriting
Cynthia Kop, Jakob Grue Simonsen
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the…
A Hierarchical Recurrent Encoder-Decoder For Generative Context-Aware Query Suggestion
Alessandro Sordoni, Yoshua Bengio, Hossein Vahabi +3
Users may strive to formulate an adequate textual query for their information need. Search engines assist the users by presenting query suggestions. To preserve the original search…