A method of providing simplified keyed access to a computer or to other electronic devices with an alphabetic display, also referred to as a "computer", the method including the use of a low order hashing code for hashing the vocabulary in the computer, then using the same hashing code to hash-code a desired word that a user wishes the computer to display; entering the hash-coded word, and comparing the desired word with vocabulary words that conform to the code. To specify a desired word from among the vocabulary words that match the hash code, the vocabulary, or portions thereof, are preferably organized as a binary tree, having the words with highest frequency of use located highest in the tree. Where a binary hashing code is used, then the alphabet is approximately halved, such as at the letter N, and a simple key code such as a Dot can be used to denote all letters in the group A through M, and a Dash can be used to denote all letters in the group N through Z. A third code element, namely a Pause, may be used to signal termination of the hash-code input. This reduces keying effort required of a user in entering a desired word in hash-code to a minimum. Extension of the method to tertiary or quaternary hash-coding makes both the coding of a desired word and its keyed entry into the computer somewhat more difficult, but can significantly speed up the word matching process, as the rate of vocabulary discard by the computer in organizing the Words matching the input code, is progressively increased. A Dot/Dash or other simple binary code may be used to "steer" the computer through the binary tree, in making the match, and a third key code, which may comprise a signalling Pause, may be used to select the desired tree item.