作者: Kamran Kowsari , Maryam Yammahi , Nima Bari , Roman Vichr
DOI: 10.14569/IJACSA.2015.060313
关键词: Theoretical computer science 、 K-SVD 、 Computer science 、 Binary Golay code 、 Hamming distance 、 Reference table 、 Word (computer architecture) 、 Hash table 、 Time complexity 、 Data structure 、 Algorithm
摘要: searching through a large volume of data is very critical for companies, scientists, and engines applications due to time complexity memory complexity. In this paper, new technique generating FuzzyFind Dictionary text mining was introduced. We simply mapped the 23 bits English alphabet into or more than by using Dictionary, reflecting presence absence particular letters. This representation preserves closeness word distortions in terms created binary vectors within Hamming distance 2 deviations. paper talks about Golay Coding Transformation Hash Table how it can be used on as technology big data. method introduced linear dictionary constant access update sets, also updating sets depends points. based only letters that each segment has bits, we have 23-bit could work with segments reference table.