Subsegment match

Subsegment matches

Subsegment matches are approximate matches for subsegments of the current segment.

You can list all available Subsegment matches via:

  • F2
  • Translation menu > Segment matches > List Subsegment matches.

Relevant settings are on the Edit > Options > Memory tab:

Subsegment to Auto threshold
Looking for a fuzzy match of the source subsegment, CafeTran counts the found fragments in the target segments for the given source subsegment. When the occurrence count reaches the defined number called the ‘Threshold Number’, the program will send this target language fragment to the Auto-assembling function as the translation of the source language subsegment. You can set this Threshold Number in this field.
Subsegment to Virtual threshold
In this field, you may define the occurrence threshold as above. When this occurrence number is reached, CafeTran sets the found target language fragment as the constant translation of the given subsegment, thus avoiding complex text analysis when the subsegment occurs again. This target language fragment is placed in the virtual memory to be retrieved quickly when necessary. This number determines how many hits CT needs for a subsegment guess to be treated as an exact subsegment match. Since this isn’t an ‘exact’ match in the full sense of the word, CT calls it a ‘virtual’ match. Note: You can lower the possibility of CT guessing incorrectly by increasing this number.
Subsegment look-up limit
Set the maximum number of the matches found for the given subsegment. When this number is reached, the program stops searching for any more matches.

There is also a setting in the Memory dialogue box:

This is the default setting appropriate for Latin based and other languages where there is a space separator between words. CafeTran analyzes source segments on a word basis and performs statistical analysis of smaller chunks called subsegments to determine their translation.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License