Need some info regarding string matching algorithms?
Try the simplest approach first - deterministic check looking for intersection overlap between the set of fruit names and the set of items bought.

Set comparisons are scalable because the look-up time for each item is constant. 

If scaling is an issue with regular set membership check, bloom filter is an option.