Abstract
Dependency parsing (DP) becomes an important part of natural language processing (NLP) applications. However, most of DP methods have been developed for English language, but not for Thai language. In addition, the existing DP methods were still unsolved the problems of long and complex sentences. Therefore, this paper proposes seven Thai DP algorithms. Five different Thai DP algorithms was developed from transition-based parsing and the other two was developed from graph-based parsing. Based on Thai-PUD and English-PUD datasets, containing both long and complex sentences, the experimental results showed that all Thai DP algorithms bundled with character embedding can outperform the baselines.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
