Re: text string approxiamtions (concept for review)

[BrowserUk]

Minor nit. As your driving for efficiency you'd be better off not copying the array each time, just get and use the reference.

my $matches = $hash_var{/^res/};

You'd still need to listify the array in order to pass it to Text::Levenshtein::distance(), but better to do it once rather than twice.

You also might need to store the whole words in the list instead of just the suffixes as that algorthm needs that. Unless you intend re-implementing your own version, in which case you could gain/save by using passing the stem and the ref to the array of suffixes.

---

Okay you lot, get your wings on the left, halos on the right. It's one size fits all, and "No!", you can't have a different color.
Pick up your cloud down the end and "Yes" if you get allocated a grey one they are a bit damp under foot, but someone has to get them.
Get used to the wings fast cos its an 8 hour day...unless the Govenor calls for a cyclone or hurricane, in which case 16 hour shifts are mandatory.
Just be grateful that you arrived just as the tornado season finished. Them buggers are real work.