[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: [OT] Looking for a text algorithm

• To: "XML Developers List" <xml-dev@l...>
• Subject: Re: [OT] Looking for a text algorithm
• From: David Megginson <david@m...>
• Date: Sun, 9 Mar 2003 06:32:46 -0500
• In-reply-to: <00ed01c2e616$b4ac1280$4bc8a8c0@A...>
• References: <15977.64423.65785.440495@m...><00ed01c2e616$b4ac1280$4bc8a8c0@A...>

Rick Jelliffe writes:

 > The soundex and multiphone algorithms convert strings to sound
 > equivalents: a kind of multiphone algorithm is probably similar to
 > what you are looking for.  These were created to allow hashed
 > lookup up family names based on sounds, and (in the case of soundex
 > at least) work on the assumption that spelling mistakes are more
 > common later in words than earlier.

Thank you.  I am familiar with soundex, but unlike a hashing
algorithm, it does not produce a fixed-length key -- all other things
(proportion of vowels and significant clusters) being the same,
a longer string will have a longer key.


All the best,


David

-- 
David Megginson, david@m..., http://www.megginson.com/

• References:
  • [OT] Looking for a text algorithm
    • From: David Megginson <david@m...>
  • Re: [OT] Looking for a text algorithm
    • From: "Rick Jelliffe" <ricko@a...>

• Prev by Date: XML Binary and Compression
• Next by Date: Re: XML Binary and Compression
• Previous by thread: Re: XML Binary and Compression
• Next by thread: Re: [OT] Looking for a text algorithm
• Index(es):
  • Date
  • Thread