| 摘要 |
A computer analyzes a statement written in a natural language to determine the types and structure of phrases that constitute the statement. A memory stores a plurality of translation rules for different types of phrases, each rule describing how a phrase is to be translated into graphical symbol datasets and relationship link datasets. Each graphical symbol dataset specifies a graphical symbol having a content label representing its content. The content label is or includes a word contained in the pertinent phrase. Each relationship link dataset specifies a relationship link that represents a relationship between graphical symbols and has a particular end shape to indicate what type of relationship it is. The computer translates each phrase of the statement into two or more graphical symbol datasets and one or more relationship link datasets, according to the translation rules pertinent to the determined phrase types.
|
