Affordable Access

Term Extraction based on the Forward and Backward Connectivities of Candidates

Publication Date


In composite term extraction problems, it is important to extract candidates of relatively low occurrences in the corpora, with enough precision. In previous works, we have developed a method which can extract term candidates of low occurrences, using the revised classification of Japanese morphemes. In this paper, we propose a improved method considering forward and backward connective relations of candidates. Using the method, composite term candidates of less occurrences can be extracted with high precision.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

Forward and Backward Simulations:II. Timing-Based...

on Information and Computation Jan 01, 1996

Problem-based learning in sports medicine: the way...

on British Journal of Sports Medi... October 2007

Backwards and forwards.

on The Journal of emergency medic... October 2008
More articles like this..