Towards Fully Lexicalized Dependency Parsing for Korean

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 292
  • Download : 180
We propose a Korean dependency parsing system that can learn the relationships between Korean words from the Treebank corpus and a large raw corpus. We first refine the training dataset to better represent the relationship using a different POS tagging granularity type. We also introduce lexical information and propose an almost fully lexicalized probabilistic model with case frames automatically extracted from a very large raw corpus. We evaluate and compare systems with and without POS granularity refinement and case frames. The proposed lexicalized method outperforms not only the baseline systems but also a state-of-the-art supervised dependency parser.
Publisher
ACL/SIGPARSE
Issue Date
2013-11-27
Language
English
Citation

The 13th International Conference on Parsing Technologies

URI
http://hdl.handle.net/10203/211477
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
Towards Fully Lexicalized Dependency Parsing for Korean.pdf(650.16 kB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0