1. A method, comprising: reading, via a processor from a displaced-read memory offset address adjusted relative to word-aligned memory operations of a memory access system that utilizes word-aligned address boundaries within a memory, a split data word from the memory comprising a portion of each of two word-aligned data words stored by the memory access system within the memory using the word-aligned memory operations at two of the word-aligned address boundaries within the memory, where reading the split data word from the displaced-read memory offset address comprises a first level of a two-level memory search; comparing the portions of each of the two word-aligned data words within the split data word with corresponding portions of a word-aligned search pattern; determining that a potential complete match for the word-aligned search pattern exists within at least one of the two word-aligned data words based upon an identified match of at least one of the portions of the two word-aligned data words within the split data word with a corresponding at least one portion of the word-aligned search pattern; iterating processing of the first level of the two-level memory search through the memory; performing a second level of the two-level memory search in response to each determined potential complete match for the word-aligned search pattern, comprising: reading, in response to determining that the potential complete match for the word-aligned search pattern exists within the at least one of the two word-aligned data words, at least one complete data word from a word-aligned address boundary at which the at least one of the two word-aligned data words is stored within the memory, where reading the at least one complete data word from the word-aligned address boundary at which the at least one of the two word-aligned data words is stored within the memory comprises the second level of the two-level memory search of the two word-aligned data words: comparing the at least one complete data word with the word-aligned search pattern; and determining whether a complete data word match for the word-aligned search pattern exists within the at least one of the two word-aligned data words based upon the comparison of the at least one complete data word with the word-aligned search pattern; where the two-level memory search comprises a specified memory search address range, and further comprising: determining whether an odd number of word-aligned data words within the specified memory search address range results in a single word-aligned data word at an end of the specified memory search address range that has not been processed; reading, in response to determining that the odd number of word-aligned data words within the specified memory search address range results in the single word-aligned data word at the end of the specified memory search address range that has not been processed, a complete data word from a word-aligned address at which the single word-aligned data word is stored within the memory; comparing the complete data word with the word-aligned search pattern; and determining whether the complete data word match for the word-aligned search pattern exists within the single word-aligned data word based upon the comparison of the complete data word with the word-aligned search pattern.