On Tue, Sep 8, 2026, 12:24 PM Peter Vollan <[email protected]> wrote:
> There is a program called NUMWRD which finds words in phone numbers, but > it just generates every possible letter combination. Is there any way to > run it against a dictionary? > Long answer... That seems relatively hard because of the size of the English language and the small size of the model t's memory. There is at least one spell check for the model t's but I think it stores its dictionary on disk. So I think you would need probably a combination of compression and storage beyond the main ram. You could I guess include words that are exactly 7 letters only. But most letter phone number patterns rely on dropping vowels or relaxed spelling rules. So that seems harder too. You need to determine patterns that look pronouncible even if not spelled correctly. Plus some readable phone numbers leave some digits as digits. Like 555-HELP. so even more complicated. Maybe decide on a set of rules, write a English language specification of those rules, and ask an AI to generate C or something and convert it to microsoft basic. Might have the AI do research even on the rules since I think such things already exist for other platforms. Short answer is I don't think anything like what you want exists for the model t. -- John.
