RapTAT - A Rapid Text Annotation Tool

RapTAT is a Java-based tool designed to identify and optimize machine-learning methods for accelerating and/or automating free-text annotation. In the initial version of the tool, the user will train the machine-learning system by loading it with document phrases annotated with particular concepts. Once the system has processed the phrases, the tool saves a "solution" file, which represents the most probable mapping of words in a phrase to a concept.  The tool will be supplied as a series of plug-in modules for use within the GATE framework.

Once created and saved, a user can apply the solution file to two potential tasks. For one, a user can apply the solution to map phrases from novel documents to a particular concept. For example, a user might select phrases of interest within the free-text. The tool can then use the solution file to label the phrases with concepts included in the training set.

A second potential use is to evaluate training efficacy. RapTAT will evaluate how accurately a trained solution is able to map phrases to concepts within a novel set of documents. To do this, the user provides annotated phrases from a novel document set along with the mapped concepts. The system then utilizes the solution file to carry out its own mapping of the phrases to potential concepts. Finally, the tool provides the user with a summary comparing the concept mappings provided by the user to those determined by the machine-learning system.  It can also statistically evaluate the accuracy of the mappings via automated cross-validation and bootstrap analysis.

Training and evaluation of training efficacy is the intended primary use for the tool. The optimal machine learning method and settings may vary depending on the nature of documents to be annotated. Because of this, the RapTAT tool provides a way to determine the optimal machine learning method and settings for training and testing. The current version provides two different machine learning algorithms for use. The first is based on a naive Bayes network, and the second is based on a non-naive, sequential Bayes network.

0
0
1
302
1727
University of Pittsburgh
14
4
2025
14.0

Normal
0

false
false
false

EN-US
JA
X-NONE

/* 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-parent:"";
mso-padding-alt:0in 5.4pt 0in 5.4pt;
mso-para-margin:0in;
mso-para-margin-bottom:.0001pt;
mso-pagination:widow-orphan;
font-size:10.0pt;
font-family:Cambria;
mso-ascii-font-family:Cambria;
mso-ascii-theme-font:minor-latin;
mso-hansi-font-family:Cambria;
mso-hansi-theme-font:minor-latin;
mso-fareast-language:JA;}

 
 
-->