摘要：Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Our research project is currently to develop an Automatic Concept Relation Extraction (ACRE) System which automatically extracts concepts and their relationships across texts in all domains of knowledge. Concept Relational Tree (CRT) is one of the text analyzer applications used in the ACRE System to automatically extract concepts and their relationships in a document. To check on the correctness of the extraction of concepts and their relationships, the PTree is designed to reconstruct the text by reverse input. In this paper we present the PTree tool to test the accuracy of the automatic tagging and tree structure created by CRT from texts. The PTree tool is implemented from Java Universal Network/ Graph Framework (JUNG) libraries. This tool provides a few functions to allow for flexibility in drawing parse trees for concept relationships. Due to its flexibility and dynamic features, PTree can be further extended for use in the deconstruction of highly complex texts.
