Score a Game of Boggle Background
In Boggle, a round is scored by adding up the points for each unique word a player has found (i.e. any word that more than one player has found is worth 0 points). The points are calculated based on the number of letters in each word, as follows:
3 letters: 1 point
4 letters: 1 point
5 letters: 2 points
6 letters: 3 points
7 letters: 5 points
8 or more letters: 11 points
Challenge
In this challenge, write a program or function that takes in a list of lists of strings representing each player's words and outputs a list of the players' scores. You can assume that there will be at least 2 players and all words will be 3 or more letters and will all be lowercase (or all uppercase if you would prefer). You may also assume that each player will only use each word once; that is, no player's list will contain duplicates. This is code golf, so shortest answer in bytes wins.
Rules
Input can be taken in any reasonable format. Examples include a list of lists of strings, a list of comma-separated strings, a comma separated string on each line of input, etc. Output can be in the form of a list of integers (or your language's equivalent) or you can print the values to stdout using a separator of your choice (such as a newline).
Test Cases
Input =&gt; Output
[[&quot;cat&quot;,&quot;dog&quot;,&quot;bird&quot;,&quot;elephant&quot;],
 [&quot;bird&quot;,&quot;dog&quot;,&quot;coyote&quot;],
 [&quot;dog&quot;,&quot;mouse&quot;]]                 =&gt; [12,3,2]

[[&quot;abc&quot;,&quot;def&quot;,&quot;ghi&quot;],
 [&quot;ghi&quot;,&quot;def&quot;,&quot;abc&quot;]]             =&gt; [0,0]

[[&quot;programming&quot;,&quot;puzzles&quot;],
 [&quot;code&quot;,&quot;golf&quot;],
 []]                              =&gt; [16,2,0]
Husk, 21 20 19 bytes
-2 bytes thanks to Zgarb
Idea taken from A055228
ṠṀöṁ(⌈√Π-3▼8L)fε`#Σ

Try it online!
Explanation (Of older version)
            ṠṀ-oṠ-uΣ   Remove duplicated words
                   Σ   Concatenate
                  u    Remove duplicates
               oṠ-     Remove those unique elements from the list (give list of elements that appear more than once)
            ṠṀ-        Remove those words from each list in the input
m                      For each list
 ṁ(                    Map then sum
          L)           Length
        ▼8             Min(8,x)
      -3               Minus 3
     Π                 Factorial
    √                  Square root
   ⌈                   Ceiling