2019-03-18 16:27:51 +00:00
|
|
|
# cython: profile=True
|
|
|
|
# coding: utf8
|
2019-03-15 15:05:23 +00:00
|
|
|
|
|
|
|
cdef class KnowledgeBase:
|
2019-03-18 16:27:51 +00:00
|
|
|
|
|
|
|
def __init__(self):
|
|
|
|
self._entry_index = PreshMap()
|
|
|
|
self._alias_index = PreshMap()
|
|
|
|
self.mem = Pool()
|
2019-03-19 15:43:23 +00:00
|
|
|
self.strings = StringStore()
|
2019-03-18 16:27:51 +00:00
|
|
|
|
2019-03-15 15:05:23 +00:00
|
|
|
def __len__(self):
|
2019-03-19 14:51:56 +00:00
|
|
|
return self.get_size_entities()
|
|
|
|
|
|
|
|
def get_size_entities(self):
|
2019-03-15 15:05:23 +00:00
|
|
|
return self._entries.size()
|
|
|
|
|
2019-03-19 14:51:56 +00:00
|
|
|
def get_size_aliases(self):
|
|
|
|
return self._aliases_table.size()
|
|
|
|
|
2019-03-18 16:27:51 +00:00
|
|
|
def add_entity(self, unicode entity_id, float prob, vectors=None, features=None):
|
2019-03-19 15:43:23 +00:00
|
|
|
cdef hash_t id_hash = self.strings.add(entity_id)
|
2019-03-18 16:27:51 +00:00
|
|
|
|
2019-03-15 15:05:23 +00:00
|
|
|
# TODO: more friendly check for non-unique name
|
2019-03-18 16:27:51 +00:00
|
|
|
if id_hash in self._entry_index:
|
2019-03-15 15:05:23 +00:00
|
|
|
return
|
|
|
|
|
2019-03-18 09:31:01 +00:00
|
|
|
cdef int32_t dummy_value = 342
|
2019-03-18 11:38:40 +00:00
|
|
|
self.c_add_entity(entity_key=id_hash, prob=prob, vector_rows=&dummy_value, feats_row=dummy_value)
|
2019-03-18 09:31:01 +00:00
|
|
|
# TODO self._vectors_table.get_pointer(vectors),
|
2019-03-18 11:38:40 +00:00
|
|
|
# self._features_table.get(features))
|
2019-03-15 15:05:23 +00:00
|
|
|
|
2019-03-18 16:27:51 +00:00
|
|
|
def add_alias(self, unicode alias, entities, probabilities):
|
2019-03-15 15:05:23 +00:00
|
|
|
"""For a given alias, add its potential entities and prior probabilies to the KB."""
|
2019-03-19 15:43:23 +00:00
|
|
|
cdef hash_t alias_hash = self.strings.add(alias)
|
2019-03-19 15:15:38 +00:00
|
|
|
cdef hash_t entity_hash
|
|
|
|
|
|
|
|
cdef vector[int64_t] entry_indices
|
|
|
|
cdef vector[float] probs
|
|
|
|
|
|
|
|
for entity, prob in zip(entities, probabilities):
|
2019-03-19 15:43:23 +00:00
|
|
|
entity_hash = self.strings.add(entity)
|
2019-03-19 15:15:38 +00:00
|
|
|
entry_index = <int64_t>self._entry_index.get(entity_hash)
|
|
|
|
entry_indices.push_back(int(entry_index))
|
|
|
|
probs.push_back(float(prob))
|
2019-03-18 11:38:40 +00:00
|
|
|
|
|
|
|
# TODO: check that alias hadn't been defined before
|
|
|
|
# TODO: check that entity is already in this KB (entity_index is OK)
|
|
|
|
# TODO: check sum(probabilities) <= 1
|
2019-03-15 15:05:23 +00:00
|
|
|
# TODO: check len(entities) == len(probabilities)
|
2019-03-18 11:38:40 +00:00
|
|
|
|
2019-03-19 15:15:38 +00:00
|
|
|
self.c_add_aliases(alias_key=alias_hash, entry_indices=entry_indices, probs=probs)
|
2019-03-18 16:27:51 +00:00
|
|
|
|
2019-03-18 16:50:01 +00:00
|
|
|
def get_candidates(self, unicode alias):
|
2019-03-19 15:43:23 +00:00
|
|
|
cdef hash_t alias_hash = self.strings.add(alias)
|
2019-03-19 14:51:56 +00:00
|
|
|
alias_index = <int64_t>self._alias_index.get(alias_hash)
|
|
|
|
return self._aliases_table[alias_index]
|
2019-03-15 15:05:23 +00:00
|
|
|
|