I was reading the MySQL manual yesterday and found an interesting new feature (since 3.23.23) which is perfect for this (and other searches as well).
It's possible to match results with the function MATCH(), which does some magic internally to decide which rows to select. It orders matches by a sort of score, and each word that is in the match is given a weight based on in how many of the found rows it is found in. If the word is found in more than 50% of the rows that word will give a score of zero.
You can find more info on this
here. I didn't read everything, but it seemed very promising and I did a mental note to check on it later.
Basically, you would get the ignoring of common words without the need of a table for every possible language. It will probably be quite fast as well, since it is indexed.
