String matching technique(s) by converting to number? -


I have different length strings that are filled with base 64 characters. In fact, they are in audiovisual dots song-to-song Are different.

To easily compare those strings, I divide them into 16-four sub-strings. (Which is about 1 second of a song) but in some cases, I can not compare these people from head to head. I should measure them.

For example, compare ' HelloHollohellu ' and 'Code with hallohellohelloo and' hallohellohelloo 'for example. > This SarreelloHello 'Comparison

is an algorithm or theoretical


Edit: Sorry, I'm new here :) And I can not explain myself. Here are some comments which will make me clear and present an idea.

Note 1:

In fact, I know about the distance between Levenschatin, but the problem is that every time I compare two strings , I have to make comparative matrix and find the process slow. If I can change Hello to 4444 and Halo in 4443, for example, I can determine how many records I have for 'Hello' by indexing numerical values.

Note 2:

Maybe I should set the base constant-length strings as the index value for the string And store remote values ​​from them. This is just an idea !!

The distance of Levenshatin might help you:

It is usually very fast, and even so That are applicable in most modern languages.


Comments

Popular posts from this blog

c# - ListView onScroll event -

PHP - get image from byte array -

Linux Terminal Problem with Non-Canonical Terminal I/O app -