Quich search algorithm for alphabets

Question

what I want is to apply some filter patterns to search the data. For example. There is a large physical table in the database regarding medicines,

I want to allow search even if user write lasix, lasixx, lasixxx, lasax, lasi, lisax.

Data should be retrieved for the medicine lasix.

After fetching data from sql server table, we have implemented some logic in c# to identify/ bring the data as per above search criteria. ( lasix, lasixx, lasixxx, lasax, lasi, lisax. )

which data structure and algorithm can be more efficient if I use c#?

Current data structure is Dictionary. What can be best for it in achieving quick search