Re: Search for best matched portion of a string
From: Anil (anilby_at_gmail.com)
Date: 12/30/04
- Next message: Chris F.A. Johnson: "Re: Search for best matched portion of a string"
- Previous message: noi: "Re: korn script to clean up files older than half an hour problem (please help)"
- In reply to: Icarus Sparry: "Re: Search for best matched portion of a string"
- Next in thread: Chris F.A. Johnson: "Re: Search for best matched portion of a string"
- Reply: Chris F.A. Johnson: "Re: Search for best matched portion of a string"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 29 Dec 2004 22:15:48 -0800
>We still need more information. If you are going to drop words, do you
>always do it from the right hand end, or do you want to drop the
smallest
>number of words which makes a match?
The strings that I mentioned are just examples...may be the words can
be dropped at the start or the end.
>What characters can make up a 'word'? Is it any non-space character,
or is
>it restricted to alpha-numeric characters or just alphabetic
characters?
>Can we assume that we are dealing with ASCII, or do we need to worry
about
>Unicode?
The words are ASCII, seperated by white spaces(only) and are built of
alpha-numeric characters.
- Next message: Chris F.A. Johnson: "Re: Search for best matched portion of a string"
- Previous message: noi: "Re: korn script to clean up files older than half an hour problem (please help)"
- In reply to: Icarus Sparry: "Re: Search for best matched portion of a string"
- Next in thread: Chris F.A. Johnson: "Re: Search for best matched portion of a string"
- Reply: Chris F.A. Johnson: "Re: Search for best matched portion of a string"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]