This question evaluates proficiency in Python programming, particularly list comprehension, string tokenization, and sequence manipulation for generating consecutive word bigrams.
Live Python exercise: generate all bigrams from an input string and iteratively optimize the solution.
Write a Python function that takes a sentence and returns a list of all consecutive word bigrams. Refactor the solution with list comprehension for conciseness. Can you further compress it into a single line? (Hint: consider using zip.)
Think of zip(s.split()[:-1], s.split()[1:]) and join/format as needed.