Talk:Soundex: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 3: | Line 3: | ||
:A contributor to the problem is that there's no algorithm. I looked at the one on WP and it doesn't make that much sense to me. I checked the talk page and there's an alternate algorithm proposed, but it apparently doesn't cover all cases. Also, for languages without built-in soundex libraries, doing the conversion alone seems like task enough to me. --[[User:Mwn3d|Mwn3d]] 16:07, 12 November 2009 (UTC) |
:A contributor to the problem is that there's no algorithm. I looked at the one on WP and it doesn't make that much sense to me. I checked the talk page and there's an alternate algorithm proposed, but it apparently doesn't cover all cases. Also, for languages without built-in soundex libraries, doing the conversion alone seems like task enough to me. --[[User:Mwn3d|Mwn3d]] 16:07, 12 November 2009 (UTC) |
||
::Fair point about languages without soundex in libs. Maybe the other idea would be better as a task that builds on this one… –[[User:Dkf|Donal Fellows]] 16:30, 12 November 2009 (UTC) |
::Fair point about languages without soundex in libs. Maybe the other idea would be better as a task that builds on this one… –[[User:Dkf|Donal Fellows]] 16:30, 12 November 2009 (UTC) |
||
:As I understand, there are different soundex algorithms, based somewhat on the language and on the applicatons. |
:As I understand, there are different soundex algorithms, based somewhat on the language and on the applicatons. I also read the Wikipedia entry and it does not present the algorithm clearly. A couple of years ago I needed |
||
I also read the Wikipedia entry and id does not present the algorithm clearly. A couple of years ago I needed |
|||
an algorithm to match information for new entries in a database to existing names. That's when I ran across the |
an algorithm to match information for new entries in a database to existing names. That's when I ran across the |
||
soundex algorithm. --[[User:Rldrenth|Rldrenth]] 21:03, 12 November 2009 (UTC) |
soundex algorithm. --[[User:Rldrenth|Rldrenth]] 21:03, 12 November 2009 (UTC) |
||
Revision as of 21:05, 12 November 2009
Task Improvement
It's all very well to have "do soundex" as a task, but it would be far better if we had a more concrete task. For example, attempting spelling corrections on a short text using soundex matching against a supplied dictionary. Right now, it feels like this task isn't really going anywhere. –Donal Fellows 15:51, 12 November 2009 (UTC)
- A contributor to the problem is that there's no algorithm. I looked at the one on WP and it doesn't make that much sense to me. I checked the talk page and there's an alternate algorithm proposed, but it apparently doesn't cover all cases. Also, for languages without built-in soundex libraries, doing the conversion alone seems like task enough to me. --Mwn3d 16:07, 12 November 2009 (UTC)
- Fair point about languages without soundex in libs. Maybe the other idea would be better as a task that builds on this one… –Donal Fellows 16:30, 12 November 2009 (UTC)
- As I understand, there are different soundex algorithms, based somewhat on the language and on the applicatons. I also read the Wikipedia entry and it does not present the algorithm clearly. A couple of years ago I needed
an algorithm to match information for new entries in a database to existing names. That's when I ran across the soundex algorithm. --Rldrenth 21:03, 12 November 2009 (UTC)