The idea is related to recursive descent parsing, where you attempt to parse certain things, and if those things fail, you try again. There are ways to match in a fuzzy way using Levenshtein distance.