A comparison of two N-best extraction methods for weighted tree automata

DOI10.1007/978-3-319-94812-6_9OpenAlexW2811104893MaRDI QIDQ1616962FDOQ1616962

Authors: Johanna Björklund, Anna Jonsson, Frank Drewes 

Publication date: 7 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94812-6_9

Recommendations

• An efficient best-trees algorithm for weighted tree automata over the tropical semiring
• Finding the \(N\) best vertices in an infinite weighted hypergraph
• Minimizing Deterministic Weighted Tree Automata
• Efficient enumeration of weighted tree languages over the tropical semiring

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (2)

• An efficient best-trees algorithm for weighted tree automata over the tropical semiring
• Tiburon: A Weighted Tree Automata Toolkit

This page was built for publication: A comparison of two \(N\)-best extraction methods for weighted tree automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1616962)