Skip to main content

Recycle tool

The Recycle tool queries a content memory (Memory) for each block's source text and pre-fills the target with the best match. It tries an exact match first, then a fuzzy match above a configurable threshold, recording the match score and type (exact or fuzzy) on the block. It requires a target language and a content-memory provider; without a content memory the tool has nothing to leverage.

Whether a match is written into the target is governed by a fill threshold and an "only if empty" option, so high-confidence matches can be applied while weaker ones are recorded but left for review. A no-query threshold lets the tool skip the content-memory lookup when an existing candidate already scores high enough. Optionally, all leveraged matches can be written to a TMX file.

IDrecycle
SourceBuilt-in
Categorytranslation
Cardinalitybilingual
Requirestarget-language, tm
Tagstranslation, l10n

Parameters

ParameterTypeDefaultDescription
downgradeIdenticalBestMatchesbooleanfalseReduce score by 1%% when multiple identical exact matches are returned
fillIfTargetIsEmptybooleanfalseFill the target only when it has no existing content
fillTargetbooleantrueCopy the best translation candidate into the target content
fillTargetThresholdinteger95Minimum match score required to fill the target
fuzzyThresholdinteger70Minimum score for fuzzy matches (0-100)
makeTmxbooleanfalseCreate a TMX file with all leveraged matches
noQueryThresholdinteger101Skip content-memory query if existing candidate scores at or above this value (101 = always query)
tmxPathstringFile path for the generated TMX document

Configure it live

Configuration
Loading form…

Examples

Apply only high-confidence matches

Fill the target from matches scoring 95 or above.

fillTarget: true
fillTargetThreshold: 95

Leverage and export to TMX

Lower the fuzzy threshold and write matches to a TMX file.

fuzzyThreshold: 60
makeTmx: true
tmxPath: ./leverage.tmx

Processing notes

  • Operates on translatable blocks with a non-empty source; other parts pass through unchanged.

  • Exact matches are tried before fuzzy matches; the match score and type are recorded as block properties.

  • With a structure-aware content-memory provider, matching runs against the block's inline-code structure and fills carry the matched entry's runs, so markup placeholders survive the fill; a 100% match means text and structure agree.

  • Ambiguous matches (several full-score entries with differing targets) are recorded but never fill the target — the choice surfaces for review instead of being picked by storage order.

Limitations

  • Requires a target language and a content-memory provider; with no Memory there is nothing to leverage.

← Back to the Tool Reference