Résumé
BECKEY is a semantic agnostic approach that discovers keys for three different semantics proposed in the context of the Semantic Web (S-key, F-key and SF-key semantics). More precisely, BECKEY discovers the complete set of minimal keys for a given semantic. This approach is able to discover keys under the presence oferroneous data or duplicates (i.e., almost keys).