Eg:
String 1: Can We Live (feat. Cece Rogers) [Joke Instrumental Mix]
String 2: Can We Live (feat. Cece Rogers) Joke Instrumental Mix
Match count = 53
Have read this: Character match count between strings in perl
Want to do this pythonically.
Asked
Active
Viewed 435 times
0
Community
- 1
- 1
Nicholas Rogers
- 109
- 1
- 8
-
1What you have tried so far ? – Nishant Nawarkhede Jan 12 '15 at 15:23
-
you may want to look for Edit Distance between your strings – njzk2 Jan 12 '15 at 15:24
-
http://stackoverflow.com/questions/24572299/using-python-efficiently-to-calculate-hamming-distances ? – Marc B Jan 12 '15 at 15:24
-
Did you realize that for the referenced question, match count is **not** 53 but **33** : the question refered to same characters **in same position** ?!! – Serge Ballesta Jan 12 '15 at 15:37
1 Answers
1
To answer the question asked in your heading, you can get a count of the number of matching characters in two strings with:
In [1]: s1 = 'Can We Live (feat. Cece Rogers) [Joke Instrumental Mix]'
In [2]: s2 = 'Can We Live (feat. Cece Rogers) Joke Instrumental Mix'
In [3]: if len(s1) > len(s2): # swap strings so that s1 is shortest
.....: s1, s2 = s2, s1
.....:
In [4]: sum(c1==s2[i] for i, c1 in enumerate(s1))
Out[4]: 32
But this may not be a good enough measure of similarity for your purposes. Look into the Levenshtein distance and its implementation in the distance module instead if that is the case.
EDIT: @Veedrac is perfectly correct: a simpler, one-line solution without the swap is:
sum(c1 == c2 for c1, c2 in zip(s1, s2))
(zip ignores items in the longer sequence).
xnx
- 24,509
- 11
- 70
- 109
-
Or just `sum(c1 == c2 for c1, c2 in zip(s1, s2))` without the swapping stuff. Heck, even just `sum(map(eq, s1, s2))` with `from operator import eq`. – Veedrac Jan 12 '15 at 16:43