tfa.text.crf_decode_backward
Stay organized with collections
Save and categorize content based on your preferences.
Computes backward decoding in a linear-chain CRF.
tfa.text.crf_decode_backward(
inputs: tfa.types.TensorLike
,
state: tfa.types.TensorLike
) -> tf.Tensor
Args |
inputs
|
A [batch_size, num_tags] matrix of
backpointer of next step (in time order).
|
state
|
A [batch_size, 1] matrix of tag index of next step.
|
Returns |
new_tags
|
A [batch_size, num_tags]
tensor containing the new tag indices.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2022-06-03 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]