![]() J.DepP is meant for those who want to parse massive texts (e.g., entire blog feeds or microblogs) J.DepP is even faster than most of the front-end morphological analyzer (parsing >10000 sentences per second), while achieving the state-of-the-art parsing accuracy. ![]() ![]() The inefficiency of parsers is, however, just because researchers paid attention mostly to accuracy and have not seriously pursued an efficient implementation. Syntactic parsers have been believed to be (significantly) slower than front-end part-of-speech taggers, and it is rarely utilized in industry that needs to handle massive texts (e.g., microblogs). It takes a raw sentence as input and performs word segmentation, POS tagging (thanks to MeCab), bunsetsu chunking and dependency parsing. J.DepP is a C++ implementation of Japanese dependency parsing algorithms.
0 Comments
Leave a Reply. |