Improved N-Best Extraction with an Evaluation on Language Data

Improved N-Best Extraction with an Evaluation on Language Data

We show that a previously proposed algorithm for the N-best trees problem can be made more efficient by changing how it arranges and explores the search space. Given an integer N and a weighted tree automaton (wta) M over the tropical semiring, the algorithm computes N trees of minimal weight with r...

Full description

Bibliographic Details
Main Authors: Björklund, J. (Author), Drewes, F. (Author), Jonsson, A. (Author)
Format: Article
Language:English
Published: MIT Press Journals 2022
Subjects:
Computational linguistics
Data set
Evaluation strategies
Forestry
Integer-N
Natural language processing systems
Original algorithms
Search spaces
Software toolkits
State-of-the-art algorithms
Tree automata
Trees (mathematics)
Tropical semiring
Weighted tree
Online Access:View Fulltext in Publisher

Internet

View Fulltext in Publisher

Similar Items