Supplemental practical concepts · MLD-0679
Longest common subsequence
The longest ordered sequence shared by two sequences, without requiring adjacent positions.
Original reference page · detailed expansion pending. Original definitions, examples, notes and citations are preserved below. New examples are illustrative, not benchmark results.
Original example
Compare text sequences in ROUGE-L-style evaluation.
Original caveat
A subsequence is not necessarily a contiguous substring.
Context and aliases
Level: Intermediate. Stages: Training · Inference · Evaluation.
Tags: ML · DL · LLM · SLM.
Aliases: LCS.
Related concepts
Concepts linking here
Original references
- Deep Learning: online textbook ↗ · Consulted
- Transformers glossary ↗ · Consulted
- OpenAI Spinning Up: reinforcement learning ↗ · Consulted
- PyTorch documentation ↗ · Reference link
- Original reference URL ↗