We investigate the compression sensitivity [Akagi et al., 2023] of lex-parse [Navarro et al., 2021] for two operations: (1) single character edit and (2) modification of the alphabet ordering, and give tight upper and lower bounds for both operations. For both lower bounds, we use the family of Fibonacci words. For the bounds on edit operations, our analysis makes heavy use of properties of the Lyndon factorization of Fibonacci words to characterize the structure of lex-parse.

翻译：我们研究了Lex-parse[Navarro等人，2021]在两种操作下的压缩敏感性[Akagi等人，2023]：(1)单字符编辑；(2)字母序修改，并给出了两种操作的紧致上界与下界。下界证明均采用斐波那契词族。对于编辑操作界值的分析，我们充分利用斐波那契词的Lyndon分解性质，刻画了Lex-parse的结构特征。