T-Rex: A Flexible Relation Extraction Framework
Iria, Mr. Jose (2005) T-Rex: A Flexible Relation Extraction Framework. 8th Annual CLUK Research Colloquium, Manchester.
Full text available as:
|PDF - Requires Adobe Acrobat Reader or other PDF viewer.|
In the wake of the explosive growth in the use of the computer as a communication device, has come a need for systems that help people cope with the sheer volume of information available. It is universally known that the Internet contains vast amounts of unstructured documents, but the same is also true for large organizations like publishing companies, government departments, airplane manufacturers, car manufacturers, and so forth. In many application domains, there is the potential to significantly increase the utility of available textual information by using automated methods for mapping parts of the unstructured text into a structured representation. This process is called Information Extraction (IE). Within IE, the task of Entity Extraction is essentially a classification problem: given a piece of text in a document, the task consists in deciding whether it fits into some entity class. The task of Relation Extraction (REX), also known as event extraction or template filling, additionally aims to establish relations between the classified entities. The top performer in the 2002 DARPA ACE evaluation got entity extraction precision and recall scores of about 80%, but binary relation extraction scores of only roughly 60%. Using a system that makes nearly one mistake out of two suggestions is hardly acceptable in real-world applications. Relation extraction is therefore a difficult open research problem, with important applications in diverse fields, such as Knowledge Management and Web Mining.
|Subjects:||AKT Challenges > Knowledge acquisition|
|Deposited By:||Norton, Mr Barry|
|Deposited On:||11 March 2005|
Contact the site administrator at: firstname.lastname@example.org