(s)
| 278 | based on the number of shared bigrams, e.g., "night" and "nacht" have one common bigram "ht". |
| 279 | """ |
| 280 | def bigrams(s): |
| 281 | return set(s[i:i+2] for i in range(len(s)-1)) |
| 282 | nx = bigrams(string1) |
| 283 | ny = bigrams(string2) |
| 284 | nt = nx.intersection(ny) |
no test coverage detected
searching dependent graphs…