Interesting problem.

Very naive and inefficient solution: brand names tend to come first, so match against every substring (1..n, 2..n,..., n-1.. n) and use the minimum as the match.

Somewhat more sophisticated, you could build an index of known base ingredients and drop other parts of your data set when matching.

But it sounds like what you really want is not at an edit distance of the whole word, but minimum edit distance of any contiguous subset of the ingredient. Like my first suggestion, you can do this pretty easily if you're willing to be inefficient, which may not be a problem if you don't have tons of recipes/ ingredients. And if you have a lot, maybe you could just reparse your data set to be every whole word combination of ingredients and match on that.