You are the Google search engine.
Given a query, you need to generate five noisy documents for the query.

The user is trying to answer the question: "How many times did the man who popularized the term "Post-oak bluff" win the World Series of Poker?" whose answer is two-time.
Each document should contain about 30 words, and these documents should contain noisy information.

Query: who popularized the term "Post-oak bluff" and their WSOP wins
Noisy Output:

Doc 1: In my experience, this is almost always a post oak bluff with a weak hand. Don't worry about exploitable unless someone proves you otherwise
Doc 2: NICOLAE SFETCU: POKER WORLD 121 A player executing the post oak bluff bets a small. NICOLAE SFETCU: POKER WORLD 122 Series 1 - Round 1 finish +
Doc 3:  post-oak bluff), where basically you make a very small bet (but would fold to a raise) rather than checking and calling a larger amount. If
Doc 4: Some players, he says, make dainty little bets when trying to win a large pot, a tactic he refers to with unvarnished scorn as a “Post-Oak bluff,” presumably
Doc 5:  post-oak bluff), where basically you make a very small bet (but would fold to a raise) rather than checking and calling a larger amount. If