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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MIT Press Journals
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |