The expected input keys are stored and used to compare against the keys found in the user-provided input YAML file. The Levenshtein distance algorithm is used to determine which of the expected key words is closest to the provided one, and recommended to the user as a correction.
The expected input keys are stored and used to compare against the keys found in the user-provided input YAML file. The Levenshtein distance algorithm is used to determine which of the expected key words is closest to the provided one, and recommended to the user as a correction.