VibraXX
Live Quiz Arena
๐ŸŽ 1 Free Round Daily
โšก Enter Arena
Homeโ€บCategoriesโ€บLanguage & Communicationโ€บQuestion
Question
โ† Language & Communication

A morpheme-parsing algorithm encounters the word 'unbreakable' โ€“ which process explains why the algorithm correctly identifies 'break' as the root, despite the presence of multiple affixes?

A)Phonetic recoding favors vowel clusters
B)Semantic priming boosts frequent concepts
C)Lexical bracketing isolates constituent morphemesโœ“
D)Syntactic parsing anticipates word order

๐Ÿ’ก Explanation

Lexical bracketing correctly identifies 'break' because it isolates constituent morphemes based on morphological rules, parsing 'un-' and '-able' as separate affixes. Therefore, bracketing leads to correct identification, rather than phonetic or syntactic biases influencing the parsing.

๐Ÿ† Up to ยฃ1,000 monthly prize pool

Ready for the live challenge? Join the next global round now.
*Terms apply. Skill-based competition.

โšก Enter Arena

Related Questions

Browse Language & Communication โ†’