
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book explores the problem of parsing long sentences, and Chinese is the target language. The result shows that the best performance is achieved by the algorithm using Chinese comma (algorithm 1) as the boundary of sub-sentence. It improves the overall accuracy and the accuracy on long distance dependency of the baseline parser by around 1.5% and 6.0% separately. According to the design of the parsing method, if a better baseline parser is adopted, the accuracy can be further improved according to the design of the parsing method.
This book investigates the challenges of accurately parsing long Chinese sentences and proposes an algorithmic solution. The research focuses on improving the performance of dependency parsers for the Chinese language, which presents unique difficulties due to its sentence structure. The study introduces an algorithm that utilizes Chinese commas as sub-sentence boundaries, demonstrating significant improvements in overall accuracy and long-distance dependency accuracy compared to a baseline parser.
The research presented in this book offers a specific algorithmic approach to a known problem in natural language processing: the parsing of long Chinese sentences. The findings indicate a measurable improvement over existing baseline methods, particularly in handling long-distance dependencies. The work suggests that further advancements are possible with the integration of more sophisticated baseline parsers, pointing towards continued development in the field of Chinese computational linguistics.
Page Count:
72
Publication Date:
2019-03-21
Publisher:
LAP LAMBERT Academic Publishing
ISBN-10:
3659852279
ISBN-13:
9783659852275
No comments yet. Be the first to share your thoughts!