Hi folks
Not really a .NET question, but I always think this is a good place to ask.
Does anyone have a favourite algorithm for determining the similarity of, or
difference between two strings? I'm looking for something that could be
considered to be quite reliable.
I have Googled quite extensively, and there is a lot on this subject, but I
am interested in people's practical experience and use of such algorithms to
help me choose a good'un.
TIA
Charles 5 5575
"Charles Law" <bl***@nowhere.com> wrote in message
news:Oq**************@TK2MSFTNGP12.phx.gbl... Hi folks
Not really a .NET question, but I always think this is a good place to
ask. Does anyone have a favourite algorithm for determining the similarity of,
or difference between two strings? I'm looking for something that could be considered to be quite reliable.
I have Googled quite extensively, and there is a lot on this subject, but
I am interested in people's practical experience and use of such algorithms
to help me choose a good'un.
TIA
Charles
Well, it depends a great deal on what you are actually trying to accomplish.
The Levenshtein Edit Distance is fairly ubiquitous and a good starting
point, especially if you are looking to get results similar to other
applications.
For my needs, modifying it to handle transpositions, double chars, and other
things significantly improve the results. Additionally, applying a
tokenization algorithm, such as MetaPhone, and then comparing the tokenized
strings might be desirable. For example to compare words that might "sound"
alike.
Reliable? In this arena, that is a very subjective thing. It means clearly
defining your needs, and most likely altering the algorithm to specifically
meet those needs. If you are trying to write a spell checker and have it
always select the right word, that simply is not going to happen. At best,
you can present the user with a list of choices, and often times even a
short list will contain some simply absurd suggestions.
Gerald
"Gerald Hernandez" <Cablewizard@sp*********@Yahoo.com> wrote in message
news:u5**************@TK2MSFTNGP14.phx.gbl... "Charles Law" <bl***@nowhere.com> wrote in message news:Oq**************@TK2MSFTNGP12.phx.gbl... Hi folks
Not really a .NET question, but I always think this is a good place to ask. Does anyone have a favourite algorithm for determining the similarity of,
or difference between two strings? I'm looking for something that could be considered to be quite reliable.
I have Googled quite extensively, and there is a lot on this subject, but I am interested in people's practical experience and use of such algorithms to help me choose a good'un.
TIA
Charles
Well, it depends a great deal on what you are actually trying to accomplish. The Levenshtein Edit Distance is fairly ubiquitous and a good starting point, especially if you are looking to get results similar to other applications. For my needs, modifying it to handle transpositions, double chars, and other things significantly improve the results. Additionally, applying a tokenization algorithm, such as MetaPhone, and then comparing the tokenized strings might be desirable. For example to compare words that might "sound" alike.
Reliable? In this arena, that is a very subjective thing. It means clearly defining your needs, and most likely altering the algorithm to specifically meet those needs. If you are trying to write a spell checker and have it always select the right word, that simply is not going to happen. At best, you can present the user with a list of choices, and often times even a short list will contain some simply absurd suggestions.
Gerald
Hi Gerald
Thanks for the response. Please ignore the previous, empty reply; finger
trouble.
I have seen the Levenshtein Edit Distance algorithm, and have some code in
VB.NET for it.
It would be nice to have an algorithm that produced a % value, in the range
0 - 100%. Perhaps by taking
(Edit Distance / Length of longest string) * 100
but I don't know if that is the best formula to produce a percentage.
I am purely interested in character-by-character similarity, and not whether
the strings sound alike. For example, a test might be
ABC vs WXYZ = 0%
PR vs RP = 50%
JKL vs JKL = 100%
Charles
"Gerald Hernandez" <Cablewizard@sp*********@Yahoo.com> wrote in message
news:u5**************@TK2MSFTNGP14.phx.gbl... "Charles Law" <bl***@nowhere.com> wrote in message news:Oq**************@TK2MSFTNGP12.phx.gbl... Hi folks
Not really a .NET question, but I always think this is a good place to ask. Does anyone have a favourite algorithm for determining the similarity of,
or difference between two strings? I'm looking for something that could be considered to be quite reliable.
I have Googled quite extensively, and there is a lot on this subject, but I am interested in people's practical experience and use of such algorithms to help me choose a good'un.
TIA
Charles
Well, it depends a great deal on what you are actually trying to accomplish. The Levenshtein Edit Distance is fairly ubiquitous and a good starting point, especially if you are looking to get results similar to other applications. For my needs, modifying it to handle transpositions, double chars, and other things significantly improve the results. Additionally, applying a tokenization algorithm, such as MetaPhone, and then comparing the tokenized strings might be desirable. For example to compare words that might "sound" alike.
Reliable? In this arena, that is a very subjective thing. It means clearly defining your needs, and most likely altering the algorithm to specifically meet those needs. If you are trying to write a spell checker and have it always select the right word, that simply is not going to happen. At best, you can present the user with a list of choices, and often times even a short list will contain some simply absurd suggestions.
Gerald
Hmm...
In this case, it would help to clarify the PR vs RP = 50%. How are you
coming up with that value? The obvious might be to treat this as one
transposition. If you get your hands on a Levenshtein algorithm that
implements transpositions as well, then you might be able to use something
like:
NumChars = Length of Longest String
Changes = Edit Distance
(NumChars - Changes) / NumChars = %
Gerald
"Charles Law" <bl***@nowhere.com> wrote in message
news:%2***************@TK2MSFTNGP09.phx.gbl... Hi Gerald
Thanks for the response. Please ignore the previous, empty reply; finger trouble.
I have seen the Levenshtein Edit Distance algorithm, and have some code in VB.NET for it.
It would be nice to have an algorithm that produced a % value, in the
range 0 - 100%. Perhaps by taking
(Edit Distance / Length of longest string) * 100
but I don't know if that is the best formula to produce a percentage.
I am purely interested in character-by-character similarity, and not
whether the strings sound alike. For example, a test might be
ABC vs WXYZ = 0% PR vs RP = 50% JKL vs JKL = 100%
Charles
"Gerald Hernandez" <Cablewizard@sp*********@Yahoo.com> wrote in message news:u5**************@TK2MSFTNGP14.phx.gbl... "Charles Law" <bl***@nowhere.com> wrote in message news:Oq**************@TK2MSFTNGP12.phx.gbl... Hi folks
Not really a .NET question, but I always think this is a good place to ask. Does anyone have a favourite algorithm for determining the similarity
of, or difference between two strings? I'm looking for something that could be considered to be quite reliable.
I have Googled quite extensively, and there is a lot on this subject,
but I am interested in people's practical experience and use of such
algorithms to help me choose a good'un.
TIA
Charles
Well, it depends a great deal on what you are actually trying to accomplish. The Levenshtein Edit Distance is fairly ubiquitous and a good starting point, especially if you are looking to get results similar to other applications. For my needs, modifying it to handle transpositions, double chars, and other things significantly improve the results. Additionally, applying a tokenization algorithm, such as MetaPhone, and then comparing the tokenized strings might be desirable. For example to compare words that might "sound" alike.
Reliable? In this arena, that is a very subjective thing. It means
clearly defining your needs, and most likely altering the algorithm to specifically meet those needs. If you are trying to write a spell checker and have it always select the right word, that simply is not going to happen. At
best, you can present the user with a list of choices, and often times even a short list will contain some simply absurd suggestions.
Gerald
Now that I look at it again I am not sure about the PR vs RP = 50%. I was
thinking in terms of one of the characters being in the right place and the
other not. The two strings could be lined up as
PR
RP
and now the R is correct and it is just the P that is wrong. I will give
that one more thought ...
Charles
"Gerald Hernandez" <Cablewizard@sp*********@Yahoo.com> wrote in message
news:eB**************@TK2MSFTNGP12.phx.gbl... Hmm... In this case, it would help to clarify the PR vs RP = 50%. How are you coming up with that value? The obvious might be to treat this as one transposition. If you get your hands on a Levenshtein algorithm that implements transpositions as well, then you might be able to use something like: NumChars = Length of Longest String Changes = Edit Distance (NumChars - Changes) / NumChars = %
Gerald
"Charles Law" <bl***@nowhere.com> wrote in message news:%2***************@TK2MSFTNGP09.phx.gbl... Hi Gerald
Thanks for the response. Please ignore the previous, empty reply; finger trouble.
I have seen the Levenshtein Edit Distance algorithm, and have some code in VB.NET for it.
It would be nice to have an algorithm that produced a % value, in the range 0 - 100%. Perhaps by taking
(Edit Distance / Length of longest string) * 100
but I don't know if that is the best formula to produce a percentage.
I am purely interested in character-by-character similarity, and not whether the strings sound alike. For example, a test might be
ABC vs WXYZ = 0% PR vs RP = 50% JKL vs JKL = 100%
Charles
"Gerald Hernandez" <Cablewizard@sp*********@Yahoo.com> wrote in message news:u5**************@TK2MSFTNGP14.phx.gbl... > > "Charles Law" <bl***@nowhere.com> wrote in message > news:Oq**************@TK2MSFTNGP12.phx.gbl... >> Hi folks >> >> Not really a .NET question, but I always think this is a good place to > ask. >> >> Does anyone have a favourite algorithm for determining the similarity of, > or >> difference between two strings? I'm looking for something that could >> be >> considered to be quite reliable. >> >> I have Googled quite extensively, and there is a lot on this subject, but > I >> am interested in people's practical experience and use of such algorithms > to >> help me choose a good'un. >> >> TIA >> >> Charles > > Well, it depends a great deal on what you are actually trying to > accomplish. > The Levenshtein Edit Distance is fairly ubiquitous and a good starting > point, especially if you are looking to get results similar to other > applications. > For my needs, modifying it to handle transpositions, double chars, and > other > things significantly improve the results. Additionally, applying a > tokenization algorithm, such as MetaPhone, and then comparing the > tokenized > strings might be desirable. For example to compare words that might > "sound" > alike. > > Reliable? In this arena, that is a very subjective thing. It means clearly > defining your needs, and most likely altering the algorithm to > specifically > meet those needs. If you are trying to write a spell checker and have > it > always select the right word, that simply is not going to happen. At best, > you can present the user with a list of choices, and often times even a > short list will contain some simply absurd suggestions. > > Gerald > >
This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Bosconian |
last post by:
I'm looking for a method to compare two strings and grade them for
similarity.
My idea is to strip out common words and punctuation and create a checksum
of each remaining string. I would then...
|
by: Achim Domma |
last post by:
Hi,
I have a list of lets say 100-1000 strings and want to know which one is
most similar to a reference string. Does somebody know such a library for
Python? I don't need complicated scientific...
|
by: Dick Moores |
last post by:
I need to figure out how to compute pi to base 12, to as many digits as
possible. I found this reference,
<http://mathworld.wolfram.com/Base.html>, but I really don't understand
it well enough....
|
by: Charles Law |
last post by:
Hi folks
Not really a .NET question, but I always think this is a good place to ask.
Does anyone have a favourite algorithm for determining the similarity of, or
difference between two...
|
by: Anibal Acosta |
last post by:
Somebody know an algorithm for determine the similarity between two string
for example:
string 1: "Hello what is your name?, where are you from?"
string 2: "Hello man, where are you from?"
...
|
by: Michael Howes |
last post by:
I have a single DataTable in a DataSet. It has 4 columns and i'd like to
get a handful of counts of unique items in 3 of the 4 columns.
Can a DataTables Select or Compute methods to COUNT DISTINCT?...
|
by: himoundary |
last post by:
hi all
i am using microsoft speech sdk (sapi 5.1).
i have the following requirements:
1) i need to compare current input sound (through mic) with recorded
sound file (say .wav). based of...
|
by: Ralf Goertz |
last post by:
Hi,
is there some c++ library that helps me assess the similarity of two
strings? In particular, I want to match strings that describe names of
institutions. For instance, one string could be a...
|
by: IanWright |
last post by:
I'm trying to come up with an effective assignment algorithm to allocate nodes to a nearest outlet, where each node should be have a time slot checked against the already allocated nodes for...
|
by: Jeff |
last post by:
I've got a series of data like this:
Long Sleeve White P/C Sm 32/33
Long Sleeve White P/C Med 32/33
....
What I'd like to do is extract the differences and the similarity. In
this case:
...
|
by: Charles Arthur |
last post by:
How do i turn on java script on a villaon, callus and itel keypad mobile phone
|
by: aa123db |
last post by:
Variable and constants
Use var or let for variables and const fror constants.
Var foo ='bar';
Let foo ='bar';const baz ='bar';
Functions
function $name$ ($parameters$) {
}
...
|
by: ryjfgjl |
last post by:
In our work, we often receive Excel tables with data in the same format. If we want to analyze these data, it can be difficult to analyze them because the data is spread across multiple Excel files...
|
by: BarryA |
last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
|
by: nemocccc |
last post by:
hello, everyone, I want to develop a software for my android phone for daily needs, any suggestions?
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However,...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers,...
| |