This reminds me of my new compression algorithm. Start with this dictionary:
WORKMAKEDO ITS USHARDBETTFASTRONGERMORE THANHOURNEVAFTOV
Then encode each line of the lyrics as ordered pairs of start index and length values:
(0,4) (10,3)
(4,4) (10,3)
(8,2) (10,3)
(4,4) (13,4)
(17,4) (33,2)
(21,4) (33,2)
(25,4) (33,2)
(27,6) (33,2)
(35,9)
(44,4)
(45,3)
(48,3) (33,2)
(49,2) (33,2)
(51,3) (33,2)
(0,4) (10,2) (13,1)
(54,2) (33,2)
Since the dictionary is 56 characters long, this compression scheme is amenable to base64 encoding of the start-length pairs for 7-bit ASCII transmission channels, or packed binary representation for an even more compact representation.
Comments
This reminds me of my new compression algorithm. Start with this dictionary:
WORKMAKEDO ITS USHARDBETTFASTRONGERMORE THANHOURNEVAFTOV
Then encode each line of the lyrics as ordered pairs of start index and length values:
(0,4) (10,3)
(4,4) (10,3)
(8,2) (10,3)
(4,4) (13,4)
(17,4) (33,2)
(21,4) (33,2)
(25,4) (33,2)
(27,6) (33,2)
(35,9)
(44,4)
(45,3)
(48,3) (33,2)
(49,2) (33,2)
(51,3) (33,2)
(0,4) (10,2) (13,1)
(54,2) (33,2)
Since the dictionary is 56 characters long, this compression scheme is amenable to base64 encoding of the start-length pairs for 7-bit ASCII transmission channels, or packed binary representation for an even more compact representation.