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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We introduce efficient algorithms for finding the $k$ shortest paths of aweighted pushdown automaton (WPDA), a compact representation of a weighted setof strings with potential applications in parsing and machine translation. Bothof our algorithms are derived from the same weighted deductive logicdescription of the execution of a WPDA using different search strategies.Experimental results show our Algorithm 2 adds very little overhead vs. thesingle shortest path algorithm, even with a large $k$.

Two Algorithms for Finding $k$ Shortest Paths of a Weighted Pushdown Automaton