Time complexity of checking whether a string exists in a HashSet
You are right in that to check membership (or to retrieve) using a hash function, you also need to check that the retrieved element is equal to the element in question. For a string, you should assume that this takes time linear in the length.
Hence checking membership in a hash set is indeed expected $O(m)$.