Abstract

Front-coding is a technique used to reduce the redundancy in a representation of a dictionary, taking advantage of common prefixes. However, redundancy still exists in the front-coded representation; suffixes and infixes of words are not coded. The authors method attempts to remedy this deficiency by iteratively applying front-coding techniques to the suffixes. By applying a variant Huffman coding method, it is possible to represent the Huffman tree of suffixes in the form of another dictionary, to which the method can be iteratively applied. On large natural-language dictionaries the authors have achieved compression ratios as favourable as 11%. >

Full Text
Paper version not known

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 call

Disclaimer: 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.