Difference between revisions of "Hyponym"
Jump to navigation
Jump to search
Haspelmath (talk | contribs) (Removing all content from page) |
(Marked as {{ref}}) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| + | A predicate ''P'' is a '''hyponym''' of another predicate ''Q'' iff ''P'' is a special case of ''Q'': | ||
| + | :For any pair of predicates P,Q:<br>for all ''x'',<br>P(x) → Q(x)<br>and<br>not (Q(x) → P(x))) | ||
| + | |||
| + | The term 'hyponym' is a [[converse]] of the term '[[hyperonym]]'. | ||
| + | |||
| + | ==Example== | ||
| + | * 'Dog' is a hyponym of 'animal'. | ||
| + | |||
| + | ===Other languages=== | ||
| + | *German [[Hyponym (de)]] | ||
| + | |||
| + | {{dc}}{{ref}} | ||
| + | [[Category:Semantics]] | ||
Latest revision as of 20:30, 3 July 2014
A predicate P is a hyponym of another predicate Q iff P is a special case of Q:
- For any pair of predicates P,Q:
for all x,
P(x) → Q(x)
and
not (Q(x) → P(x)))
The term 'hyponym' is a converse of the term 'hyperonym'.
Example
- 'Dog' is a hyponym of 'animal'.
Other languages
- German Hyponym (de)
| REF | This article has no reference(s) or source(s). Please remove this block only when the problem is solved. |
