English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Hyperlinks and other relations in Wikipedia are a extraordinary resourcewhich is still not fully understood. In this paper we study the different typesof links in Wikipedia, and contrast the use of the full graph with respect tojust direct links. We apply a well-known random walk algorithm on two tasks,word relatedness and named-entity disambiguation. We show that using the fullgraph is more effective than just direct links by a large margin, thatnon-reciprocal links harm performance, and that there is no benefit fromcategories and infoboxes, with coherent results on both tasks. We set newstate-of-the-art figures for systems based on Wikipedia links, comparable tosystems exploiting several information sources and/or supervised machinelearning. Our approach is open source, with instruction to reproduce results,and amenable to be integrated with complementary text-based methods.

Studying the Wikipedia Hyperlink Graph for Relatedness and Disambiguation