k_ctc_decode | R Documentation |
Can use either greedy search (also known as best path) or a constrained dictionary search.
k_ctc_decode(
y_pred,
input_length,
greedy = TRUE,
beam_width = 100L,
top_paths = 1
)
y_pred |
tensor |
input_length |
tensor |
greedy |
perform much faster best-path search if |
beam_width |
if |
top_paths |
if |
If greedy
is TRUE
, returns a list of one element
that contains the decoded sequence. If FALSE
, returns the top_paths
most probable decoded sequences. Important: blank labels are returned as
-1
. Tensor (top_paths)
that contains the log probability of each
decoded sequence.
This function is part of a set of Keras backend functions that enable lower level access to the core operations of the backend tensor engine (e.g. TensorFlow, CNTK, Theano, etc.).
You can see a list of all available backend functions here: https://tensorflow.rstudio.com/reference/keras/index.html#backend.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.