Abstract
This article proposes two modifications of a new unsupervised method of word segmentation consisting of three phases: Evaluation, Selection, and Adjustment (ESA), which was presented in our early paper. Lowest Relative Value (LRV) is the core algorithm in ESA The whole method has only one parameter (the exponent in LRV) that can be approximately predicted by the empirical formulae. In this article, we further evaluate one of the empirical formulae on SIGHAN Bakeoff-3 dataset. And we correct the formula for the better prediction. Additionally, we modify another part of the LRV and demonstrate how the part alleviates the sparse data problem. Meanwhile, the results indicate that the modified ESA can produce better results than the original ESA and other methods.
Sign-in/Register to access full text options 
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.
