Abstract
This paper describes a string encoding algorithm, which produces sparse dis-tributed representations (SDR) of text data. In essence, this is a modified version of a prior algorithm and the modifications have the following benefits: - the ability to decode data, without loss of information; - greatly increased capacity of the encoding space; - the possibility of performing more detailed comparisons of encoded strings. The main disadvantage compared to the prior algorithm is the increased complexity of the procedure for encoded string comparison. This is due to the use of a four-dimensional encoding space, instead of a two-dimensional space.
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.
