| 摘要 |
In a method of, and apparatus for validating character sequences, for example strings of characters generated by keyboards or keypads in telephone systems, computers, and the like, increased speed and reduced memory requirements are achieved by comparing the characters with a database representing valid sequences of characters, the database comprising one or more segments each comprising valid character sequences. A potential range of characters is extrapolated from a character of the input character sequence taking into account possible values of possible succeeding characters. This potential range of sequences is than compared with a database segment. If there is intersection between the potential range and one of the valid character sequences, and there is no succeeding character in the input character sequence, the input character sequence is determined to be valid. If intersection exists and there is a succeeding character, a second potential range of sequences that is a subset of the first-mentioned potential range of sequences is extrapolated from the succeeding character. This second potential range of sequences is compared with the database to determine whether or not there is intersection between the second potential range of sequences and a the valid character sequence range. When the step of determining intersection has been performed for each character in the input sequence, the input character sequence is indicated to be complete.
|
