This is some #[fun|excellent|amazing] text! It makes me #[laugh|giggle|puke]!
Swaplang will create a tree representing all the possible combinations based on the sets of words inside the brackets. Alternatively, if you don’t want to waste time computing the tree (as it gets very large very quickly - the above example has nine variations [obviously]), you can have it return a random selection.
These details are provided for information only. No information here is legal advice and should not be used as such.