Re: [revisited] similar strings
Re: [revisited] similar strings
- Subject: Re: [revisited] similar strings
- From: Feat <email@hidden>
- Date: Wed, 11 Jan 2006 14:13:58 +0100
At 12:45 -0500 2006/01/09, Walter Bushell wrote:
>See the "Dragon Book" if you don't know what that is get a comp sci major.
Ah! You mean Aho & Ulman? I hadn't thought of that one...
>Other wise doggy style
>make string1 the smaller and string2 the longer
>if string1 in string2 then done else try string1- n chars until a match is found this is your first candidate
>keeo taking characters off the other end of string1 (and try to match as above and retaining the best candidate )one by one until you equal or fewer characters in string1 with the characters lopped off than the greatest match found previously .
>Notice the result will not in general be unique.
Nice suggestion, thank you. I don't know why I was stuck in far more complex parsing methods, including occasionally searching for the reversed substring...
Your vantage point is most refreshing.
--
Jym Feat -- Paris FR 75018
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Applescript-users mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden