decode.greedy {CRF} | R Documentation |
Computing the most likely configuration for CRF
decode.greedy(crf, restart = 0, start = apply(crf$node.pot, 1, which.max))
crf |
The 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 |
Approximate decoding with greedy algorithm
This function will return the most likely configuration, which is a vector of length crf$n.nodes
.
library(CRF)
data(Small)
d <- decode.greedy(Small$crf)