Description Usage Arguments Details Value Examples
Computing the most likely configuration for CRF
1 2 3 4 5 6 7 8 | decode.block(
crf,
blocks,
decode.method = decode.tree,
restart = 0,
start = apply(crf$node.pot, 1, which.max),
...
)
|
crf |
The CRF |
blocks |
A list of vectors, each vector containing the nodes in a block |
decode.method |
The decoding method to solve the clamped CRF |
restart |
Non-negative integer to control how many restart iterations are repeated |
start |
An initial configuration, a good start will significantly reduce the seraching time |
... |
The parameters for |
Approximate decoding with the block iterated conditional modes algorithm
This function will return the most likely configuration, which is a vector of length crf$n.nodes
.
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.