Python - Most efficient way to compare # of words sequenced in "right" order across two strings/lists

Question

Hi experts,

I was wondering what the most computationally efficient Python way of cracking this problem would be.

Say you have two strings (or lists from splitting those strings--doesn't matter), "this is the right string" vs. "this is right the string."

We're assuming that the first string is always right, and a score will be assigned to the second string based on which words were sequenced in the right order. For the above two strings, we would assign a score of 0.6 (as only 3 of the 5 words are in the right position).

Best, Georgina

Answer 1

This sounds very much like homework. Try thinking about it for a bit. Would it suffice to traverse the list of correct words once, and check if the corresponding word in the second list is equal to the word in the correct list?

I would probably zip the lists in python and compare the pairs for equality.

Answer 2

a = "this is the right string"
b = "this is right the string"

sum([1 for i,v in zip(a.split(), b.split()) if i == v])

Answer 3

sum(f == s for f, s in zip(first, second)) / len(first)