| C90-2042 | prevent the generation of absurd | Conceptual Graphs | , pragmatic rules based on syntax |
| C90-2042 | several entries ( hence several | Conceptual Graphs | ) for one word in the semantic |
| C90-2042 | algorithm as a disambiguation tool The | Conceptual Graphs | for words are linked by an algorithm |
| C92-3131 | temporal representation using | conceptual graphs | have been designed and implemented |
| C90-2042 | rules , it links together the | Conceptual Graphs | corresponding to each word or |
| A92-1005 | dependency rule rs2 . A total of 70 | conceptual graphs | and 373 syntactic rules is used |
| C90-2042 | post-processing on the set of | Conceptual Graphs | for a text . <title></title> |
| C90-2020 | word to be defined , one or more | Conceptual Graphs | corresponding to one or more |
| C90-2042 | the syntactic tree ( s ) . The | Conceptual Graphs | for each word or loc = dion are |
| C94-1041 | underlying forrnalism is that of | conceptual graphs | , with which the reader is assumed |
| A94-1029 | Contextual roles are domain dependent | conceptual graphs | schemata ( Sowa 84 ) that are |
| A92-1005 | the compiler must find all the | conceptual graphs | that can be associated to such |
| C90-2042 | to the result . The join of two | Conceptual Graphs | forms a common overlap , while |
| A92-1005 | it is possible to find from the | conceptual graphs | the semantic constraints that |
| C90-2020 | to perform query/answering on | Conceptual Graphs | . In the present work , we consider |
| C92-3131 | to encode causal information in | conceptual graphs | so as to handle causal information |
| A92-1005 | to fol - low . Referring to the | conceptual graphs | of Fig. 3 , the conceptual relation |
| A94-1029 | measure is here triggered by ( 2 ) . | Conceptual graphs | join ( Sowa 84 ) is used to compose |
| C02-1022 | metonymic relations , Sowa 's | conceptual graphs | ( 1992 ) , in which an a priori |
| A92-1005 | knowledge associates one or more | conceptual graphs | to each grammatical relation |
