Tokenizing a String into Words | Dataford Interview Questions

Write a function to tokenize a given string into words.

Implement def tokenize_words(text): to return a list containing each maximal contiguous sequence of alphabetic characters, preserving the original casing and order. Ignore punctuation, digits, and whitespace. Return an empty list when the input contains no alphabetic characters.

Input is a string, and output is a list of strings.

Constraints

0 <= len(text) <= 10^5
text contains Unicode characters
Words consist of maximal contiguous runs of alphabetic characters
Preserve each word's original casing

Function Signature

def tokenize_words(text):

Your question is Tokenizing a String into Words. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a function to tokenize a given string into words.

Input is a string, and output is a list of strings.

Constraints

0 <= len(text) <= 10^5
text contains Unicode characters
Words consist of maximal contiguous runs of alphabetic characters
Preserve each word's original casing

Function Signature

def tokenize_words(text):

Your question is Tokenizing a String into Words. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.