It may be noted that the equivalence relation between the pixels is obtained through set operations
where an equivalence relation R over a set S can be seen as a partitioning of S into disjoint sets.
(3) Spelling checker: A spelling checkerfor a document editor is another interesting application
of sets, especially the hash table representation. A normal dictionary is maintained using hash
table representation of sets. A simple-most dictionary (Dict.) will have 26 buckets because
there are 26 alphabets in English language. Similarly, the words of a document (Doc) would
also be represented in the same fashion as sho ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.