normalize_string: Helper functions for calculating cognitive complexity.

In acss: Algorithmic Complexity for Short Strings

Helper functions for calculating cognitive complexity.

Description

normalize_string takes a character vector and normalizes its input using the symbols 0, 1, 2...9. count_class takes a character vector and an integer alphabet (with the restriction that the number of different symbols in the character vector doesn't exceed alphabet) and returns the total number of strings that are equivalent to the input when normalized and considering alphabet. alternations returns the number of alternations of symbols in a string.

Usage

normalize_string(string)

count_class(string, alphabet)

alternations(string, proportion = FALSE)

Arguments

string	character vector containing the to be analyzed strings (can contain multiple strings).
alphabet	numeric, the number of possible symbols (not necessarily actually appearing in string).
proportion	boolean, indicating if the result from alternation should be given as a proportion (between 0 and 1) or the raw number of alternations (default is FALSE correpsonding to raw values).

Details

nothing yet.

Value

normalize_string

A normalized vector of strings of the same length as string.

count_class

A vector of the same length as string with the number of possible equivalent strings when string is normalized and considering alphabet.

alternations

A vector with the number (or proprtion) of alternations of the same length as string

Examples

#normalize_string:
normalize_string(c("HUHHEGGTE", "EGGHHU"))

normalize_string("293948837163536")

# count_class
count_class("010011",2)

count_class("332120",4)

count_class(c("HUHHEGGTE", "EGGHHU"), 5)
count_class(c("HUHHEGGTE", "EGGHHU"), 6)

# alternations:
alternations("0010233")
alternations("0010233", proportion = TRUE)

alternations(c("HUHHEGGTE", "EGGHHU"))
alternations(c("HUHHEGGTE", "EGGHHU"), proportion = TRUE)

acss documentation built on June 8, 2025, 1:24 p.m.