match.pairs: Match most similar pairs for trial generation in a subset of...
In aggloeckner/GerNameR: Collection of German names and validated associations

Description Usage Arguments Details Examples

This function matches pairs of names based on similarity to create a set of trials. Names are matched, such that each name is only used once and the sum of the distances over all names in total is minimized.

1	match.pairs(n1, n2, ...)

n1

First subset of the names used in pairing

n2

Second subset of the names used in pairing

...

Arguments passed on to match.split

s: The split of the names. Only the first two groups will be used, if the split contains more than two groups.

Normally the principal components are used for matching names, but other ratings can also be added and emphasized to create sets of names which are more similar along a special set of ratings.

Note: This function takes the two groups of names as separate arguments,

# Split the names according to intelligence
s <- partition.names(Intelligence)

# Further split the names randomly
low <- partition.names.random(subset=s[1], prop=c(1,1,1,1))
high <- partition.names.random(subset=s[1], prop=c(1,1,1,1))

# Create sets with matching high/low intelligence names
low_low <- match.pairs(low[1], low[2])
low_high <- match.pairs(low[3], high[1])
high_low <- match.pairs(high[2], low[4])
high_high <- match.pairs(high[3], high[4])