6. A system comprising: a computer system comprising a processor and a memory, the memory configured to store a query conceptual graph for a search query, the query conceptual graph comprising: a plurality of graph terms, a graph term representing a concept type; a plurality of conceptual relation nodes that each comprise text describing a relationship between two or more of the plurality of graph terms; and a plurality of arcs that each indicate a direction of the relationship described by the text of a corresponding conceptual relation node of the plurality of conceptual relation nodes; and logic stored in one or more tangible media and when executed by the computer system, the logic is configured to: generate the query conceptual graph; identify at least one set of conceptually similar terms for at least one graph term of the query conceptual graph, the at least one set of conceptually similar terms mapped to the corresponding concept type represented by the respective at least one graph term; and search a plurality of documents in accordance with a search query based at least in part on the query conceptual graph and on the set of conceptually similar terms; select a document from the plurality of documents as a potential match to the search query if, when the query conceptual graph is compared to a document conceptual graph for the document, there is at least one corresponding term associated with the query conceptual graph that matches at least one corresponding term associated with the document conceptual graph, wherein the corresponding term associated with each respective conceptual graph comprises at least one or more of: terms representing a concept type, and terms that are conceptually similar to the terms representing concept types; access one or more onomasticons, each onomasticon comprising a list of one or more mappings, each mapping comprising a mapping of a predetermined concept type to a corresponding set of conceptually similar terms; and validate that the potential match is a valid match if a set of conceptually similar terms of the query conceptual graph, and a set of conceptually similar terms of the document conceptual graph that is associated with the potentially marching document, maps to the same concept type in one or more onomasticons.
6. A system comprising: a computer system comprising a processor and a memory, the memory configured to store a query conceptual graph for a search query, the query conceptual graph comprising: a plurality of graph terms, a graph term representing a concept type; a plurality of conceptual relation nodes that each comprise text describing a relationship between two or more of the plurality of graph terms; and a plurality of arcs that each indicate a direction of the relationship described by the text of a corresponding conceptual relation node of the plurality of conceptual relation nodes; and logic stored in one or more tangible media and when executed by the computer system, the logic is configured to: generate the query conceptual graph; identify at least one set of conceptually similar terms for at least one graph term of the query conceptual graph, the at least one set of conceptually similar terms mapped to the corresponding concept type represented by the respective at least one graph term; and search a plurality of documents in accordance with a search query based at least in part on the query conceptual graph and on the set of conceptually similar terms; select a document from the plurality of documents as a potential match to the search query if, when the query conceptual graph is compared to a document conceptual graph for the document, there is at least one corresponding term associated with the query conceptual graph that matches at least one corresponding term associated with the document conceptual graph, wherein the corresponding term associated with each respective conceptual graph comprises at least one or more of: terms representing a concept type, and terms that are conceptually similar to the terms representing concept types; access one or more onomasticons, each onomasticon comprising a list of one or more mappings, each mapping comprising a mapping of a predetermined concept type to a corresponding set of conceptually similar terms; and validate that the potential match is a valid match if a set of conceptually similar terms of the query conceptual graph, and a set of conceptually similar terms of the document conceptual graph that is associated with the potentially marching document, maps to the same concept type in one or more onomasticons. 10. The system of claim 6 : the at least one set of conceptually similar terms comprising at least one foreign language term comprising a foreign language translation of a native language term conceptually similar to the search query.