# Match Score

First the distance is individually calculated for the first and last name. The distance meaning the the minimal amount of additions/removals/substitutions to transform one list of names to another, using a variation of https://en.wikipedia.org/wiki/Levenshtein_distance working on phonetic words(https://en.wikipedia.org/wiki/Metaphone) instead of letter.

## Some examples:​

"Stefan" -> "Erik" = 1 (1 Substitution, Stefan changed to Erik)

"Stefan" -> "Stefan Erik" = 1 (1 Addition, Erik appended)

"Stefan Erik" -> "Stefan" = 1 (1 Removal, Erik Removed)

"Sophia" => "Sofia" = 0 (Phonetically equal)

Full name: "Ebba Elisabeth", "Busch" => "Ebba", "Busch Thor". This would require 1 removal in the first name and an addition in the last name, hence a total distance of 2. The final score is then calculated by using the total distance in the following logarithmic function, f(x) = e^(x*-0.328), resulting in a table that looks like this:

DistanceScore
01.00
10.72
20.52
30.37
40.27
50.19
60.14
70.10

Distance is maxed out a 7, meaning the lowest possible score is 0.10.