Syntactic sensitive complexity for symbol-free sequence
classification
💻 cs.AI
keywords
complexitysequencetextanomalyappliedconstructdataderives
read the original abstract
This work uses the L-system to construct a tree structure for the text sequence and derives its complexity. It serves as a measure of structural complexity of the text. It is applied to anomaly detection in data transmission.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.