• State Suggested Answer
  • Replies 4 replies
  • Answers 2 answers
  • Subscribers 430 subscribers
  • Views 787 views
  • Users 0 members are here
Options
Related

How does TM updating for upLyft work behind the scenes?

John Narins

I'm guessing that updating a TM for upLift does NOT create new TM entries for fragments. How DOES it work then? Are fragments stored, or are there algorithms running in the background some how that find them?

Are the fragments found at the moment of upgrading permanent, or do they change with changes in the TM segments from which they were created?

I was going to ask whether you can re-upgrade with different parameters, but that's probably an invalid question - all the parameters I can set are not for the TM, they're for the project, so apparently I can set them (e.g., the minimum size/# of words/fragment) per project, which means that the upgrading works with any setting, right? With all possible settings?

If I add new TUs to an upgraded TM, the algorithm for finding fragments in the TM as a whole is automatically expanded to account for the new TUs, right?
Rate translation
×
Suggest better translation
×
Moderator UI
×
  • Get AI Suggestion
Parents
  • 0

    John Narins said:
    I'm guessing that updating a TM for upLift does NOT create new TM entries for fragments.

    You guessed wrong.  This is exactly what it does and is the main reason why the size of TM increases substantially when you do this.

    John Narins said:
    all the parameters I can set are not for the TM, they're for the project, so apparently I can set them (e.g., the minimum size/# of words/fragment) per project, which means that the upgrading works with any setting, right?

    These setting relate to how much noise you want to see with the number of returned results.  They have nothing to do with the UpLift process itself.

    John Narins said:
    If I add new TUs to an upgraded TM, the algorithm for finding fragments in the TM as a whole is automatically expanded to account for the new TUs, right?

    Right.

    Paul Filkin | RWS

    Design your own training!
    You've done the courses and still need to go a little further, or still not clear? 
    Tell us what you need in our Community Solutions Hub

  • 0 in reply to Paul Filkin

    Okay, so the upLift process extracts all the fragments its algorithm tells it MIGHT be wanted, and the per-project settings tells it how many of those to suggest. Got it.

    How do the answers to 1 and 3 go together? In other words, if the TM update DOES add fragment entries, then... it calculates them again with each new TU? This is the reason for my incorrect guess, I think you can see what I mean.

    To put it another way: how does an updated TM get new fragments as new TUs are added? Because, as I understand it, fragments come from repetitions, so a new TU by itself can't tell us whether there's a fragment worth keeping there, the algorithm is surely looking at the new TU in the context of of the whole TM, right? And then the next TU added gets analyzed taking into account the whole TM, including the previous just-added TU... how does this work?

    Thanks much!
Reply
  • 0 in reply to Paul Filkin

    Okay, so the upLift process extracts all the fragments its algorithm tells it MIGHT be wanted, and the per-project settings tells it how many of those to suggest. Got it.

    How do the answers to 1 and 3 go together? In other words, if the TM update DOES add fragment entries, then... it calculates them again with each new TU? This is the reason for my incorrect guess, I think you can see what I mean.

    To put it another way: how does an updated TM get new fragments as new TUs are added? Because, as I understand it, fragments come from repetitions, so a new TU by itself can't tell us whether there's a fragment worth keeping there, the algorithm is surely looking at the new TU in the context of of the whole TM, right? And then the next TU added gets analyzed taking into account the whole TM, including the previous just-added TU... how does this work?

    Thanks much!
Children