Binary Term Decomposition Operation
Jump to navigation
Jump to search
A Binary Term Decomposition Operation is a Term Decomposition Operation that decomposes a Complex Term into Two segments.
- Example(s):
- [math]\displaystyle{ f }[/math]("left coronary artery”) ⇒ [left [coronary artery]].
- See: Parsing Task.
References
2001
- (Jacquemin, 2001) ⇒ Christian Jacquemin. (2001). “Spotting and Discovering Terms Through Natural Language Processing." MIT Press. ISBN:0262100851
- Binary decomposition: A term with more than two content words can generally be decomposed into binary substructures (substructures with two content words). For instance, the binary decomposition of left coronary artery is [left [coronary artery]].