If L is a constant function, the inexact computation of the expected F-score runs in linear time and the overall decoding algorithm in quadratic time.
if L = 1 the approximate expected F-score is equal to the F-score of the MAP hypothesis, and the modified inference algorithm reduces to a variant of Viterbi decoding.