GitHunt
PI

pierrelabendzki/Text_Complexity

Technique to quantify textual complexity based on Kolmogorov complexity and implemented with PyLZMA compression.

Text_Complexity

Quantify textual complexity based on Kolmogorov complexity and implemented with PyLZMA compression.

This works by losslessly compressing integrally longer text sequences (character by character) and taking the derivative as a measure of local information input.

total3

Languages

Jupyter Notebook94.6%Python5.4%

Contributors

MIT License
Created October 18, 2023
Updated October 10, 2024
pierrelabendzki/Text_Complexity | GitHunt