Mode length of a sentence The task is simple. You are given a string with alphabetical words (say &quot;Hello world, this are tests&quot;). You have to return the mode of the lengths of words in the string. In this case, output is 5, as it's the most often length of words in the string.
Definition of an alphabetical word (for this challenge): a string that consists of a-zA-Z only.
Sample I/O:
Constraints: Input has atleast one word, and a unique mode. Max. length is provided in last test case. Also, the string would be a single line, no newline chars.
(In = Out format)
&quot;Hello world, this are tests&quot;                     =  5
&quot;Hello    world, this... are tests&quot;               =  5
&quot;I&quot;                                               =  1
&quot;Let's box (ง︡'-'︠)ง&quot;                               =  3
&quot;Writing some ✍(◔◡◔) program&quot;                   =  7
&quot;the-the-the-then&quot;                                =  3
&quot;Gooooooooogle is an app&quot;                         =  2
&quot;()&lt;&gt;a+/sentence$#@(@with::many---_symbols{}|~~&quot;  =  4
&quot;anot_her test actually&quot;                          =  4

The unicode tests are optional.
1000 words string = 5 (Password: PXuCdMj5u65vwst)
This is a code-golf, so fewest bytes will win!
05AB1E, 10 9 7 bytes
-1 byte inspired by Jonathan Allans Jelly answer.
-2 bytes thanks to Kevin Cruijssen!
Input is a list of characters.
aγO0K.M

Try it online!
Commented:
aγO0K.M     implicit input       [&quot;a&quot;,&quot;b&quot;,&quot; &quot;,&quot;c&quot;,&quot;d&quot;,&quot; &quot;,&quot;e&quot;,&quot;.&quot;]

a           is_alpha (vectorizes)[1, 1, 0, 0, 1, 1, 0, 1, 0]
 γ          split into chunks of equal elements
              [[1, 1], [0, 0], [1, 1], [0], [1], [0]]
  O         sum the lists        [2, 0, 2, 0, 1, 0]
   0K       remove 0's
     .M     mode                 2

            implicit output      2

a is implemented as Regex.match?(~r/^[a-zA-Z]+$/, to_string(x)), which should be equivalent to the challenge specification.
I feel like there has to be a shorter way to remove 0s from a list than ʒĀ}.