Scoring - implement score based on length of gaps between matched letter?

[raghur]

So this is a suggestion/question. The readme indicates that

The matched character is adjacent to a previous match.

This works in the following case - search string of blog

However, if I now type rpy so that the search string is blogrpy then

In this case, the first match has all the characters - but its obvious that it's of lesser quality.

I'm not sure how the adjacency scoring is implemented but could do something with sum of number of letters between matches? Something which has a higher number of letters between matched chars gets a lower score.

[raghur]

Invalid - there was some other sort function applying