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?

💡 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.

• Why does software localization for a children's app in a new country often involve significant content rewriting?
• Why does a phonological rule targeting vowels sometimes exhibit opacity despite ordered derivation?
• Why does software localization employing aggressive domestication risk reducing brand recognition in a new market?
• Why does communication degrade across a dialect continuum more rapidly when physical barriers exist?
• Why does gradient iconicity in sign language degrade grammatical consistency across diverse signing communities?
• A political candidate employs the scheme of anaphora during a speech to emphasize key policy points. Which consequence follows?