Download scripts/sample_corpus.txt from scs09/zenex-ai-project: direct link, hf CLI and curl.
- Browser
- Download file 4.49 kB
-
https://huggingface.co/datasets/scs09/zenex-ai-project/resolve/main/scripts/sample_corpus.txt
- Command line
-
hf download hf://datasets/scs09/zenex-ai-project/scripts/sample_corpus.txt
-
curl -L -o sample_corpus.txt https://huggingface.co/datasets/scs09/zenex-ai-project/resolve/main/scripts/sample_corpus.txt
4.49 kB
| The quick brown fox jumps over the lazy dog. | |
| A journey of a thousand miles begins with a single step. | |
| To be or not to be, that is the question. | |
| The only way to do great work is to love what you do. | |
| Hello world! This is a sample training corpus for the local LLM. | |
| Python is a high-level, general-purpose programming language. | |
| JavaScript is the language of the web. | |
| Rust gives you memory safety without garbage collection. | |
| Go is designed for concurrency and simplicity. | |
| The mitochondria is the powerhouse of the cell. | |
| def hello_world(): | |
| print("Hello, world!") | |
| def fibonacci(n): | |
| if n < 2: | |
| return n | |
| return fibonacci(n - 1) + fibonacci(n - 2) | |
| class Animal: | |
| def __init__(self, name): | |
| self.name = name | |
| def speak(self): | |
| raise NotImplementedError | |
| class Dog(Animal): | |
| def speak(self): | |
| return f"{self.name} says Woof!" | |
| import torch | |
| from torch import nn | |
| model = nn.Linear(10, 1) | |
| optimizer = torch.optim.Adam(model.parameters(), lr=1e-3) | |
| The transformer architecture revolutionized natural language processing. | |
| Attention is all you need. | |
| Mixture of experts models scale efficiently. | |
| DeepSeek V3 uses 256 experts with top-8 routing. | |
| Multi-head latent attention compresses the KV cache. | |
| RoPE provides relative position information. | |
| Cosine learning rate schedules work well for large models. | |
| AdamW optimizer with beta1=0.9 beta2=0.95 is standard. | |
| Gradient clipping at 1.0 prevents instability. | |
| Cross entropy loss is the standard objective for language modeling. | |
| Checkpointing every 1000 steps saves training progress. | |
| The roses are red, the violets are blue. | |
| Sugar is sweet and so are you. | |
| Twinkle twinkle little star, how I wonder what you are. | |
| Up above the world so high, like a diamond in the sky. | |
| Mary had a little lamb, its fleece was white as snow. | |
| Everywhere that Mary went, the lamb was sure to go. | |
| The cat sat on the mat. The dog ran in the park. | |
| Children play in the garden. Birds sing in the trees. | |
| The sun rises in the east and sets in the west. | |
| Water boils at one hundred degrees Celsius at sea level. | |
| Light travels faster than sound through a vacuum. | |
| The Earth orbits around the Sun in an elliptical path. | |
| Photosynthesis converts sunlight into chemical energy. | |
| DNA is the blueprint of life encoded in four letters. | |
| Newton discovered the laws of motion and gravity. | |
| Einstein proposed the theory of relativity. | |
| The speed of light is approximately three hundred thousand kilometers per second. | |
| Quantum mechanics describes the behavior of subatomic particles. | |
| The universe is approximately fourteen billion years old. | |
| Black holes have such strong gravity that not even light can escape. | |
| The Milky Way is our home galaxy containing billions of stars. | |
| The Pythagorean theorem states a squared plus b squared equals c squared. | |
| The derivative measures the instantaneous rate of change. | |
| The integral computes the area under a curve. | |
| Linear algebra studies vectors matrices and linear transformations. | |
| Probability theory quantifies uncertainty in random events. | |
| Statistics analyzes data to draw meaningful conclusions. | |
| Machine learning algorithms learn patterns from training data. | |
| Deep neural networks can approximate any continuous function. | |
| Backpropagation computes gradients through the chain rule. | |
| Stochastic gradient descent optimizes parameters iteratively. | |
| Convolutional networks excel at image recognition tasks. | |
| Recurrent networks model sequential data like text and speech. | |
| Transformers use self-attention to process sequences in parallel. | |
| Large language models are trained on trillions of tokens. | |
| Tokenization breaks text into smaller subword units. | |
| Byte pair encoding is a popular tokenization algorithm. | |
| Word embeddings represent words as dense vectors. | |
| Cosine similarity measures the angle between two vectors. | |
| Softmax converts logits into probability distributions. | |
| ReLU activation outputs zero for negative inputs. | |
| Layer normalization stabilizes training of deep networks. | |
| Dropout randomly zeros activations to prevent overfitting. | |
| Adam combines momentum and adaptive learning rates. | |
| Learning rate warmup helps training stability. | |
| Mixed precision training uses lower precision to save memory. | |
| Gradient accumulation simulates larger batch sizes. | |
| Distributed training scales across multiple GPUs and nodes. | |
| Data parallelism replicates the model across devices. | |
| Pipeline parallelism splits the model into stages. | |
| Tensor parallelism splits individual layers across devices. | |
| Expert parallelism distributes mixture of experts layers. | |