1. A method for comparing a search space character to a set of search characters to determine whether the search space character matches any character in the set of search characters, the method comprising: converting a first short binary representation of the search space character into a first long binary representation, the first long binary representation having a first bit value in a first position within the first long binary representation; converting a short binary representation of a first search character of the set of search characters into a second long binary representation; and determining that the search space character matches the first search character when a bit in the first position of the second long binary representation has a second bit value.
4. The method of claim 1 , further comprising: converting a short binary representation of a second search character of the set of search characters into a third long binary representation; and determining that the search space character matches either the first search character or the second search character when: a bit in the first position of the second long binary representation has the second bit value; or a bit in the first position of the third long binary representation has the second bit value.