Papers by Bogdan Dobre
Efficient Dependency Tree Sampling Without Replacement (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing algorithms for dependency tree sampling have been proposed for sampling without replacement. |
| Approach: | They propose an algorithm that adapts the Wilson Reject algorithm for sampling without replacement and combines it with a Trie data structure. |
| Outcome: | The proposed method is efficient in the case of sampling without replacement from dependency graphs with random weights. |