]> 2012-05-27T21:38:11-04:00 Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies Jesse Weaver As_presented,_I_do_not_think_that_'''ContextMatch'''_would_be_capable_of_handling_non-disjoint_subclasses_in_the_expected_manner._It_also_wouldn't_seem_to_handle_individuals_whose_most_specific_class_are_not_leaves. Line 3 in the algorithm presented in Table 1 iterates over all of '''disjoint''' subclasses of class ''v''. What if class ''v'' has subclasses that are not disjoint? How would it handle this condition? Also, line 9 of the same algorithm uses a threshold τ. What value of τ is used in the second experiment (generating contextual mappings)? Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies Question for the Presentation Jesse Weaver Question asked by Question asked Joshua A. Taylor Question answered by Question answer Presentation Questions