Natural Language Processing
Ask whether the pair is surprising
BOTIE
Examples, experiments and workspace controls
Connect a tool's inputs to see what it produces. You can try a branch before connecting it to Result.
Try your own inputs
Use a copy of the example to try your own data. Keep the problem's assumptions in mind, and predict the effect of a change before checking the output. You can also add another branch to compare two ways of doing the calculation.
Context for this challenge
Multiply the two supplied marginal probabilities.
We want to know whether two words occur together more often than their individual frequencies would suggest. Common words can form common pairs without having a particular association. Let's construct the independent-occurrence baseline, then compare the observed pair probability with it.
Inspect the component calculation
Multiply( Value: First word probability Multiplier: Second word probability )
Examples and results
- First word probability
0.2
- Second word probability
0.25
- Required result
0.05
Try a fresh construction
This clears this draft, including its undo history. Earlier successful attempts stay recorded. Build again without opening hints to record an independent attempt.
Stuck? Inspect a worked construction
The tools below form one possible solution. You can assemble it, follow its signals, and undo that change to return to your own construction.
Assumptions and test precision
This is a small construction problem. The lesson explains the assumptions and the parts of the full method that this example leaves out. Numerical tests allow a difference of 0.001. Lists and structures must also have the right shape.
Your last tested pieces can start the full construction. An existing draft there keeps its own pieces.
A frequent pair matches its independence baseline
This check uses the pieces from “Compare a word pair with its independence baseline”.
BOTIE
- First word probability
0.5
- Second word probability
0.25
- Observed word-pair probability
0.125
Use a number, text, or an array matching the requested result. For a matrix, put each row in brackets. Saving your prediction runs your current construction on these inputs and checks the earlier examples too.
Build a construction in the workspace above first. This case will test those pieces.
Why might a very rare observed pair produce an unstable association estimate?
Probability ratios need enough supporting observations; counts and smoothing affect how much confidence to place in PMI.
This is a small construction problem. The lesson explains the assumptions and the parts of the full method that this example leaves out.
Work through the Python challenges →