The solution of two problems on bound polysemy (Q1827754)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2083704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The solution of two problems on bound polysemy |
scientific article; zbMATH DE number 2083704 |
Statements
The solution of two problems on bound polysemy (English)
0 references
6 August 2004
0 references
Bound graph
0 references
Poset
0 references
Polysemy
0 references
Polysemic pair
0 references
Clique
0 references
0.9085071682929992
0 references
0.8698906302452087
0 references
0.7715595364570618
0 references
0.7714078426361084
0 references
