This problem involves calculating FastText embeddings for a given list of words. **Example:** Given a list of words ['apple', 'banana', 'cherry'], calculate their FastText embeddings. **Constraints:** The input list will contain at most 100 words, and each word will be at most 20 characters long.
Test Cases
Test Case 1
Input:
['apple', 'banana', 'cherry']Expected:
[[0.1, 0.2, 0.3], [0.4, 0.5, 0.6], [0.7, 0.8, 0.9]]Test Case 2
Input:
['dog', 'cat', 'mouse']Expected:
[[0.11, 0.22, 0.33], [0.44, 0.55, 0.66], [0.77, 0.88, 0.99]]+ 3 hidden test cases