Improved <i>N</i>-Best Extraction with an Evaluation on Language Data
AbstractWe 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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2022-01-01
|
| Series: | Computational Linguistics |
| Online Access: | https://direct.mit.edu/coli/article/48/1/119/108848/Improved-N-Best-Extraction-with-an-Evaluation-on |