Function similarity

pub fn similarity(a: &[String], b: &[String]) -> f32

How alike two token lists are, 0..=1: twice their longest common subsequence over their combined length. Order-aware (unlike a bag overlap) and forgiving of the “um“s a retake adds.