Steven Bird

Sorry for not responding much earlier. I think the logic here is for programmers to be clear about the difference between lemmas and synsets. Lemmas are forms. Synsets are concepts....

I suggest dropping the recursion check, and setting the parameter regardless of whether the grammar is recursive

Thanks for the fix @asishm. How about using `map()` with a lambda argument to avoid the need to name the function, roughly like this: ``` map(lambda ..., conds) ```

@asishm Are you able to confirm that the fix works please?

Has anyone published a definitive list of stopwords for French?

[CI: retest]

Finally, sorry

Thanks @ihitamandal... great contribution. I want to maximise the interpretability of the NLTK codebase, so I would like to keep the original implementation around (minimally in documentation). More soon.

Sorry for the delay, and thanks to everyone for discussing the issues. This seems a critical shortcoming of the solution: https://github.com/nltk/nltk/pull/3349/#issuecomment-2562391768 In other words, deep copy solves a problem but...

Thanks @ekaf !