Natural Language Processing

Let Botie see adjacent pairs

BOTIE

Separate the words, then build overlapping pairs. Botie needs neighbouring words together while preserving their order.
Ready to test
0 passed · 0 failed · 1 not run

An empty floor. Start with the information your machine needs.

Received result

Your answer will arrive here.

Examples, experiments and workspace controls
Live values

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.

Start at an output arrow, then click or drag to an input. Drag empty space to pan. Delete removes a selection. Ctrl/Cmd+Z undoes a change.
Context for this challenge

Separate the words, then build overlapping pairs. Botie needs neighbouring words together while preserving their order.

Botie's individual word counts lose the identity of neighbouring words. Overlapping pairs can preserve a small amount of order and context.

Split the sentence into words, then slide a two-word window by one word at a time.

Examples and results
Sentence
the cat sat
Required result
[
  [
    "the",
    "cat"
  ],
  [
    "cat",
    "sat"
  ]
]
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.

The sentence repeats a word

This check uses the pieces from “Retain every adjacent word pair”.

BOTIE

Return every adjacent two-word window in order. Keep repeated words and do not remove duplicate tokens before constructing the bigrams.
Sentence
very very cold

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.

Which relationships farther apart than one word are missing from these pairs?

A fixed window retains local context while limiting the range of dependencies it can represent.

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 →
Continue the courseByte Pair Encoding →
← Learning Boundaries From Examples