14. A non-transitory computer readable medium having stored thereon instructions for translating user keywords into semantic queries the instructions comprising executable code which, when executed by at least one processor, causes the processor to: receive keywords; search the conceptual model to identify one or more concepts relevant to the keywords; transform at least a portion of the conceptual model into a connected graph; generate at least one path through the connected graph, the at least one path connecting the one or more concepts; identify and rank facets that support incremental user navigation from nodes of convergence in the at least one path, wherein the facets are generated at least in part by indexing a number of distinct values for attributes of the one or more concepts; generate at least one structured semantic query from the at least one path with the identified and ranked facets; and execute the at least one structure semantic query on a semantic repository.
14. A non-transitory computer readable medium having stored thereon instructions for translating user keywords into semantic queries the instructions comprising executable code which, when executed by at least one processor, causes the processor to: receive keywords; search the conceptual model to identify one or more concepts relevant to the keywords; transform at least a portion of the conceptual model into a connected graph; generate at least one path through the connected graph, the at least one path connecting the one or more concepts; identify and rank facets that support incremental user navigation from nodes of convergence in the at least one path, wherein the facets are generated at least in part by indexing a number of distinct values for attributes of the one or more concepts; generate at least one structured semantic query from the at least one path with the identified and ranked facets; and execute the at least one structure semantic query on a semantic repository. 18. The non-transitory computer readable medium of claim 14 , wherein each of the at least one paths is ranked based on a number of hops or edges in the path.