We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is calculated as the product of the probabilities of all its segments, where each segment is modeled using existing tools such as recurrent neural networks. Since the segmentation of a sequence is usually unknown in advance, we sum over all valid segmentations to obtain the final probability for the sequence. An efficient dynamic programming algorithm is developed for forward and backward computations without resorting to any approximation. We demonstrate our approach on text segmentation and speech recognition tasks. In addition to quantitative results, we also show that our approach can discover meaningful segments in their respective application contexts.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1702.07463")
get_code_for_paper("1702.07463")
have("1702.07463")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1702.07463.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1702.07463)
Connect an agent — have() is free.