Abstract: Chunking is considered as one of the very important problems in Natural Language Processing. The chunking models developed so far usually are unable to extract the relationships among the chunks. In this paper, we present a typed dependency-based chunking model (TDC), which is based on stanford typed dependencies, which attains the highest f-score. Besides attaining highest f-score, unique feature of the proposed chunking model is the extraction of semantic relationships among the chunks. Hence, TDC can easily be utilized for the tasks which re...
(read more)
Topics: 
Natural language processing
Artificial intelligence