Classifier Instance:

Anchor text: bind
Target Entity: Name_binding
Preceding Context: In programming languages that support anonymous functions, fixed-point combinators allow the definition and use of anonymous recursive functions, i.e. without having to
Succeeding Context: such functions to identifiers. In this setting, the use of fixed-point combinators is sometimes called anonymous recursion. This terminology appear to be largely folklore, but it does appear in the following:
Paragraph Title: null
Source Page: Fixed-point combinator

Ground Truth Types:

|---wordnet_entity_100001740
|  |---wordnet_artifact_100021939
|  |  |---wordnet_structure_104341686
|  |  |  |---wordnet_area_102735688
|  |  |  |  |---wordnet_room_104105893
|  |  |  |  |  |---wordnet_library_103660909
|  |---yagoGeoEntity
|  |  |---wordnet_structure_104341686
|  |  |  |---wordnet_area_102735688
|  |  |  |  |---wordnet_room_104105893
|  |  |  |  |  |---wordnet_library_103660909

Predicted Types:

TypeConfidenceDecision
wordnet_artifact_100021939-2.086406279456898 0
wordnet_event_100029378-1.4545427149746935 0
wordnet_organization_108008335-2.0612294396363913 0
wordnet_person_100007846-1.5456271189003297 0
yagoGeoEntity-1.433181394929738 0
|---wordnet_entity_100001740
|  |---wordnet_artifact_100021939
|  |---wordnet_event_100029378
|  |---wordnet_organization_108008335
|  |---wordnet_person_100007846
|  |---yagoGeoEntity