The instruction examples are very poor. The errors don't show the input so it's a guess game to understand what they precisely expect... I've spend way more time trying to understand how they want us to "cut" the words than actually work on the solution... I hope they will clarify the examples!

Clarifying that ' alone does not count as a word would be nice.
Overall, it was a fun and interesting kata.

done

https://docs.codewars.com/training/troubleshooting#print-input

you need to print your input and debug your code. your code fails examples that are in the description, e.g. for " //wont won't won't " you return the list ["won't", "wont", " "]. A bug in your code is not a kata issue please ask questions when you need help

In C# version numerous sample tests work in other environments, but fail here. In one of the tests I would be told it expected "aa" but my code returned "a". I then out of curiosity fixed it so my code would return "aa", for it to then fail, telling me my response should have been "a".

print the input

I need the string of this test. It's not in the test area.

"Fixed Tests
expected [ 'a', '', 'of' ] to deeply equal [ 'a', 'of', 'on' ]"

Thank you

Lua translation!

for test "e e e e DDD ddd DdD: ddd ddd aa aA Aa, bb cc cC e e e"
Exist differents solution that are correct according to the descrption. Not only --> ["e", "ddd", "aa"]
the same for test "'a 'A 'a' a'A' a'a'!"
if we are considering the order on the answers ["'a", "a'a'", "'a'"] or ["a'a'", "'a", "'a'"] i think we can also consider to have ["a'a'", "'a'", "'a"]

Error I've got:

Incorrect match: words not present in the string.

Your output: gmrfmwngmrfmwn, gmrfmwn, gmrfmwngmrfmwngmrfmwn.

One possible valid answer: gmrfmwn, dzt, rvjqefen

Expected: True

But was: False

There is no info in the Kata description that I should also look for a substring, because this is how I understand this error:

"gmrfmwngmrfmwn" - this should count as two occurances of "gmrfmwn"

"gmrfmwngmrfmwngmrfmwn" this should count as three occurances of "gmrfmwn"

same

I would have liked more clarification on ' not counting as a word (as suggested by the test case)

The assumptions mention "A word is a string of letters (A to Z) optionally containing one or more apostrophes (') in ASCII."

So it seems like "'" would be a valid word -- the string of letters is the empty string, and optionally contains an apostrophe

After seeing solution it appears instructions are quite poor and solution matches values like this one : '''won''twon't''' … (!?)
Random test says its faulty and doesn’t provide the value under test, only expected result.