namotco wrote:
>
Let's say I want to search some text for "abc123". However, we know
people can make typos and so they could have entered avc123 or abc223 or
sbc123 or bc123 many other combinations...
So I want to search for those possibilities as well. So how would I go
about creating the pr
On Dec 16, 2007 2:21 PM, namotco <[EMAIL PROTECTED]> wrote:
> Let's say I want to search some text for "abc123". However, we know
> people can make typos and so they could have entered avc123 or abc223
> or sbc123 or bc123 many other combinations...
> So I want to search for those possibilities as
> However much depends on the actual data and the variations that you are
> expecting.
>
> If you are searching for words like those used in the English language
> then you may want to look at how spell checking software works.
>
Seems related to the algorithm like `find the longest common sub
seq
Seems it's related to a more general question stated as `Given 2
sequences, find longest common sub sequence'. Many algorithm books
have materials about this one.
-Todd
--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
http://learn.perl.org/
On Sunday 16 December 2007 11:21, namotco wrote:
>
> Let's say I want to search some text for "abc123". However, we know
> people can make typos and so they could have entered avc123 or abc223
> or sbc123 or bc123 many other combinations...
> So I want to search for those possibilities as well. S
Let's say I want to search some text for "abc123". However, we know
people can make typos and so they could have entered avc123 or abc223
or sbc123 or bc123 many other combinations...
So I want to search for those possibilities as well. So how would I
go about creating the proper regex?
T
