Learn Before
Example

Example of a Permuted Sentence with Non-Sequential Indexing

This example demonstrates a sentence where words are indexed in a non-sequential, or permuted, order. In the sentence The5 kitten7 is6 chasing1 the4 ball2 ., the numbers do not follow the natural reading order. Instead, they specify a shuffled sequence for a language modeling task, where the model might be trained to predict words based on this permuted arrangement rather than the standard left-to-right structure.

0

1

Updated 2025-10-09

Contributors are:

Who are from:

Tags

Ch.1 Pre-training - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Related