Many external correspondence files are a mix of "equal to" and "sub-class of" and "similar to" statements, which makes their use problematic. Boldly assuming that a correspondence table should always be a list of "equal to" relations (SKOS), I wonder if a semantic reasoner (https://en.wikipedia.org/wiki/Semantic_reasoner#Free_software_(open_source)) could be used to clean the correspondence files for errors. The steps would be: 1) Convert correspondence table to RDF; 2) Apply the semantic reasoner, which would then produce a list of errors to be fixed; 3) fix the errors; 4) Check manually for errors not captured by the logic reasoning.
Many external correspondence files are a mix of "equal to" and "sub-class of" and "similar to" statements, which makes their use problematic. Boldly assuming that a correspondence table should always be a list of "equal to" relations (SKOS), I wonder if a semantic reasoner (https://en.wikipedia.org/wiki/Semantic_reasoner#Free_software_(open_source)) could be used to clean the correspondence files for errors. The steps would be: 1) Convert correspondence table to RDF; 2) Apply the semantic reasoner, which would then produce a list of errors to be fixed; 3) fix the errors; 4) Check manually for errors not captured by the logic reasoning.
SETLr was suggested as possibly helpful: https://github.com/tetherless-world/setlr/wiki/SETLr-Tutorial