{"ast_node_type":"other","tokens":[{"end":61,"kind":"keyword","start":0,"text":"//"}]}
        // We'll try to detect 4 different types of mistakes:
        // The algorithm here is inspired by levenshtein distance and longest common subsequence.
        // - An extra parameter has been provided that doesn't satisfy *any* of the other inputs