12
edits
Changes
→Draft Matching Algorithm
function compareElements(loc, auth)
output = []
//nested loops run through values and assigns strongest matches to each element
for each element in loc
for each element in auth
strength = string distance between the two elements
if strength = 100
//if match is perfect go ahead pop each element and add their values to output array
//output array is also list of dictionaries
//0 loc="Hector", auth="Hector", strength="100"
//1 loc="Albert", auth="Alberto", strength="90"
if strength > auth element's current strength value
overwrite auth element's strength and match values
if strength > loc element's current strength value
overwrite loc element's strength and match values
//this second loop routine pulls out the strongest matches
for each item in auth
//x = some arbitrary barrier for a decent enough match
if element strength > x AND if matching element is still in the a1 list
pop each element and add their values to output array
</pre>
== Output Spec ==
