Right now function t9_find_words creates regular expression based on input string of numbers, and greps it over the whole dictionary. I am afraid that with bigger dictionaries it may be a bottleneck and that's why it should be implemented with a data structure best suited for the task - tire - or most prefferably with perl hashes.
Right now function t9_find_words creates regular expression based on input string of numbers, and greps it over the whole dictionary. I am afraid that with bigger dictionaries it may be a bottleneck and that's why it should be implemented with a data structure best suited for the task - tire - or most prefferably with perl hashes.