How do search engines look for chunks of words in their search trees? Or do they have trees made of pieces of words?

Question

Database

Type such tree nodes:
Sausage Sausage
Kolba
Kolb
Col
Co.
Somewhere
I read this about indexes in the database, in my opinion.
But Google, after all, will find sausage by "lbasa". What is it like? Or do they have some kind of dictionary with typos or something (wow, a typo of course)?
Or you can create several trees. First with whole words, and then from pieces. Well, output the result accordingly, first from the good, then from the bad.

Answer 1

if you are solving a problem, use a spell checker , it is
clear that Google can train him, but you can’t, but within reason this is enough

Answer 2

For example, N-grams.

Answer 3

N-grams, then statistics of typos and errors, then correction through the analysis of the user's behavior in the search results and on the sites to which he switched.
Here we must understand that the more information the easier it is to solve this problem. On a small site, you can solve the problem with an incorrect folding and a small number of options for errors and typos, and that's it, everything is much cooler for search engines.