diff --git a/.gitignore b/.gitignore
index 18fafb21..ac5004f3 100644
--- a/.gitignore
+++ b/.gitignore
@@ -11,4 +11,5 @@ src/main/scripts/R/.Rhistory
 !/properties/application.properties
 !/src/main/scripts/R/.RData
 .run
-venv
\ No newline at end of file
+venv
+*.png
\ No newline at end of file
diff --git a/.run/SiblingBirthOpenTriangleResolver.run.xml b/.run/SiblingBirthOpenTriangleResolver.run.xml
index 4d8fadf0..0f314b40 100644
--- a/.run/SiblingBirthOpenTriangleResolver.run.xml
+++ b/.run/SiblingBirthOpenTriangleResolver.run.xml
@@ -1,6 +1,6 @@
 <component name="ProjectRunConfigurationManager">
   <configuration default="false" name="SiblingBirthOpenTriangleResolver" type="Application" factoryName="Application" nameIsGenerated="true">
-    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolver.triangles.SiblingBirthOpenTriangleResolver" />
+    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles.SiblingBirthOpenTriangleResolver" />
     <module name="population-linkage" />
     <option name="PROGRAM_PARAMETERS" value="umea EVERYTHING" />
     <method v="2">
diff --git a/.run/SiblingDeathClusterResolver.run.xml b/.run/SiblingDeathClusterResolver.run.xml
index d02ac63e..3d67d60d 100644
--- a/.run/SiblingDeathClusterResolver.run.xml
+++ b/.run/SiblingDeathClusterResolver.run.xml
@@ -1,6 +1,6 @@
 <component name="ProjectRunConfigurationManager">
   <configuration default="false" name="SiblingDeathClusterOpenTriangleResolver" type="Application" factoryName="Application" nameIsGenerated="true">
-    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolver.cluster.SiblingDeathClusterOpenTriangleResolver" />
+    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster.SiblingDeathClusterOpenTriangleResolver" />
     <module name="population-linkage" />
     <option name="PROGRAM_PARAMETERS" value="Umea" />
     <method v="2">
diff --git a/.run/SiblingDeathTriangleResolver.run.xml b/.run/SiblingDeathTriangleResolver.run.xml
index b00d2f42..16463cbf 100644
--- a/.run/SiblingDeathTriangleResolver.run.xml
+++ b/.run/SiblingDeathTriangleResolver.run.xml
@@ -1,6 +1,6 @@
 <component name="ProjectRunConfigurationManager">
   <configuration default="false" name="SiblingDeathTriangleResolver" type="Application" factoryName="Application" nameIsGenerated="true">
-    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolver.SiblingDeathClusterOpenTriangleResolver" />
+    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolverExperiments.SiblingDeathClusterOpenTriangleResolver" />
     <module name="population-linkage" />
     <option name="PROGRAM_PARAMETERS" value="Umea umea_results" />
     <method v="2">
@@ -8,7 +8,7 @@
     </method>
   </configuration>
   <configuration default="false" name="SiblingDeathClusterOpenTriangleResolver" type="Application" factoryName="Application" nameIsGenerated="true">
-    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolver.cluster.SiblingDeathClusterOpenTriangleResolver" />
+    <option name="MAIN_CLASS_NAME" value="uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster.SiblingDeathClusterOpenTriangleResolver" />
     <module name="population-linkage" />
     <option name="PROGRAM_PARAMETERS" value="umea umea_results" />
     <method v="2">
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/BDPatternSolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/BDPatternSolver.java
deleted file mode 100644
index d537efe1..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/BDPatternSolver.java
+++ /dev/null
@@ -1,50 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import org.neo4j.driver.Session;
-import org.neo4j.driver.Transaction;
-import uk.ac.standrews.cs.neoStorr.impl.Store;
-import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
-import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthBirthSiblingAccuracy;
-
-public class BDPatternSolver {
-    public static void main(String[] args) {
-        NeoDbCypherBridge bridge = Store.getInstance().getBridge();
-        String query = "MATCH (b1:Birth)-[:SIBLING]-(d:Death),\n" +
-                "(b2:Birth)-[:SIBLING]-(d),\n" +
-                "(b1:Birth)-[:ID]-(d1:Death),\n" +
-                "(b2:Birth)-[:ID]-(d2:Death),\n" +
-                "(d)-[:SIBLING]-(d1)-[:SIBLING]-(d2)\n" +
-                "WHERE NOT (b1)-[:SIBLING]-(b2) and not (b1)-[:SIBLING]-(d1) and not (b2)-[:SIBLING]-(d2) and b1.PARENTS_YEAR_OF_MARRIAGE = b2.PARENTS_YEAR_OF_MARRIAGE\n" +
-                "MERGE (b1)-[r:SIBLING { provenance: \"bd_sol\", actors: \"Child-Child\" } ]-(b2)";
-
-        System.out.println("Before");
-        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Death");
-        new BirthBirthSiblingAccuracy(bridge);
-
-        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
-            tx.run(query);
-            tx.commit();
-        }
-
-        System.out.println("After");
-        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Death");
-        new BirthBirthSiblingAccuracy(bridge);
-    }
-}
-
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ComplexBBPattern.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ComplexBBPattern.java
deleted file mode 100644
index 183b4d1d..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ComplexBBPattern.java
+++ /dev/null
@@ -1,303 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import org.neo4j.driver.Result;
-import org.neo4j.driver.Session;
-import org.neo4j.driver.Transaction;
-import org.neo4j.driver.types.Node;
-import uk.ac.standrews.cs.neoStorr.impl.LXP;
-import uk.ac.standrews.cs.neoStorr.impl.Store;
-import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
-import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
-import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
-import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
-import uk.ac.standrews.cs.population_linkage.compositeMeasures.SumOfFieldDistances;
-import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthBirthSiblingAccuracy;
-import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
-import uk.ac.standrews.cs.population_records.RecordRepository;
-import uk.ac.standrews.cs.population_records.record_types.Birth;
-import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
-
-import java.time.LocalDate;
-import java.time.temporal.ChronoUnit;
-import java.util.*;
-import java.util.stream.Collectors;
-
-import static uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe.list;
-
-public class ComplexBBPattern {
-
-    final static int NUM_OF_CHILDREN  = 12;
-    final static int MAX_AGE_DIFFERENCE  = 20;
-    private static final String BB_SIBLING_QUERY = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:SIBLING { provenance: $prov, actors: \"Child-Child\" } ]-(b)";
-    private static final String BB_SIBLING_QUERY_DEL = "MATCH (a:Birth)-[r:SIBLING]-(b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to DELETE r";
-    private static final String BB_SIBLING_QUERY_DEL_PROV = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:DELETED { provenance: $prov, actors: \"Child-Child\" } ]-(b)";
-
-    private static NeoDbCypherBridge bridge;
-
-    //counters for predicates
-    private static int maxAgeCount = 0;
-    private static int nineMonthsCount = 0;
-    private static int badMarriageDateCount = 0;
-    private static int newLinks = 0;
-    private static int birthplaceCount = 0;
-
-    private static String[] creationPredicates = {"match_m_date"};
-    private static String[] deletionPredicates = {"max_age_range", "min_b_interval", "birthplace_mode"};
-
-    public static void main(String[] args) throws BucketException {
-        bridge = Store.getInstance().getBridge();
-        RecordRepository record_repository = new RecordRepository("umea");
-        final StringMeasure base_measure = Constants.LEVENSHTEIN;;
-        final LXPMeasure composite_measure_name = getCompositeMeasure(base_measure);
-        final LXPMeasure composite_measure_date = getCompositeMeasureDate(base_measure);
-        IBucket births = record_repository.getBucket("birth_records");
-
-        System.out.println("Before");
-        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Birth");
-        new BirthBirthSiblingAccuracy(bridge);
-
-        System.out.println("Locating triangles...");
-        List<OpenTriangleClusterBB> triangles = findIllegalBirthDeathSiblingTriangles(bridge);
-
-        System.out.println("Resolving triangles...");
-        for (OpenTriangleClusterBB triangle : triangles) {
-            for (List<Long> chain : triangle.getTriangleChain()){
-                LXP[] tempKids = {(LXP) births.getObjectById(triangle.x), (LXP) births.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))};
-                String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
-                String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
-                String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
-
-                if(Objects.equals(tempKids[0].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----") ||
-                        Objects.equals(tempKids[2].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----")){
-                    triangle.getYearStatistics();
-                    boolean hasChanged = false;
-
-                    //1. Check age of child not outside of max difference
-                    hasChanged = maxRangePredicate(triangle, tempKids, hasChanged, 0);
-
-                    //2. check DOB at least 9 months away from rest
-                    hasChanged = minBirthIntervalPredicate(triangle, tempKids, hasChanged, 1);
-
-//                    if(Objects.equals(std_id_z, "907863")){
-//                        System.out.println("fsd");
-//                    }
-
-                    //3. Get mode of birthplace
-                    hasChanged = mostCommonBirthPlacePredicate(triangle, hasChanged, tempKids, 2);
-
-                } else if (getDistance(triangle.x, chain.get(1), composite_measure_date, births) < 2) {
-                    createLink(bridge, std_id_x, std_id_z, creationPredicates[0]);
-                    newLinks++;
-                }else{
-//                    deleteLink(bridge, std_id_x, std_id_y);
-                    badMarriageDateCount++;
-                }
-            }
-        }
-
-        System.out.println("After");
-        System.out.println("Bad Marriage Date: " + badMarriageDateCount);
-        System.out.println("Max Age Difference " + maxAgeCount);
-        System.out.println("9 Months minimum " + nineMonthsCount);
-        System.out.println("Birth place " + birthplaceCount);
-        System.out.println("New links " + newLinks);
-        System.out.println("\n");
-        new PredicateEfficacy(creationPredicates, deletionPredicates, "Birth", "Birth");
-        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Birth");
-        new BirthBirthSiblingAccuracy(bridge);
-    }
-
-    private static List<OpenTriangleClusterBB> findIllegalBirthDeathSiblingTriangles(NeoDbCypherBridge bridge) {
-        final String BIRTH_SIBLING_TRIANGLE_QUERY = "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[:SIBLING]-(z:Birth)\n" +
-                "WHERE NOT (x)-[:SIBLING]-(z)\n" +
-                "RETURN x, collect([y, z]) AS openTriangles";
-        Result result = bridge.getNewSession().run(BIRTH_SIBLING_TRIANGLE_QUERY);
-        return result.stream().map(r -> {
-            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
-            List<List<Node>> openTrianglesNodes = (List<List<Node>>) r.asMap().get("openTriangles");
-
-            List<List<Long>> openTrianglesList = openTrianglesNodes
-                    .stream()
-                    .map(innerList -> innerList.stream()
-                            .map(obj -> {
-                                if (obj instanceof Node) {
-                                    return ((Node) obj).get("STORR_ID").asLong();
-                                } else {
-                                    throw new IllegalArgumentException("Expected a Node but got: " + obj.getClass());
-                                }
-                            })
-                            .collect(Collectors.toList()))
-                    .collect(Collectors.toList());
-
-            return new OpenTriangleClusterBB(x, openTrianglesList);
-        }).collect(Collectors.toList());
-    }
-
-    private static boolean maxRangePredicate(OpenTriangleClusterBB triangle, LXP[] tempKids, boolean hasChanged, int predNumber) {
-        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
-        String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
-        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
-
-        if(!Objects.equals(tempKids[0].getString(Birth.BIRTH_YEAR), "----") && Math.abs(triangle.getYearMedian() - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE){
-//                        deleteLink(bridge, std_id_x, std_id_y);
-            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber]);
-            maxAgeCount++;
-            hasChanged = true;
-        } else if (!Objects.equals(tempKids[1].getString(Birth.BIRTH_YEAR), "----") && Math.abs(triangle.getYearMedian() - Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE) {
-//                        deleteLink(bridge, std_id_z, std_id_y);
-            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber]);
-            maxAgeCount++;
-            hasChanged = true;
-        } else if (!Objects.equals(tempKids[2].getString(Birth.BIRTH_YEAR), "----") && Math.abs(triangle.getYearMedian() - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE) {
-//                        deleteLink(bridge, std_id_z, std_id_y);
-//                        deleteLink(bridge, std_id_x, std_id_y);
-            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber]);
-            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber]);
-            maxAgeCount++;
-            hasChanged = true;
-        }
-
-        return hasChanged;
-    }
-
-    //https://stackoverflow.com/a/67767630
-    private static boolean minBirthIntervalPredicate(OpenTriangleClusterBB triangle, LXP[] tempKids, boolean hasChanged, int predNumber) {
-        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
-        String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
-        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
-
-        try{
-            LocalDate dateX = LocalDate.of(Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR)), Integer.parseInt(tempKids[0].getString(Birth.BIRTH_MONTH)), Integer.parseInt(tempKids[0].getString(Birth.BIRTH_DAY)));
-            Optional<LocalDate> closestDateX = triangle.getBirthDays().stream().sorted(Comparator.comparingLong(x -> Math.abs(ChronoUnit.DAYS.between(x, dateX))))
-                    .skip(1)
-                    .findFirst();
-            if(!hasChanged && closestDateX.isPresent() && ChronoUnit.DAYS.between(closestDateX.get(), dateX) < 280 && ChronoUnit.DAYS.between(closestDateX.get(), dateX) > 2){
-//                            deleteLink(bridge, std_id_x, std_id_y);
-                deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber]);
-                nineMonthsCount++;
-                hasChanged = true;
-            }
-        }catch (Exception e){
-
-        }
-
-        try{
-            LocalDate dateZ = LocalDate.of(Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR)), Integer.parseInt(tempKids[2].getString(Birth.BIRTH_MONTH)), Integer.parseInt(tempKids[2].getString(Birth.BIRTH_DAY)));
-            Optional<LocalDate> closestDateZ = triangle.getBirthDays().stream().sorted(Comparator.comparingLong(x -> Math.abs(ChronoUnit.DAYS.between(x, dateZ))))
-                    .skip(1)
-                    .findFirst();
-            if(!hasChanged && closestDateZ.isPresent() && ChronoUnit.DAYS.between(closestDateZ.get(), dateZ) < 280 && ChronoUnit.DAYS.between(closestDateZ.get(), dateZ) > 2){
-//                            deleteLink(bridge, std_id_z, std_id_y);
-                deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber]);
-                nineMonthsCount++;
-                hasChanged = true;
-            }
-        } catch (Exception e) {
-
-        }
-
-        return hasChanged;
-    }
-
-    private static boolean mostCommonBirthPlacePredicate(OpenTriangleClusterBB triangle, boolean hasChanged, LXP[] tempKids, int predNumber) {
-        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
-        String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
-        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
-
-        if(!hasChanged && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), "") && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), triangle.getMostCommonBirthplace()) && triangle.getNumOfChildren() > 3){
-//                        deleteLink(bridge, std_id_x, std_id_y);
-            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber]);
-            birthplaceCount++;
-            hasChanged = true;
-        } else if (!hasChanged && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), "") && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), triangle.getMostCommonBirthplace()) && triangle.getNumOfChildren() > 3) {
-//                        deleteLink(bridge, std_id_z, std_id_y);
-            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber]);
-            birthplaceCount++;
-            hasChanged = true;
-        }
-
-        return hasChanged;
-    }
-
-    private static void createLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_z, String prov) {
-        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction()) {
-            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_z, prov);
-            tx.run(BB_SIBLING_QUERY, parameters);
-            tx.commit();
-        }
-    }
-
-    private static void deleteLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_y){
-        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
-            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_y);
-            tx.run(BB_SIBLING_QUERY_DEL, parameters);
-            tx.commit();
-        }
-    }
-
-    private static void deleteLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_y, String prov){
-        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
-            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_y, prov);
-            tx.run(BB_SIBLING_QUERY_DEL_PROV, parameters);
-            tx.commit();
-        }
-    }
-
-    protected static LXPMeasure getCompositeMeasure(StringMeasure base_measure) {
-        final List<Integer> LINKAGE_FIELDS_NAME = list(
-                Birth.MOTHER_FORENAME,
-                Birth.MOTHER_MAIDEN_SURNAME,
-                Birth.FATHER_FORENAME,
-                Birth.FATHER_SURNAME
-        );
-
-        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS_NAME);
-    }
-
-    protected static LXPMeasure getCompositeMeasureDate(StringMeasure base_measure) {
-        final List<Integer> LINKAGE_FIELDS = list(
-                Birth.PARENTS_DAY_OF_MARRIAGE,
-                Birth.PARENTS_MONTH_OF_MARRIAGE,
-                Birth.PARENTS_YEAR_OF_MARRIAGE
-        );
-
-        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS);
-    }
-
-    private static double getDistance(long id1, long id2, LXPMeasure composite_measure, IBucket births) throws BucketException {
-        LXP b1 = (LXP) births.getObjectById(id1);
-        LXP b2 = (LXP) births.getObjectById(id2);
-        return composite_measure.distance(b1, b2);
-    }
-
-    private static Map<String, Object> getCreationParameterMap(String standard_id_from, String standard_id_to) {
-        Map<String, Object> parameters = new HashMap<>();
-        parameters.put("standard_id_from", standard_id_from);
-        parameters.put("standard_id_to", standard_id_to);
-        return parameters;
-    }
-
-    private static Map<String, Object> getCreationParameterMap(String standard_id_from, String standard_id_to, String prov) {
-        Map<String, Object> parameters = new HashMap<>();
-        parameters.put("standard_id_from", standard_id_from);
-        parameters.put("standard_id_to", standard_id_to);
-        parameters.put("prov", prov);
-        return parameters;
-    }
-}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ComplexBDPattern.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ComplexBDPattern.java
deleted file mode 100644
index f30d63f0..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ComplexBDPattern.java
+++ /dev/null
@@ -1,286 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import org.neo4j.driver.Result;
-import org.neo4j.driver.Session;
-import org.neo4j.driver.Transaction;
-import org.neo4j.driver.types.Node;
-import uk.ac.standrews.cs.neoStorr.impl.LXP;
-import uk.ac.standrews.cs.neoStorr.impl.Store;
-import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
-import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
-import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
-import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
-import uk.ac.standrews.cs.population_linkage.compositeMeasures.SumOfFieldDistances;
-import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthBirthSiblingAccuracy;
-import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthDeathSiblingAccuracy;
-import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
-import uk.ac.standrews.cs.population_records.RecordRepository;
-import uk.ac.standrews.cs.population_records.record_types.Birth;
-import uk.ac.standrews.cs.population_records.record_types.Death;
-import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
-
-import java.time.LocalDate;
-import java.time.temporal.ChronoUnit;
-import java.util.*;
-import java.util.stream.Collectors;
-
-import static uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe.list;
-
-public class ComplexBDPattern {
-
-    final static int NUM_OF_CHILDREN  = 12;
-    final static int MAX_AGE_DIFFERENCE  = 20;
-    private static final String BB_SIBLING_QUERY = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:SIBLING { provenance: \"bde_sol\", actors: \"Child-Child\" } ]-(b)";
-    private static final String BB_SIBLING_QUERY_DEL = "MATCH (a:Birth)-[r:SIBLING]-(b:Death) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to DELETE r";
-
-    public static void main(String[] args) throws BucketException {
-        NeoDbCypherBridge bridge = Store.getInstance().getBridge();
-        RecordRepository record_repository = new RecordRepository("umea");
-        final StringMeasure base_measure = Constants.LEVENSHTEIN;;
-        final LXPMeasure composite_measure_name = getCompositeMeasure(base_measure);
-        final LXPMeasure composite_measure_date = getCompositeMeasureDate(base_measure);
-        final LXPMeasure composite_measure_bd = getCompositeMeasureBirthDeath(base_measure);
-        IBucket births = record_repository.getBucket("birth_records");
-        IBucket deaths = record_repository.getBucket("death_records");
-//        String query = "MATCH (x:Birth)-[:SIBLING]-(y:Death)-[:SIBLING]-(z:Birth)\n" +
-//                "WHERE NOT (x)-[:SIBLING]-(z) " +
-//                "and x.FATHER_FORENAME = z.FATHER_FORENAME and x.FATHER_SURNAME = z.FATHER_SURNAME " +
-//                "and x.MOTHER_FORENAME = z.MOTHER_FORENAME and x.MOTHER_MAIDEN_SURNAME = z.MOTHER_MAIDEN_SURNAME " +
-//                "and x.PARENTS_YEAR_OF_MARRIAGE <> \"\" and z.PARENTS_YEAR_OF_MARRIAGE <> \"\" and x.PARENTS_YEAR_OF_MARRIAGE = z.PARENTS_YEAR_OF_MARRIAGE " +
-//                "and x.PARENTS_MONTH_OF_MARRIAGE = z.PARENTS_MONTH_OF_MARRIAGE and x.PARENTS_DAY_OF_MARRIAGE = x.PARENTS_DAY_OF_MARRIAGE " +
-//                "and x.FATHER_FORENAME <> \"¤\" \n" +
-//                "MERGE (x)-[r:SIBLING { provenance: \"bde_sol\", actors: \"Child-Child\" } ]-(z)";
-
-        System.out.println("Before");
-        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Death");
-        new BirthBirthSiblingAccuracy(bridge);
-        new BirthDeathSiblingAccuracy(bridge);
-
-        System.out.println("Locating triangles...");
-        List<OpenTriangleCluster> triangles = findIllegalBirthDeathSiblingTriangles(bridge);
-        System.out.println("Resolving triangles...");
-        int maxAgeCount = 0;
-        int nineMonthsCount = 0;
-        int deathPlaceCount = 0;
-        int badMarriageDateCount = 0;
-        int birthplaceCount = 0;
-        for (OpenTriangleCluster triangle : triangles) {
-            for (List<Long> chain : triangle.getTriangleChain()){
-                LXP[] tempKids = {(LXP) births.getObjectById(triangle.x), (LXP) deaths.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))};
-                String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
-                String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
-                String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
-
-                if(Objects.equals(tempKids[0].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----") ||
-                        Objects.equals(tempKids[2].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----")){
-                    triangle.getYearStatistics();
-                    boolean hasChanged = false;
-
-                    //1. Check age of child not outside of max difference
-                    if(!Objects.equals(tempKids[0].getString(Birth.BIRTH_YEAR), "----") && Math.abs(triangle.getYearMedian() - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE){
-                        deleteLink(bridge, std_id_x, std_id_y);
-                        maxAgeCount++;
-                        hasChanged = true;
-                    } else if (!Objects.equals(tempKids[2].getString(Birth.BIRTH_YEAR), "----") && Math.abs(triangle.getYearMedian() - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE) {
-                        deleteLink(bridge, std_id_z, std_id_y);
-                        maxAgeCount++;
-                        hasChanged = true;
-                    } else if (!Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") && Math.abs(triangle.getYearMedian() - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))) > MAX_AGE_DIFFERENCE) {
-                        deleteLink(bridge, std_id_z, std_id_y);
-                        deleteLink(bridge, std_id_x, std_id_y);
-                        maxAgeCount++;
-                        hasChanged = true;
-                    }
-
-                    //2. check DOB at least 9 months away from rest
-                    //https://stackoverflow.com/a/67767630
-                    try{
-                        LocalDate dateX = LocalDate.of(Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR)), Integer.parseInt(tempKids[0].getString(Birth.BIRTH_MONTH)), Integer.parseInt(tempKids[0].getString(Birth.BIRTH_DAY)));
-                        Optional<LocalDate> closestDateX = triangle.getBirthDays().stream().sorted(Comparator.comparingLong(x -> Math.abs(ChronoUnit.DAYS.between(x, dateX))))
-                                .skip(1)
-                                .findFirst();
-                        if(!hasChanged && closestDateX.isPresent() && ChronoUnit.DAYS.between(closestDateX.get(), dateX) < 280 && ChronoUnit.DAYS.between(closestDateX.get(), dateX) > 2){
-                            deleteLink(bridge, std_id_x, std_id_y);
-                            nineMonthsCount++;
-                            hasChanged = true;
-                        }
-                    }catch (Exception e){
-
-                    }
-
-                    try{
-                        LocalDate dateZ = LocalDate.of(Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR)), Integer.parseInt(tempKids[2].getString(Birth.BIRTH_MONTH)), Integer.parseInt(tempKids[2].getString(Birth.BIRTH_DAY)));
-                        Optional<LocalDate> closestDateZ = triangle.getBirthDays().stream().sorted(Comparator.comparingLong(x -> Math.abs(ChronoUnit.DAYS.between(x, dateZ))))
-                                .skip(1)
-                                .findFirst();
-                        if(!hasChanged && closestDateZ.isPresent() && ChronoUnit.DAYS.between(closestDateZ.get(), dateZ) < 280 && ChronoUnit.DAYS.between(closestDateZ.get(), dateZ) > 2){
-                            deleteLink(bridge, std_id_z, std_id_y);
-                            nineMonthsCount++;
-                            hasChanged = true;
-                        }
-                    } catch (Exception e) {
-
-                    }
-
-                    //3. If place of death for death certificate and died young, assume children live in same area
-                    if(!hasChanged && !Objects.equals(tempKids[1].getString(Death.PLACE_OF_DEATH), "----") &&
-                            ((!Objects.equals(tempKids[1].getString(Death.AGE_AT_DEATH), "") && Integer.parseInt(tempKids[1].getString(Death.AGE_AT_DEATH)) < triangle.getAgeRange() / 2) ||
-                                    (Objects.equals(tempKids[1].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
-                                            Integer.parseInt(tempKids[1].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) < triangle.getAgeRange() / 2))){
-                        String potentialFamilyLocation = tempKids[1].getString(Death.PLACE_OF_DEATH);
-                        //probably need to do distance on this one
-                        if(!tempKids[0].getString(Birth.BIRTH_ADDRESS).equals(potentialFamilyLocation)){
-                            deleteLink(bridge, std_id_x, std_id_y);
-                            deathPlaceCount++;
-                            hasChanged = true;
-                        } else if (!tempKids[2].getString(Birth.BIRTH_ADDRESS).equals(potentialFamilyLocation)) {
-                            deleteLink(bridge, std_id_z, std_id_y);
-                            deathPlaceCount++;
-                            hasChanged = true;
-                        }
-                    }
-
-                    //4. Check illegitimacy
-
-//                    if(Objects.equals(std_id_x, "486023")){
-//                        System.out.println("fsd");
-//                    }
-
-                    //5. Get mode of birthplace
-                    if(!hasChanged && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), "") && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), triangle.getMostCommonBirthplace()) && triangle.getNumOfChildren() > 3){
-                        deleteLink(bridge, std_id_x, std_id_y);
-                        birthplaceCount++;
-                        hasChanged = true;
-                    } else if (!hasChanged && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), "") && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), triangle.getMostCommonBirthplace()) && triangle.getNumOfChildren() > 3) {
-                        deleteLink(bridge, std_id_z, std_id_y);
-                        birthplaceCount++;
-                        hasChanged = true;
-                    }
-
-                } else if (getDistance(triangle.x, chain.get(1), composite_measure_date, births) < 2) {
-                    try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
-                        Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_z);
-                        tx.run(BB_SIBLING_QUERY, parameters);
-                        tx.commit();
-                    }
-                }else{
-                    deleteLink(bridge, std_id_x, std_id_y);
-                    badMarriageDateCount++;
-                }
-            }
-        }
-
-        System.out.println("After");
-        System.out.println("Bad Marriage Date: " + badMarriageDateCount);
-        System.out.println("Max Age Difference " + maxAgeCount);
-        System.out.println("9 Months minimum " + nineMonthsCount);
-        System.out.println("Death place " + deathPlaceCount);
-        System.out.println("Birth place " + birthplaceCount);
-        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Death");
-        new BirthBirthSiblingAccuracy(bridge);
-        new BirthDeathSiblingAccuracy(bridge);
-    }
-
-    private static void deleteLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_y){
-        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
-            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_y);
-            tx.run(BB_SIBLING_QUERY_DEL, parameters);
-            tx.commit();
-        }
-    }
-
-    protected static LXPMeasure getCompositeMeasure(StringMeasure base_measure) {
-        final List<Integer> LINKAGE_FIELDS_NAME = list(
-                Birth.MOTHER_FORENAME,
-                Birth.MOTHER_MAIDEN_SURNAME,
-                Birth.FATHER_FORENAME,
-                Birth.FATHER_SURNAME
-        );
-
-        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS_NAME);
-    }
-
-    protected static LXPMeasure getCompositeMeasureDate(StringMeasure base_measure) {
-        final List<Integer> LINKAGE_FIELDS = list(
-                Birth.PARENTS_DAY_OF_MARRIAGE,
-                Birth.PARENTS_MONTH_OF_MARRIAGE,
-                Birth.PARENTS_YEAR_OF_MARRIAGE
-        );
-
-        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS);
-    }
-
-    protected static LXPMeasure getCompositeMeasureBirthDeath(StringMeasure base_measure) {
-        final List<Integer> LINKAGE_FIELDS_BIRTH = list(
-                Birth.MOTHER_FORENAME,
-                Birth.MOTHER_MAIDEN_SURNAME,
-                Birth.FATHER_FORENAME,
-                Birth.FATHER_SURNAME
-        );
-
-        final List<Integer> LINKAGE_FIELDS_DEATH = list(
-                Death.MOTHER_FORENAME,
-                Death.MOTHER_MAIDEN_SURNAME,
-                Death.FATHER_FORENAME,
-                Death.FATHER_SURNAME
-        );
-
-        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS_BIRTH, LINKAGE_FIELDS_DEATH);
-    }
-
-    private static List<OpenTriangleCluster> findIllegalBirthDeathSiblingTriangles(NeoDbCypherBridge bridge) {
-        final String BIRTH_SIBLING_TRIANGLE_QUERY = "MATCH (x:Birth)-[:SIBLING]-(y:Death)-[:SIBLING]-(z:Birth)\n" +
-                "WHERE NOT (x)-[:SIBLING]-(z)\n" +
-//                "AND id(x) < id(z)\n" +
-                "RETURN x, collect([y, z]) AS openTriangles";
-        Result result = bridge.getNewSession().run(BIRTH_SIBLING_TRIANGLE_QUERY);
-        return result.stream().map(r -> {
-            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
-            List<List<Node>> openTrianglesNodes = (List<List<Node>>) r.asMap().get("openTriangles");
-
-            List<List<Long>> openTrianglesList = openTrianglesNodes
-                    .stream()
-                    .map(innerList -> innerList.stream()
-                            .map(obj -> {
-                                if (obj instanceof Node) {
-                                    return ((Node) obj).get("STORR_ID").asLong();
-                                } else {
-                                    throw new IllegalArgumentException("Expected a Node but got: " + obj.getClass());
-                                }
-                            })
-                            .collect(Collectors.toList()))
-                    .collect(Collectors.toList());
-
-            return new OpenTriangleCluster(x, openTrianglesList);
-        }).collect(Collectors.toList());
-    }
-
-    private static double getDistance(long id1, long id2, LXPMeasure composite_measure, IBucket births) throws BucketException {
-        LXP b1 = (LXP) births.getObjectById(id1);
-        LXP b2 = (LXP) births.getObjectById(id2);
-        return composite_measure.distance(b1, b2);
-    }
-
-    private static Map<String, Object> getCreationParameterMap(String standard_id_from, String standard_id_to) {
-        Map<String, Object> parameters = new HashMap<>();
-        parameters.put("standard_id_from", standard_id_from);
-        parameters.put("standard_id_to", standard_id_to);
-        return parameters;
-    }
-}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/OpenTriangleCluster.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/OpenTriangleCluster.java
deleted file mode 100644
index 27a980b9..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/OpenTriangleCluster.java
+++ /dev/null
@@ -1,152 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import uk.ac.standrews.cs.neoStorr.impl.LXP;
-import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
-import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
-import uk.ac.standrews.cs.population_records.RecordRepository;
-import uk.ac.standrews.cs.population_records.record_types.Birth;
-import uk.ac.standrews.cs.population_records.record_types.Death;
-
-import java.time.LocalDate;
-import java.util.*;
-
-/**
- * Used to encode unmatched triangles with nodes x and y and z
- * x and y are xy_distance apart, y and z are yz_distance apart
- * but xz is not connected.
- * All the ids are storr ids of Nodes.
- */
-public class OpenTriangleCluster {
-    public final long x;
-    public List<List<Long>> triangleChain = new ArrayList<>();
-    private Set<LXP> children = new HashSet<LXP>();
-    Map<String, Integer> birthplaceMap = new HashMap<String, Integer>();
-    private List<LocalDate> birthDays = new ArrayList<>();
-    private double yearTotal = 0;
-    private int ageRange;
-    private double yearAvg;
-    private int yearMedian;
-    private String mostCommonBirthplace = null;
-
-    IBucket births;
-    IBucket deaths;
-
-    public OpenTriangleCluster(long x, List<List<Long>>  triangleChain) {
-        RecordRepository record_repository = new RecordRepository("umea");
-        births = record_repository.getBucket("birth_records");
-        deaths = record_repository.getBucket("death_records");
-        this.x = x;
-        this.triangleChain = triangleChain;
-    }
-
-    public String toString() {
-        return "X = " + x;
-    }
-
-    public List<List<Long>> getTriangleChain() {
-        return triangleChain;
-    }
-
-    public void getYearStatistics() throws BucketException {
-        for (List<Long> chain : triangleChain){
-            LXP[] tempKids = {(LXP) births.getObjectById(x), (LXP) deaths.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))};
-            for (int i = 0; i < tempKids.length; i++) {
-                if (!children.contains(tempKids[i])) {
-                    int year = 1850;
-                    int month = 1;
-                    int day = 1;
-                    if(i != 1){
-                        try{
-                            year = Integer.parseInt(tempKids[i].getString(Birth.BIRTH_YEAR));
-                            month = Integer.parseInt(tempKids[i].getString(Birth.BIRTH_MONTH));
-                            day = Integer.parseInt(tempKids[i].getString(Birth.BIRTH_DAY));
-                        }catch(Exception e){
-                            if(!children.isEmpty()){
-                                year = (int) Math.round(yearTotal/children.size());
-                            }
-                        }
-
-                        if(!Objects.equals(tempKids[i].getString(Birth.BIRTH_ADDRESS), "----")){
-                            birthplaceMap.merge(tempKids[i].getString(Birth.BIRTH_ADDRESS), 1, Integer::sum);
-                        }
-                    }else{
-                        try{
-                            year = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(6));
-                            month = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(3, 5));
-                            day = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(0, 2));
-                        }catch(Exception e){
-                            if(!children.isEmpty()){
-                                year = (int) Math.round(yearTotal/children.size());
-                            }
-                        }
-                    }
-                    birthDays.add(LocalDate.of(year, month, day));
-                    yearTotal += year;
-                }
-                children.add(tempKids[i]);
-            }
-        }
-
-        //https://deveshsharmablogs.wordpress.com/2013/07/16/find-most-common-element-in-a-list-in-java/
-        int maxValue = -1;
-        for(Map.Entry<String, Integer> entry: birthplaceMap.entrySet()) {
-            if(entry.getValue() > maxValue) {
-                mostCommonBirthplace = entry.getKey();
-                maxValue = entry.getValue();
-            }
-        }
-
-        Collections.sort(birthDays);
-        ageRange = birthDays.get(birthDays.size() - 1).getYear() - birthDays.get(0).getYear();
-        yearAvg = yearTotal / children.size();
-        if ((birthDays.size() % 2) == 0) {
-            yearMedian = ((birthDays.get(birthDays.size() / 2)).getYear() + (birthDays.get(birthDays.size() / 2 - 1)).getYear()) / 2;
-        }else {
-            yearMedian = birthDays.get(birthDays.size() / 2).getYear();
-        }
-    }
-
-    public void removeChain(List<Long> chain) {
-        triangleChain.remove(chain);
-    }
-
-    public int getAgeRange() {
-        return ageRange;
-    }
-
-    public double getYearAvg() {
-        return yearAvg;
-    }
-
-    public double getNumOfChildren() {
-        return children.size();
-    }
-
-    public List<LocalDate> getBirthDays() {
-        return birthDays;
-    }
-
-    public double getYearMedian() {
-        return yearMedian;
-    }
-
-    public String getMostCommonBirthplace() {
-        return mostCommonBirthplace;
-    }
-}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/PatternsCounter.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/PatternsCounter.java
deleted file mode 100644
index 53f882bf..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/PatternsCounter.java
+++ /dev/null
@@ -1,83 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import org.neo4j.driver.Result;
-import uk.ac.standrews.cs.neoStorr.impl.Store;
-import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
-
-import java.util.List;
-
-public class PatternsCounter {
-
-    final static String[] RECORD_TYPES = {"Birth", "Marriage", "Death"};
-
-    public static void main(String[] args) {
-        NeoDbCypherBridge bridge = Store.getInstance().getBridge();
-
-        for(String type1: RECORD_TYPES){
-            for(String type2: RECORD_TYPES) {
-                countOpenTrianglesToString(bridge, type1, type2);
-            }
-        }
-    }
-
-    public static void countOpenTrianglesToString(NeoDbCypherBridge bridge, String type1, String type2) {
-        int count = countOpenTriangles(bridge, type1, type2);
-        System.out.println(type1 + "-" + type2 + "-" + type1 + " triangle: " + count);
-    }
-
-    public static int countOpenTriangles(NeoDbCypherBridge bridge, String type1, String type2) {
-        String openTriangleQuery = String.format(
-                "MATCH (x:%s)-[:SIBLING]-(y:%s)-[:SIBLING]-(z:%s) " +
-                        "WHERE NOT (x)-[:SIBLING]-(z) AND id(x) < id(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)" +
-                        "RETURN count(DISTINCT [x, z]) as cluster_count",
-                type1, type2, type1
-        );
-
-        Result result = bridge.getNewSession().run(openTriangleQuery);
-        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
-
-        long count = 0;
-        if (!clusters.isEmpty()) {
-            count = clusters.get(0);
-        }
-
-        return (int) count;
-    }
-
-    //wont work for resolver cuz no deleted
-    public static int countOpenTriangles(NeoDbCypherBridge bridge, String type1, String type2, double threshold) {
-        int count = countOpenTriangles(bridge, type1, type2);
-        String openTriangleQuery = String.format(
-                "MATCH (x:%1$s)-[s:SIBLING]-(y:%2$s)-[r:SIBLING]-(z:%1$s), (x)-[t:SIBLING]-(z)  " +
-                        "WHERE id(x) < id(z) AND r.distance <= %3$s AND s.distance <= %3$s AND t.distance > %3$s " +
-                        "RETURN count(DISTINCT [x, z]) as cluster_count",
-                type1, type2, threshold
-        );
-
-        Result result = bridge.getNewSession().run(openTriangleQuery);
-        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
-
-        long tCount = 0;
-        if (!clusters.isEmpty()) {
-            tCount = clusters.get(0);
-        }
-
-        return count + (int) tCount;
-    }
-}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/PredicateEfficacy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/PredicateEfficacy.java
deleted file mode 100644
index 293c05d6..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/PredicateEfficacy.java
+++ /dev/null
@@ -1,64 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import org.neo4j.driver.Result;
-import uk.ac.standrews.cs.neoStorr.impl.Store;
-import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
-
-import java.util.List;
-
-public class PredicateEfficacy {
-    private String CREATED_LINKS_QUERY_TRUE = "MATCH (x:%1$s)-[r:SIBLING]-(y:%2$s) WHERE r.provenance = \"%3$s\" AND (x:%1$s)-[:GT_SIBLING]-(y:%2$s) RETURN count(r) as cluster_count";
-    private String DELETED_LINKS_QUERY_TRUE = "MATCH (x:%1$s)-[r:DELETED]-(y:%2$s) WHERE r.provenance = \"%3$s\" AND NOT (x:%1$s)-[:GT_SIBLING]-(y:%2$s) RETURN count(r) as cluster_count";
-    private String LINKS_QUERY_TOTAL_CREATED = "MATCH (x:%s)-[r:SIBLING]-(y:%s) WHERE r.provenance = \"%s\" RETURN count(r) as cluster_count";
-    private String LINKS_QUERY_TOTAL_DELETED = "MATCH (x:%s)-[r:DELETED]-(y:%s) WHERE r.provenance = \"%s\" RETURN count(r) as cluster_count";
-
-    public PredicateEfficacy(String[] toCreate, String[] toDelete, String recordType1, String recordType2){
-        NeoDbCypherBridge bridge = Store.getInstance().getBridge();
-
-        System.out.println("Created");
-        for (String s : toCreate) {
-            Result result = bridge.getNewSession().run(String.format(CREATED_LINKS_QUERY_TRUE, recordType1, recordType2, s));
-            List<Long> trueMatches = result.list(r -> r.get("cluster_count").asLong());
-            result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_CREATED, recordType1, recordType2, s));
-            List<Long> total = result.list(r -> r.get("cluster_count").asLong());
-
-            if (!trueMatches.isEmpty() && !total.isEmpty()) {
-                long trueCount = trueMatches.get(0);
-                long totalCount = total.get(0);
-
-                System.out.println(s + " " + trueCount + "/" + totalCount + " " + trueCount / totalCount);
-            }
-        }
-
-        System.out.println("\nDeleted");
-        for (String s : toDelete) {
-            Result result = bridge.getNewSession().run(String.format(DELETED_LINKS_QUERY_TRUE, recordType1, recordType2, s));
-            List<Long> trueMatches = result.list(r -> r.get("cluster_count").asLong());
-            result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_DELETED, recordType1, recordType2, s));
-            List<Long> total = result.list(r -> r.get("cluster_count").asLong());
-
-            if (!trueMatches.isEmpty() && !total.isEmpty()) {
-                long trueCount = trueMatches.get(0);
-                long totalCount = total.get(0);
-
-                System.out.println(s + " " + trueCount + "/" + totalCount + " " + trueCount / totalCount);
-            }
-        }
-    }
-}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ThresholdTrianglesAnalysis.java b/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ThresholdTrianglesAnalysis.java
deleted file mode 100644
index a2c55ab3..00000000
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/ThresholdTrianglesAnalysis.java
+++ /dev/null
@@ -1,81 +0,0 @@
-/*
- * Copyright 2022 Systems Research Group, University of St Andrews:
- * <https://github.com/stacs-srg>
- *
- * This file is part of the module population-linkage.
- *
- * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
- * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
- * version.
- *
- * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
- * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
- * <http://www.gnu.org/licenses/>.
- */
-package uk.ac.standrews.cs.population_linkage.aleks;
-
-import org.neo4j.driver.Result;
-import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
-import uk.ac.standrews.cs.utilities.ClassificationMetrics;
-
-import java.io.FileWriter;
-import java.io.IOException;
-import java.io.PrintWriter;
-import java.util.HashMap;
-import java.util.Map;
-
-public class ThresholdTrianglesAnalysis {
-
-    private static final String BIRTH_BIRTH_SIBLING_TPC = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE (b1)-[:GT_SIBLING {actors: \"Child-Child\"}]-(b2) AND r.distance <= $threshold return count(r)";
-    private static final String BIRTH_BIRTH_SIBLING_FPC = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:GT_SIBLING {actors: \"Child-Child\"}]-(b2) AND r.distance <= $threshold return count(r)";
-    private static final String BIRTH_BIRTH_SIBLING_FNC = "MATCH (b1:Birth)-[r:GT_SIBLING { actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
-    private static final String BIRTH_BIRTH_SIBLING_FNC_T = "MATCH (b1:Birth)-[r:GT_SIBLING { actors: \"Child-Child\"}]->(b2:Birth), (b1)-[s:SIBLING]-(b2) WHERE s.distance > $threshold return count(r)";
-
-    double[] recall = new double[101];
-    double[] precision = new double[101];
-    double[] fmeasure = new double[101];
-    int[] triangles = new int[101];
-
-    public static void main(String[] args) {
-        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
-
-        try (FileWriter fileWriter = new FileWriter("birthbirthhalfplusv2.csv");
-             PrintWriter printWriter = new PrintWriter(fileWriter)) {
-            printWriter.println("threshold,precision,recall,fmeasure,triangles");
-
-            System.out.println("Analysing thresholds...");
-            for (double i = 0.0; i <= 1.0; i+=0.01) {
-                double threshold = Math.round(i * 100.0) / 100.0;
-                System.out.println(threshold);
-//                long fpc = doQuery(BIRTH_BIRTH_SIBLING_FPC, threshold, bridge);
-//                long tpc = doQuery(BIRTH_BIRTH_SIBLING_TPC, threshold, bridge);
-//                long fnc = doQuery(BIRTH_BIRTH_SIBLING_FNC, threshold, bridge) + doQuery(BIRTH_BIRTH_SIBLING_FNC_T, i, bridge);
-                long fpc = 1L;
-                long tpc = 1L;
-                long fnc = 1L;
-
-//                recall[(int) (i*100)] = ClassificationMetrics.recall(tpc, fnc);
-//                precision[(int) (i*100)] = ClassificationMetrics.precision(tpc, fpc);
-//                fmeasure[(int) (i*100)] = ClassificationMetrics.F1(tpc, fpc, fnc);
-//                triangles[(int) (i*100)] = PatternsCounter.countOpenTriangles(bridge, "Birth", "Birth", i);
-
-                printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d%n", threshold, ClassificationMetrics.precision(tpc, fpc), ClassificationMetrics.recall(tpc, fnc), ClassificationMetrics.F1(tpc, fpc, fnc), PatternsCounter.countOpenTriangles(bridge, "Birth", "Birth", i));
-            }
-
-        }catch (IOException e){
-            e.printStackTrace();
-        }
-
-        System.out.println("Done!");
-    }
-
-    protected static long doQuery(String query_string, double threshold, NeoDbCypherBridge bridge) {
-        Map<String, Object> parameters = new HashMap<>();
-        parameters.put("threshold", threshold);
-        Result result = bridge.getNewSession().run(query_string, parameters);
-        return (long) result.list(r -> r.get("count(r)").asInt()).get(0);
-    }
-
-}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/DistanceDistributionAnalysis.java b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/DistanceDistributionAnalysis.java
new file mode 100644
index 00000000..6efbc83a
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/DistanceDistributionAnalysis.java
@@ -0,0 +1,134 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.analysis;
+
+import org.neo4j.driver.Result;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+
+import java.io.FileWriter;
+import java.io.PrintWriter;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class DistanceDistributionAnalysis {
+
+    private static final String BIRTH_SIBLING_TRIANGLE = "MATCH (x:Birth)-[r:SIBLING]-(y:Birth)-[s:SIBLING]-(z:Birth)\n" +
+            "WHERE NOT (x)-[:SIBLING]-(z) AND id(x) < id(z)\n" +
+            "RETURN r.distance + s.distance as cluster_sum, \n" +
+            "EXISTS((x)-[:GT_SIBLING]-(z)) as has_GT_SIBLING";
+
+    private static final String BIRTH_SIBLING_TRIANGLE_2 = "MATCH (x:Birth)-[r:SIBLING]-(y:Birth)-[s:SIBLING]-(z:Birth)\n" +
+            "WHERE NOT (x)-[:SIBLING]-(z)\n" +
+            "RETURN x, collect([r.distance, s.distance, EXISTS((x)-[:GT_SIBLING]-(z))]) AS openTriangles";
+
+    public static void main(String[] args) {
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        getSumFreq(bridge);
+        getMaxAndAvgFreq(bridge);
+    }
+
+    /**
+     * Method to get average and max distances for a cluster
+     *
+     * @param bridge
+     */
+    private static void getMaxAndAvgFreq(NeoDbCypherBridge bridge) {
+        try (FileWriter fileWriter = new FileWriter("birthbirthtri2.csv");
+             PrintWriter printWriter = new PrintWriter(fileWriter)) {
+            printWriter.println("average_distance,max_distance,has_GT_SIBLING,link_num");
+
+            Result result = bridge.getNewSession().run(BIRTH_SIBLING_TRIANGLE_2);
+            result.stream().forEach(r -> {
+                List<List<Object>> collection = (List<List<Object>>) r.asMap().get("openTriangles");
+                double maxDis = 0;
+                boolean maxLink = false;
+                double avgDistance = 0;
+                int triCount = 0;
+
+                //loop through each cluster
+                for (List<Object> record : collection) {
+                    double sumDistances = 0;
+                    try{
+                        double rDistance = (double) record.get(0);
+                        double sDistance = (double) record.get(1);
+                        boolean hasLink = (boolean) record.get(2); //check if FPOT or FNOT
+
+                        sumDistances = rDistance + sDistance;
+                        avgDistance += sumDistances;
+                        triCount++;
+
+                        //update max if sum above current number
+                        if(sumDistances > maxDis) {
+                            maxDis = sumDistances;
+                            maxLink = hasLink;
+                        }
+                    } catch (Exception e) {
+
+                    }
+                }
+
+                if(triCount > 0){
+                    avgDistance = avgDistance / triCount;
+                    printWriter.printf("%.2f,%.2f,%b,%d%n", avgDistance, maxDis, maxLink, triCount);
+                }
+            });
+        } catch (Exception e) {
+            e.printStackTrace();
+        }
+    }
+
+    /**
+     * Method to get the sum of distances for each cluster
+     *
+     * @param bridge Neo4j bridge
+     */
+    private static void getSumFreq(NeoDbCypherBridge bridge) {
+        try (FileWriter fileWriter = new FileWriter("birthbirthtri.csv");
+             PrintWriter printWriter = new PrintWriter(fileWriter)) {
+            printWriter.println("distance_sum,is_sibling");
+
+            Result result = bridge.getNewSession().run(BIRTH_SIBLING_TRIANGLE);
+            result.list(r -> {
+                if (!r.get("cluster_sum").isNull()) {
+                    printWriter.printf("%.2f,%b%n", r.get("cluster_sum").asDouble(), r.get("has_GT_SIBLING").asBoolean());
+                }
+                return null;
+            });
+        } catch (Exception e) {
+            e.printStackTrace();
+        }
+    }
+
+    /**
+     * Method to query the database for quality measurements
+     *
+     * @param query_string Cypher query
+     * @param threshold current threshold being analysed
+     * @param fields current field being analysed
+     * @param bridge Neo4j bridge
+     * @return results of query
+     */
+    protected static long doQuery(String query_string, double threshold, int fields, NeoDbCypherBridge bridge) {
+        Map<String, Object> parameters = new HashMap<>();
+        parameters.put("threshold", threshold);
+        parameters.put("field", fields);
+        Result result = bridge.getNewSession().run(query_string, parameters);
+        return (long) result.list(r -> r.get("count(r)").asInt()).get(0);
+    }
+
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/LinksCounter.java b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/LinksCounter.java
similarity index 88%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/aleks/LinksCounter.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/analysis/LinksCounter.java
index 7a4e3b09..beac2f6c 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/LinksCounter.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/LinksCounter.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.aleks;
+package uk.ac.standrews.cs.population_linkage.analysis;
 import org.neo4j.driver.Result;
 import uk.ac.standrews.cs.neoStorr.impl.Store;
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
@@ -32,6 +32,12 @@ public static void main(String[] args) {
         calculateBasicStats(numLinks);
     }
 
+    /**
+     * Method to get the number of links for each linkage algorithm
+     *
+     * @param bridge Neo4j bride
+     * @return array of number of links
+     */
     private static long[] countLinks(NeoDbCypherBridge bridge) {
         List <String> queries = Query.getAllLinkQueries();
         List <String> algorithms = Query.getAllLinkerNames();
@@ -50,6 +56,10 @@ private static long[] countLinks(NeoDbCypherBridge bridge) {
         return numLinks;
     }
 
+    /**
+     * Method to calculate some overall statistics on the linkage algorithms
+     * @param numLinks number of links made per each algorithm
+     */
     private static void calculateBasicStats(long[] numLinks) {
         List <String> algorithms = Query.getAllLinkerNames();
         long lowestNum = 999999999;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/distribution.py b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/distribution.py
new file mode 100644
index 00000000..ce6f17b5
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/distribution.py
@@ -0,0 +1,61 @@
+#
+# Copyright 2022 Systems Research Group, University of St Andrews:
+# <https://github.com/stacs-srg>
+#
+# This file is part of the module population-linkage.
+#
+# population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+# License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+# version.
+#
+# population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+# warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+# <http://www.gnu.org/licenses/>.
+#
+
+import numpy as np
+import pandas as pd
+import matplotlib.pyplot as plt
+
+data = pd.read_csv("../../../../../../../../../birthbirthtri.csv")
+
+sibling_data = data[data['is_sibling'] == True]['distance_sum']
+non_sibling_data = data[data['is_sibling'] == False]['distance_sum']
+
+fig, ax = plt.subplots(2, 2, figsize=(12, 8))
+
+max_freq = max(
+    max(np.histogram(sibling_data, bins=30)[0]),
+    max(np.histogram(non_sibling_data, bins=30)[0])
+)
+
+# Histogram for siblings
+ax[0, 0].hist(sibling_data, bins=30, color='blue', edgecolor='black', alpha=0.7)
+ax[0, 0].set_title('Histogram of Sum of Distances (False Negatives)')
+ax[0, 0].set_xlabel('Sum of Distances')
+ax[0, 0].set_ylabel('Frequency')
+ax[0, 0].set_xlim([0, 1.35])
+
+# Histogram for non-siblings
+ax[0, 1].hist(non_sibling_data, bins=30, color='orange', edgecolor='black', alpha=0.7)
+ax[0, 1].set_title('Histogram of Sum of Distances (False Positives)')
+ax[0, 1].set_xlabel('Sum of Distances')
+ax[0, 1].set_ylabel('Frequency')
+ax[0, 1].set_xlim([0, 1.35])
+
+# Box plot for siblings
+ax[1, 0].boxplot(sibling_data, vert=False, patch_artist=True, boxprops=dict(facecolor='blue', color='black'))
+ax[1, 0].set_title('Box Plot of Sum of Distances (False Negatives)')
+ax[1, 0].set_xlabel('Sum of Distances')
+ax[1, 0].set_xlim([0, 1.35])
+
+# Box plot for non-siblings
+ax[1, 1].boxplot(non_sibling_data, vert=False, patch_artist=True, boxprops=dict(facecolor='orange', color='black'))
+ax[1, 1].set_title('Box Plot of Sum of Distances (False Positives)')
+ax[1, 1].set_xlabel('Sum of Distances')
+ax[1, 1].set_xlim([0, 1.35])
+
+plt.tight_layout()
+plt.show()
\ No newline at end of file
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/distribution2.py b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/distribution2.py
new file mode 100644
index 00000000..c27f08ca
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/distribution2.py
@@ -0,0 +1,51 @@
+#
+# Copyright 2022 Systems Research Group, University of St Andrews:
+# <https://github.com/stacs-srg>
+#
+# This file is part of the module population-linkage.
+#
+# population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+# License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+# version.
+#
+# population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+# warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+# <http://www.gnu.org/licenses/>.
+#
+
+import pandas as pd
+import matplotlib.pyplot as plt
+
+df = pd.read_csv('../../../../../../../../../birthbirthtri2.csv')
+
+df['distance_diff'] = df['max_distance'] - df['average_distance']
+
+true_sibling = df[df['has_GT_SIBLING'] == True]['distance_diff']
+false_sibling = df[df['has_GT_SIBLING'] == False]['distance_diff']
+
+plt.figure(figsize=(8, 4))
+
+# Histogram for max - average distances in cluster
+plt.hist(false_sibling, bins=20, alpha=0.5, label='False Positives', color='orange')
+plt.hist(true_sibling, bins=20, alpha=0.5, label='False Negatives', color='blue')
+
+plt.xlabel('Distance Difference (max - avg)')
+plt.ylabel('Frequency')
+plt.title('Histogram of Distance Difference by Error Type')
+plt.legend(loc='upper right')
+
+plt.tight_layout()
+plt.show()
+
+# Histogram for number of nodes in a cluster
+plt.figure(figsize=(8, 4))
+plt.hist(df['link_num'], bins=100, alpha=0.7, edgecolor='black', color='blue')
+
+plt.xlabel('Number of open triangles')
+plt.ylabel('Frequency')
+plt.title('Number of Open Triangles per Cluster')
+
+plt.tight_layout()
+plt.show()
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/optimal_threshold.py b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/optimal_threshold.py
new file mode 100644
index 00000000..964e26ac
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/optimal_threshold.py
@@ -0,0 +1,126 @@
+#
+# Copyright 2022 Systems Research Group, University of St Andrews:
+# <https://github.com/stacs-srg>
+#
+# This file is part of the module population-linkage.
+#
+# population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+# License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+# version.
+#
+# population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+# warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+# <http://www.gnu.org/licenses/>.
+#
+
+import numpy as np
+import pandas as pd
+import matplotlib.pyplot as plt
+import argparse
+
+from pandas.core.computation.expr import intersection
+
+
+def main(MAX_FIELD, MIN_FIELD, FILE, save):
+    fig = plt.figure(figsize=(14, 8))
+    threshold_total = 0
+    fmeasure_total = 0
+
+    # Create correct grid layout based on number of fields
+    if MAX_FIELD - MIN_FIELD == 5:
+        axes = [plt.subplot2grid((3, 2), (0, 0)), plt.subplot2grid((3, 2), (0, 1)),
+                plt.subplot2grid((3, 2), (1, 0)), plt.subplot2grid((3, 2), (1, 1)),
+                plt.subplot2grid((3, 2), (2, 0), colspan=2)]
+    elif MAX_FIELD - MIN_FIELD == 4:
+        axes = [plt.subplot2grid((2, 2), (0, 0)), plt.subplot2grid((2, 2), (0, 1)),
+                plt.subplot2grid((2, 2), (1, 0)), plt.subplot2grid((2, 2), (1, 1))]
+    else:
+        axes = [plt.subplot2grid((2, 2), (0, 0)), plt.subplot2grid((2, 2), (0, 1)),
+                plt.subplot2grid((2, 2), (1, 0), colspan=2)]
+
+    all_handles = []
+    all_labels = []
+
+    ascii_char = 97 # starting character 'a' for sub figures
+    for i, N in enumerate(range(MAX_FIELD, MIN_FIELD, -1)):
+        data = pd.read_csv(f'../../../../../../../../../{FILE}{N}.csv')
+
+        # Plot basic quality measures
+        ax1 = axes[i]
+        l1 = ax1.plot(data['threshold'], data['recall'], label='Recall', color='b')
+        l2 = ax1.plot(data['threshold'], data['precision'], label='Precision', color='g')
+        l3 = ax1.plot(data['threshold'], data['fmeasure'], label='fmeasure', color='r')
+        ax1.set_ylim([0, 1.05])
+        ax1.set_ylabel('Quality Metrics\n& Open Patterns (Normalised)')
+        ax1.set_xlabel('Threshold')
+
+        # Add all lines to legend
+        if len(all_handles) == 0:
+            handles, labels = ax1.get_legend_handles_labels()
+            all_handles.extend(handles)
+            all_labels.extend(labels)
+
+        # Normalise total number of triangles and FNOTs
+        total_norm = (data['total'] - data['total'].min()) / (data['total'].max() - data['total'].min())
+        fnot_norm = (data['fnots'] - data['fnots'].min()) / (data['fnots'].max() - data['fnots'].min())
+        fpots = data['total'] - data['fnots'] # get number of FPOTs
+        fpot_norm = (fpots - fpots.min()) / (fpots.max() - fpots.min())
+
+        # Get intersection of FPOTs and FNOTs
+        not_zero = ((fnot_norm > 0.05) & (fnot_norm != 1)) | ((fpot_norm > 0.05) & (fpot_norm != 1))
+        valid_indices = np.where(not_zero)[0]
+        positive_indices = valid_indices[fnot_norm[valid_indices] - fpot_norm[valid_indices] > -0.001]
+        intersection_index = positive_indices[np.argmin(fnot_norm[positive_indices] - fpot_norm[positive_indices])]
+        intersection_threshold = data['threshold'].iloc[intersection_index]
+
+        # Plot number of
+        ax2 = ax1.twinx()
+        ax2.yaxis.set_visible(False)
+        ax2.set_ylim([0, 1.05])
+        l4 = ax2.plot(data['threshold'], total_norm, label='Open Triangles Total', color='orange')
+        l5 = ax2.plot(data['threshold'], fnot_norm, label='Number of FNOTs', color='purple')
+        l6 = ax2.plot(data['threshold'], fpot_norm, label='Number of FPOTs', color='lime')
+
+        l7 = ax2.axvline(x=intersection_threshold, color='black', linestyle='--', label='FPOT-FNOT Intersection')
+        l8 = ax2.axvline(x=data['threshold'][data['fmeasure'].idxmax()], color='black', linestyle='-', label='Peak f-measure')
+
+        # Add all lines to legend
+        if len(all_handles) == 3:
+            handles, labels = ax2.get_legend_handles_labels()
+            all_handles.extend(handles)
+            all_labels.extend(labels)
+
+        ax1.set_title(f'({chr(ascii_char)}) Threshold Analysis {FILE} {N} Fields')
+        ax1.grid(True)
+        ascii_char += 1 # increment sub figure
+
+        print(f"Peak fmeasure threshold {N}: {data['threshold'][data['fmeasure'].idxmax()]}")
+        print(f"Optimal threshold estimate {N}: {intersection_threshold}")
+        print(f"Difference {N}: {abs(intersection_threshold - data['threshold'][data['fmeasure'].idxmax()])}")
+        threshold_total += abs(intersection_threshold - data['threshold'][data['fmeasure'].idxmax()])
+
+        print(f"Peak F-measure {N}: {data['fmeasure'].max()}")
+        print(f"Optimal threshold fmeasure {N}: {data['fmeasure'][data['threshold'] == intersection_threshold].values[0]}")
+        print(f"Difference {N}: {abs(data['fmeasure'].max() - data['fmeasure'][data['threshold'] == intersection_threshold].values[0])}")
+        fmeasure_total += abs(data['fmeasure'].max() - data['fmeasure'][data['threshold'] == intersection_threshold].values[0])
+        print("")
+
+    print(f"Average threshold error: {threshold_total / (MAX_FIELD - MIN_FIELD)}")
+    print(f"Average fmeasure error: {fmeasure_total / (MAX_FIELD - MIN_FIELD)}")
+    fig.legend(handles=all_handles, labels=all_labels, loc='upper right', bbox_to_anchor=(1, 1), borderaxespad=1.5)
+    plt.tight_layout(rect=[0, 0, 0.84, 1], pad=2)
+    if save:
+        plt.savefig('threshold_field_analysis_' + FILE)
+    plt.show()
+
+if __name__ == "__main__":
+    parser = argparse.ArgumentParser(description="Threshold Analysis")
+    parser.add_argument('--max', type=int, required=True, help="Maximum threshold field")
+    parser.add_argument('--min', type=int, required=True, help="Minimum threshold field (1 below target)")
+    parser.add_argument('--file', type=str, required=True, help="csv file name")
+    parser.add_argument('--save', action=argparse.BooleanOptionalAction)
+    args = parser.parse_args()
+
+    main(args.max, args.min - 1, args.file, args.save)
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/pyproject.toml b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/pyproject.toml
new file mode 100644
index 00000000..e190af7c
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/analysis/pyproject.toml
@@ -0,0 +1,15 @@
+[tool.poetry]
+name = "population-linkage"
+version = "0.1.0"
+description = "Threshold analysis for population linkage"
+authors = ["Aleksandr Isaev <ai52@st-andrews.ac.uk>"]
+
+[tool.poetry.dependencies]
+python = ">=3.8,<4.0"
+numpy = "^1.24.0"
+pandas = "^2.0.0"
+matplotlib = "^3.8.0"
+
+[build-system]
+requires = ["poetry-core>=1.0.0"]
+build-backend = "poetry.core.masonry.api"
\ No newline at end of file
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthBrideOwnMarriageBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthBrideOwnMarriageBuilder.java
index 467f75e4..6834ad31 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthBrideOwnMarriageBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthBrideOwnMarriageBuilder.java
@@ -42,21 +42,25 @@ public static void main(String[] args) throws Exception {
         String number_of_records = args[1]; // e.g. EVERYTHING or 10000 etc.
 
         try(
-            BirthBrideIdentityLinkageRecipe linkageRecipe = new BirthBrideIdentityLinkageRecipe(sourceRepo, number_of_records, BirthBrideSiblingBundleBuilder.class.getName(), null) ) {
+            BirthBrideIdentityLinkageRecipe linkageRecipe = new BirthBrideIdentityLinkageRecipe(sourceRepo, number_of_records, BirthBrideOwnMarriageBuilder.class.getName(), null) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2);
+    public static void runBuilder(BirthBrideIdentityLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            while (linkage_fields >= half_fields) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BirthBrideOwnMarriageBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2);
 
-                linkage_fields--;
-            }
+        while (linkage_fields >= half_fields) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthBrideOwnMarriageBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthDeathSiblingBundleBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthDeathSiblingBundleBuilder.java
index 4657ca13..ad20c9fe 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthDeathSiblingBundleBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthDeathSiblingBundleBuilder.java
@@ -42,18 +42,22 @@ public static void main(String[] args) throws Exception {
         try(
             BirthDeathSiblingLinkageRecipe linkageRecipe = new BirthDeathSiblingLinkageRecipe(sourceRepo, number_of_records, BirthDeathSiblingBundleBuilder.class.getName(), null) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
+
+    public static void runBuilder(BirthDeathSiblingLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
 
-            while( linkage_fields >= half_fields ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BirthDeathSiblingBundleBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
+        while( linkage_fields >= half_fields) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthDeathSiblingBundleBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthGroomOwnMarriageBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthGroomOwnMarriageBuilder.java
index 767009e1..506da8c3 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthGroomOwnMarriageBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthGroomOwnMarriageBuilder.java
@@ -40,20 +40,24 @@ public static void main(String[] args) throws Exception {
         String number_of_records = args[1]; // e.g. EVERYTHING or 10000 etc.
 
         try(
-            BirthGroomIdentityLinkageRecipe linkageRecipe = new BirthGroomIdentityLinkageRecipe(sourceRepo, number_of_records, BirthBrideSiblingBundleBuilder.class.getName(), null) ) {
+            BirthGroomIdentityLinkageRecipe linkageRecipe = new BirthGroomIdentityLinkageRecipe(sourceRepo, number_of_records, BirthGroomOwnMarriageBuilder.class.getName(), null) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+    public static void runBuilder(BirthGroomIdentityLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            while( linkage_fields >= half_fields ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BirthGroomOwnMarriageBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while( linkage_fields >= half_fields ) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthGroomOwnMarriageBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthHalfSiblingBundleBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthHalfSiblingBundleBuilder.java
new file mode 100644
index 00000000..de12ec23
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthHalfSiblingBundleBuilder.java
@@ -0,0 +1,75 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.endToEnd.builders;
+
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.RepositoryException;
+import uk.ac.standrews.cs.population_linkage.graph.Query;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthHalfSiblingLinkageRecipe;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
+import uk.ac.standrews.cs.population_linkage.linkageRunners.BitBlasterLinkageRunner;
+import uk.ac.standrews.cs.population_linkage.linkageRunners.MakePersistent;
+import uk.ac.standrews.cs.population_linkage.supportClasses.Link;
+import uk.ac.standrews.cs.population_linkage.supportClasses.LinkageQuality;
+import uk.ac.standrews.cs.population_linkage.supportClasses.LinkageResult;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+
+public class BirthHalfSiblingBundleBuilder implements MakePersistent {
+    public static void main(String[] args) throws Exception {
+
+        String sourceRepo = args[0];  // e.g. umea
+        String number_of_records = args[1]; // e.g. EVERYTHING or 10000 etc.
+
+        int count = 1;
+
+        try (BirthHalfSiblingLinkageRecipe linkageRecipe = new BirthHalfSiblingLinkageRecipe(sourceRepo, number_of_records, BirthHalfSiblingBundleBuilder.class.getName())) {
+
+            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+
+            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthHalfSiblingBundleBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            count++;
+        }
+    }
+
+    @Override
+    public void makePersistent(LinkageRecipe recipe, Link link) {
+        try {
+
+            String std_id1 = link.getRecord1().getReferend(Birth.class).getString(Birth.STANDARDISED_ID);
+            String std_id2 = link.getRecord2().getReferend(Birth.class).getString( Birth.STANDARDISED_ID );
+
+            if( !std_id1.equals(std_id2 ) ) {
+
+                if (!Query.BBBirthHalfSiblingReferenceExists(recipe.getBridge(), std_id1, std_id2, recipe.getLinksPersistentName())) {
+                    Query.createBBHalfSiblingReference(
+                            recipe.getBridge(),
+                            std_id1,
+                            std_id2,
+                            recipe.getLinksPersistentName(),
+                            recipe.getNumberOfLinkageFieldsRequired(),
+                            link.getDistance());
+                }
+            }
+        } catch (BucketException | RepositoryException e) {
+            throw new RuntimeException(e);
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthOwnDeathBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthOwnDeathBuilder.java
index aa96e2bd..7629cad5 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthOwnDeathBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthOwnDeathBuilder.java
@@ -42,18 +42,22 @@ public static void main(String[] args) throws Exception {
         try (
              BirthDeathIdentityLinkageRecipe linkageRecipe = new BirthDeathIdentityLinkageRecipe(sourceRepo, number_of_records, BirthOwnDeathBuilder.class.getName() ) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+    public static void runBuilder(BirthDeathIdentityLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            while( linkage_fields >= half_fields ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BirthOwnDeathBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while( linkage_fields >= half_fields ) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthOwnDeathBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthParentsMarriageBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthParentsMarriageBuilder.java
index 3a0f9f64..092e4b18 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthParentsMarriageBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthParentsMarriageBuilder.java
@@ -43,19 +43,23 @@ public static void main(String[] args) throws Exception {
         try (
              BirthParentsMarriageIdentityLinkageRecipe linkageRecipe = new BirthParentsMarriageIdentityLinkageRecipe(sourceRepo, number_of_records, BirthParentsMarriageBuilder.class.getName() ) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+            System.out.println("Run finished");
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+    public static void runBuilder(BirthParentsMarriageIdentityLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            while( linkage_fields >= half_fields ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BirthParentsMarriageBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
-            System.out.println("Run finished");
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while( linkage_fields >= half_fields ) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthParentsMarriageBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthSiblingBundleBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthSiblingBundleBuilder.java
index e7fb0466..12667b51 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthSiblingBundleBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BirthSiblingBundleBuilder.java
@@ -41,21 +41,24 @@ public static void main(String[] args) throws Exception {
         int count = 1;
 
         try(BirthSiblingLinkageRecipe linkageRecipe = new BirthSiblingLinkageRecipe(sourceRepo, number_of_records, BirthSiblingBundleBuilder.class.getName() ) ) {
+            runBuilder(linkageRecipe, count);
+        }
+    }
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+    public static void runBuilder(BirthSiblingLinkageRecipe linkageRecipe, int count) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2);
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
 
-            while (linkage_fields >= half_fields + 1) {
+        while (linkage_fields >= half_fields) {
 
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BirthSiblingBundleBuilder(), false, true); // TODO Cypher errors if evaluateQuality is tru
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-                count++;
-            }
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BirthSiblingBundleBuilder(), false, true); // TODO Cypher errors if evaluateQuality is tru
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
+            count++;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BrideMarriageParentsMarriageBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BrideMarriageParentsMarriageBuilder.java
index 64bb46b6..f106f239 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BrideMarriageParentsMarriageBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/BrideMarriageParentsMarriageBuilder.java
@@ -43,18 +43,22 @@ public static void main(String[] args) throws Exception {
         try (
              BrideMarriageParentsMarriageIdentityLinkageRecipe linkageRecipe = new BrideMarriageParentsMarriageIdentityLinkageRecipe(sourceRepo, number_of_records, BrideMarriageParentsMarriageBuilder.class.getName()) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+    public static void runBuilder(BrideMarriageParentsMarriageIdentityLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            while( linkage_fields >= half_fields ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new BrideMarriageParentsMarriageBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while( linkage_fields >= half_fields ) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new BrideMarriageParentsMarriageBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/DeathSiblingBundleBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/DeathSiblingBundleBuilder.java
index d8c043cd..cc2dccbe 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/DeathSiblingBundleBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/DeathSiblingBundleBuilder.java
@@ -42,19 +42,22 @@ public static void main(String[] args) throws Exception {
         try(
             DeathSiblingLinkageRecipe linkageRecipe = new DeathSiblingLinkageRecipe(sourceRepo, number_of_records, DeathSiblingBundleBuilder.class.getName()) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+    public static void runBuilder(DeathSiblingLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            //too liberal if only half
-            while( linkage_fields >= half_fields + 1 ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new DeathSiblingBundleBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while( linkage_fields >= half_fields) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new DeathSiblingBundleBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/GroomMarriageParentsMarriageBuilder.java b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/GroomMarriageParentsMarriageBuilder.java
index a49c4ac7..23ae80a5 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/GroomMarriageParentsMarriageBuilder.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/endToEnd/builders/GroomMarriageParentsMarriageBuilder.java
@@ -43,18 +43,22 @@ public static void main(String[] args) throws Exception {
         try (
             GroomMarriageParentsMarriageIdentityLinkageRecipe linkageRecipe = new GroomMarriageParentsMarriageIdentityLinkageRecipe(sourceRepo, number_of_records, GroomMarriageParentsMarriageBuilder.class.getName()) ) {
 
-            BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
+            runBuilder(linkageRecipe);
+        }
+    }
 
-            int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
-            int half_fields = linkage_fields - (linkage_fields / 2 );
+    public static void runBuilder(GroomMarriageParentsMarriageIdentityLinkageRecipe linkageRecipe) throws Exception {
+        BitBlasterLinkageRunner runner = new BitBlasterLinkageRunner();
 
-            while( linkage_fields >= half_fields ) {
-                linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
-                LinkageResult lr = runner.run(linkageRecipe, new GroomMarriageParentsMarriageBuilder(), false, true);
-                LinkageQuality quality = lr.getLinkageQuality();
-                quality.print(System.out);
-                linkage_fields--;
-            }
+        int linkage_fields = linkageRecipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while( linkage_fields >= half_fields ) {
+            linkageRecipe.setNumberLinkageFieldsRequired(linkage_fields);
+            LinkageResult lr = runner.run(linkageRecipe, new GroomMarriageParentsMarriageBuilder(), false, true);
+            LinkageQuality quality = lr.getLinkageQuality();
+            quality.print(System.out);
+            linkage_fields--;
         }
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/graph/Query.java b/src/main/java/uk/ac/standrews/cs/population_linkage/graph/Query.java
index 08a3fa8b..f24c1c13 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/graph/Query.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/graph/Query.java
@@ -50,6 +50,8 @@ public class Query {
     private static final String BB_SIBLING_QUERY = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to CREATE (a)-[r:SIBLING { provenance: $prov, fields_populated: $fields, distance: $distance, actors: \"Child-Child\" } ]->(b)";
     private static final String BB_SIBLING_LINKNUM_QUERY = "MATCH (a:Birth)-[r:SIBLING]->(b:Birth) WHERE r.actors = \"Child-Child\" RETURN COUNT(r) AS link_count";
 
+    private static final String BB_HALF_SIBLING_QUERY = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to CREATE (a)-[r:HALF_SIBLING { provenance: $prov, fields_populated: $fields, distance: $distance, actors: \"Child-Child\" } ]->(b)";
+
     private static final String BM_FATHER_QUERY = "MATCH (a:Birth), (b:Marriage) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to CREATE (a)-[r:ID { provenance: $prov, fields_populated: $fields, distance: $distance, actors: \"Child-Father\" } ]->(b)";
     private static final String BM_MOTHER_QUERY = "MATCH (a:Birth), (b:Marriage) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to CREATE (a)-[r:ID { provenance: $prov, fields_populated: $fields, distance: $distance, actors: \"Child-Mother\" } ]->(b)";
     private static final String BM_FATHER_LINKNUM_QUERY = "MATCH (a:Birth)-[r:ID]->(b:Marriage) WHERE r.actors = \"Child-Father\" RETURN COUNT(r) AS link_count";
@@ -106,6 +108,7 @@ public class Query {
     // queries for use in predicates - return a relationship if it exists
 
     private static final String BB_SIBLING_EXISTS_QUERY = "MATCH (a:Birth)-[r:SIBLING { actors: \"Child-Child\" }]-(b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to AND r.provenance = $prov  RETURN r";
+    private static final String BB_HALF_SIBLING_EXISTS_QUERY = "MATCH (a:Birth)-[r:HALF_SIBLING { actors: \"Child-Child\" }]-(b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to AND r.provenance = $prov  RETURN r";
 
     private static final String BM_FATHER_EXISTS_QUERY = "MATCH (a:Birth)-[r:ID { actors: \"Child-Father\" }]-(b:Marriage) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to AND r.provenance = $prov  RETURN r";
     private static final String BM_MOTHER_EXISTS_QUERY = "MATCH (a:Birth)-[r:ID { actors: \"Child-Mother\" }]-(b:Marriage) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to AND r.provenance = $prov  RETURN r";
@@ -186,6 +189,15 @@ public static void createBBSiblingReference(NeoDbCypherBridge bridge, String sta
         createReference(bridge, BB_SIBLING_QUERY, standard_id_from, standard_id_to, provenance, fields_populated, distance);
     }
 
+    /**
+     * Creates a half sibling reference between node with standard_id_from and standard_id_to and returns the number of relationships created
+     * The first and second parameters should be the id of a Births - it will not work if this is not the case!
+     * See createReference for param details
+     */
+    public static void createBBHalfSiblingReference(NeoDbCypherBridge bridge, String standard_id_from, String standard_id_to, String provenance, int fields_populated, double distance) {
+        createReference(bridge, BB_HALF_SIBLING_QUERY, standard_id_from, standard_id_to, provenance, fields_populated, distance);
+    }
+
     /**
      * Creates a sibling reference between node with standard_id_from and standard_id_to and returns the number of relationships created
      * The first and second parameters should be the id of a Deaths - it will not work if this is not the case!
@@ -320,6 +332,10 @@ public static boolean BBBirthSiblingReferenceExists(NeoDbCypherBridge bridge, St
         return linkExists( bridge, BB_SIBLING_EXISTS_QUERY, standard_id_from, standard_id_to, provenance );
     }
 
+    public static boolean BBBirthHalfSiblingReferenceExists(NeoDbCypherBridge bridge, String standard_id_from, String standard_id_to, String provenance) {
+        return linkExists( bridge, BB_HALF_SIBLING_EXISTS_QUERY, standard_id_from, standard_id_to, provenance );
+    }
+
     public static boolean BMBirthFatherReferenceExists(NeoDbCypherBridge bridge, String standard_id_from, String standard_id_to, String provenance) {
         return linkExists( bridge, BM_FATHER_EXISTS_QUERY, standard_id_from, standard_id_to, provenance );
     }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthHalfSiblingAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthHalfSiblingAccuracy.java
index 90bb5524..dea3724a 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthHalfSiblingAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthHalfSiblingAccuracy.java
@@ -20,9 +20,9 @@
 
 public class BirthBirthHalfSiblingAccuracy extends AbstractAccuracy {
 
-    private static final String BIRTH_BIRTH_HALFSIBLING_TPC = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE (b1)-[:GT_HALF_SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
-    private static final String BIRTH_BIRTH_HALFSIBLING_FPC = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:GT_HALF_SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
-    private static final String BIRTH_BIRTH_HALFSIBLING_FNC = "MATCH (b1:Birth)-[r:GT_HALF_SIBLING { actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
+    private static final String BIRTH_BIRTH_HALFSIBLING_TPC = "MATCH (b1:Birth)-[r:HALF_SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE (b1)-[:GT_HALF_SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
+    private static final String BIRTH_BIRTH_HALFSIBLING_FPC = "MATCH (b1:Birth)-[r:HALF_SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:GT_HALF_SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
+    private static final String BIRTH_BIRTH_HALFSIBLING_FNC = "MATCH (b1:Birth)-[r:GT_HALF_SIBLING { actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:HALF_SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
 
     public BirthBirthHalfSiblingAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthSiblingAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthSiblingAccuracy.java
index b912de6c..c91e52ad 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthSiblingAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBirthSiblingAccuracy.java
@@ -44,7 +44,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BirthBirthSiblingAccuracy acc = new BirthBirthSiblingAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBrideOwnMarriageAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBrideOwnMarriageAccuracy.java
index 0a73166f..cfb876ac 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBrideOwnMarriageAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthBrideOwnMarriageAccuracy.java
@@ -20,12 +20,13 @@
 
 public class BirthBrideOwnMarriageAccuracy extends AbstractAccuracy {
 
-    private static final String BIRTH_BRIDE_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE (b)-[:GT_ID {actors: \"Child-Bride\"}]-(m) return count(r)";
-    private static final String BIRTH_BRIDE_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE NOT (b)-[:GT_ID {actors: \"Child-Bride\"}]-(m) return count(r)";
-    private static final String BIRTH_BRIDE_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE NOT (b)-[r:ID {actors: \"Child-Bride\"}]-(m) return count(r)";
+    private static final String BIRTH_BRIDE_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE (b)-[:GT_ID {actors: \"Child-Bride\"}]-(m) AND NOT (b)-[:DELETED]-(m) return count(r)";
+    private static final String BIRTH_BRIDE_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE NOT (b)-[:GT_ID {actors: \"Child-Bride\"}]-(m) AND NOT (b)-[:DELETED]-(m) return count(r)";
+    private static final String BIRTH_BRIDE_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE NOT (b)-[r:ID {actors: \"Child-Bride\"}]-(m) OR (b)-[:DELETED]-(m) return count(r)";
 
     public BirthBrideOwnMarriageAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
     private void doqueries() {
@@ -43,7 +44,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BirthBrideOwnMarriageAccuracy acc = new BirthBrideOwnMarriageAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthDeathSiblingAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthDeathSiblingAccuracy.java
index ec3485c6..afc7a2da 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthDeathSiblingAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthDeathSiblingAccuracy.java
@@ -20,9 +20,9 @@
 
 public class BirthDeathSiblingAccuracy extends AbstractAccuracy {
 
-    private static final String BIRTH_DEATH_SIBLING_TPC = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE (b)-[:GT_SIBLING {actors: \"Child-Deceased\"}]-(d) return count(r)";
-    private static final String BIRTH_DEATH_SIBLING_FPC = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE NOT (b)-[:GT_SIBLING {actors: \"Child-Deceased\"}]-(d) return count(r)";
-    private static final String BIRTH_DEATH_SIBLING_FNC = "MATCH (b:Birth)-[r:GT_SIBLING {actors: \"Child-Deceased\"}]-(d:Death) WHERE NOT (b)-[:SIBLING {actors: \"Deceased-Child\"}]-(d) return count(r)";
+    private static final String BIRTH_DEATH_SIBLING_TPC = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE (b)-[:GT_SIBLING {actors: \"Child-Deceased\"}]-(d) AND NOT (b)-[:DELETED]-(d) return count(r)";
+    private static final String BIRTH_DEATH_SIBLING_FPC = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE NOT (b)-[:GT_SIBLING {actors: \"Child-Deceased\"}]-(d) AND NOT (b)-[:DELETED]-(d) return count(r)";
+    private static final String BIRTH_DEATH_SIBLING_FNC = "MATCH (b:Birth)-[r:GT_SIBLING {actors: \"Child-Deceased\"}]-(d:Death) WHERE NOT (b)-[:SIBLING {actors: \"Deceased-Child\"}]-(d) OR (b)-[:DELETED]-(d) return count(r)";
 
     public BirthDeathSiblingAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
@@ -44,7 +44,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BirthDeathSiblingAccuracy acc = new BirthDeathSiblingAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthGroomOwnMarriageBundleAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthGroomOwnMarriageBundleAccuracy.java
index a77aae91..fb78981a 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthGroomOwnMarriageBundleAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthGroomOwnMarriageBundleAccuracy.java
@@ -20,15 +20,16 @@
 
 public class BirthGroomOwnMarriageBundleAccuracy extends AbstractAccuracy {
 
-    private static final String BIRTH_GROOM_SIBLING_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE (b)-[:GT_ID {actors: \"Child-Groom\"}]-(m) return count(r)";
-    private static final String BIRTH_GROOM_SIBLING_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE NOT (b)-[:GT_ID {actors: \"Child-Groom\"}]-(m) return count(r)";
-    private static final String BIRTH_GROOM_SIBLING_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Groom\"}]-(m) return count(r)";
+    private static final String BIRTH_GROOM_SIBLING_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE (b)-[:GT_ID {actors: \"Child-Groom\"}]-(m) AND NOT (b)-[:DELETED]-(m) return count(r)";
+    private static final String BIRTH_GROOM_SIBLING_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE NOT (b)-[:GT_ID {actors: \"Child-Groom\"}]-(m) AND NOT (b)-[:DELETED]-(m) return count(r)";
+    private static final String BIRTH_GROOM_SIBLING_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Groom\"}]-(m) OR (b)-[:DELETED]-(m) return count(r)";
 
     public BirthGroomOwnMarriageBundleAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
-    private void doqueries() {
+    public void doqueries() {
         long tpc = doQuery(BIRTH_GROOM_SIBLING_TPC);
         long fpc = doQuery(BIRTH_GROOM_SIBLING_FPC);
         long fnc = doQuery(BIRTH_GROOM_SIBLING_FNC);
@@ -43,7 +44,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BirthGroomOwnMarriageBundleAccuracy acc = new BirthGroomOwnMarriageBundleAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthOwnDeathAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthOwnDeathAccuracy.java
index 21141380..cfeb73ee 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthOwnDeathAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthOwnDeathAccuracy.java
@@ -20,12 +20,13 @@
 
 public class BirthOwnDeathAccuracy extends AbstractAccuracy {
 
-    private static final String BIRTH_DEATH_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE (b)-[:GT_ID {actors: \"Child-Deceased\"}]-(d) return count(r)";
-    private static final String BIRTH_DEATH_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE NOT (b)-[:GT_ID {actors: \"Child-Deceased\"}]-(d) return count(r)";
-    private static final String BIRTH_DEATH_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE NOT (b)-[:ID {actors: \"Child-Deceased\"}]-(d) return count(r)";
+    private static final String BIRTH_DEATH_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE (b)-[:GT_ID {actors: \"Child-Deceased\"}]-(d) AND NOT (b)-[:DELETED]-(d) return count(r)";
+    private static final String BIRTH_DEATH_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE NOT (b)-[:GT_ID {actors: \"Child-Deceased\"}]-(d) AND NOT (b)-[:DELETED]-(d) return count(r)";
+    private static final String BIRTH_DEATH_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE NOT (b)-[:ID {actors: \"Child-Deceased\"}]-(d) OR (b)-[:DELETED]-(d) return count(r)";
 
     public BirthOwnDeathAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
     private void doqueries() {
@@ -43,7 +44,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BirthOwnDeathAccuracy acc = new BirthOwnDeathAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthParentsMarriageAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthParentsMarriageAccuracy.java
index 43f17143..bd90142c 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthParentsMarriageAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BirthParentsMarriageAccuracy.java
@@ -20,9 +20,9 @@
 
 public class BirthParentsMarriageAccuracy extends AbstractAccuracy {
 
-    private static final String BIRTH_PARENTS_MARRIAGE_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Mother\"}]-(m:Marriage), (b)-[:ID {actors: \"Child-Father\"}]-(m) WHERE (b)-[:GT_ID {actors: \"Child-Couple\"}]-(m) return count(r)";
-    private static final String BIRTH_PARENTS_MARRIAGE_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Mother\"}]-(m:Marriage), (b)-[:ID {actors: \"Child-Father\"}]-(m) WHERE NOT (b)-[:GT_ID {actors: \"Child-Couple\"}]-(m) return count(r)";
-    private static final String BIRTH_PARENTS_MARRIAGE_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Couple\"}]-(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Mother\"}]-(m) and NOT (b)-[:ID {actors: \"Child-Father\"}]-(m) return count(r)";
+    private static final String BIRTH_PARENTS_MARRIAGE_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Mother\"}]-(m:Marriage), (b)-[:ID {actors: \"Child-Father\"}]-(m) WHERE (b)-[:GT_ID {actors: \"Child-Couple\"}]-(m) AND NOT (b)-[:DELETED]-(m) return count(r)";
+    private static final String BIRTH_PARENTS_MARRIAGE_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Mother\"}]-(m:Marriage), (b)-[:ID {actors: \"Child-Father\"}]-(m) WHERE NOT (b)-[:GT_ID {actors: \"Child-Couple\"}]-(m) AND NOT (b)-[:DELETED]-(m) return count(r)";
+    private static final String BIRTH_PARENTS_MARRIAGE_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Couple\"}]-(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Mother\"}]-(m) and NOT (b)-[:ID {actors: \"Child-Father\"}]-(m) OR (b)-[:DELETED]-(m)  return count(r)";
 
     // FATHER
     // MOTHER
@@ -30,6 +30,7 @@ public class BirthParentsMarriageAccuracy extends AbstractAccuracy {
 
     public BirthParentsMarriageAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
     private void doqueries() {
@@ -47,7 +48,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BirthParentsMarriageAccuracy acc = new BirthParentsMarriageAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BrideMarriageParentsMarriageAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BrideMarriageParentsMarriageAccuracy.java
index 6712addc..ee53b2bb 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BrideMarriageParentsMarriageAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/BrideMarriageParentsMarriageAccuracy.java
@@ -20,12 +20,13 @@
 
 public class BrideMarriageParentsMarriageAccuracy extends AbstractAccuracy {
 
-    private static final String BRIDE_PARENTS_MARRIAGE_TPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE (m1)-[:GT_ID {actors: \"Bride-Couple\"}]-(m2) return count(r)";
-    private static final String BRIDE_PARENTS_MARRIAGE_FPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:GT_ID {actors: \"Bride-Couple\"}]-(m2) return count(r)";
-    private static final String BRIDE_PARENTS_MARRIAGE_FNC = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:ID {actors: \"Bride-Couple\"}]-(m2) return count(r)";
+    private static final String BRIDE_PARENTS_MARRIAGE_TPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE (m1)-[:GT_ID {actors: \"Bride-Couple\"}]-(m2) AND NOT (m1)-[:DELETED]-(m2) return count(r)";
+    private static final String BRIDE_PARENTS_MARRIAGE_FPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:GT_ID {actors: \"Bride-Couple\"}]-(m2) AND NOT (m1)-[:DELETED]-(m2) return count(r)";
+    private static final String BRIDE_PARENTS_MARRIAGE_FNC = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:ID {actors: \"Bride-Couple\"}]-(m2) OR (m1)-[:DELETED]-(m2) return count(r)";
 
     public BrideMarriageParentsMarriageAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
     private void doqueries() {
@@ -42,7 +43,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             BrideMarriageParentsMarriageAccuracy acc = new BrideMarriageParentsMarriageAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathDeathSiblingAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathDeathSiblingAccuracy.java
index 3208c8ac..11541f3e 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathDeathSiblingAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathDeathSiblingAccuracy.java
@@ -20,12 +20,13 @@
 
 public class DeathDeathSiblingAccuracy extends AbstractAccuracy {
 
-    private static final String DEATH_DEATH_SIBLING_TPC = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE (d1)-[:GT_SIBLING {actors: \"Deceased-Deceased\"}]-(d2) return count(r)";
-    private static final String DEATH_DEATH_SIBLING_FPC = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE NOT (d1)-[:GT_SIBLING {actors: \"Deceased-Deceased\"}]-(d2) return count(r)";
-    private static final String DEATH_DEATH_SIBLING_FNC = "MATCH (d1:Death)-[r:GT_SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE NOT (d1)-[:SIBLING {actors: \"Deceased-Deceased\"}]-(d2) return count(r)";
+    private static final String DEATH_DEATH_SIBLING_TPC = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE (d1)-[:GT_SIBLING {actors: \"Deceased-Deceased\"}]-(d2) AND NOT (d1)-[:DELETED]-(d2) return count(r)";
+    private static final String DEATH_DEATH_SIBLING_FPC = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE NOT (d1)-[:GT_SIBLING {actors: \"Deceased-Deceased\"}]-(d2) AND NOT (d1)-[:DELETED]-(d2) return count(r)";
+    private static final String DEATH_DEATH_SIBLING_FNC = "MATCH (d1:Death)-[r:GT_SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE NOT (d1)-[:SIBLING {actors: \"Deceased-Deceased\"}]-(d2) OR (d1)-[:DELETED]-(d2) return count(r)";
 
     public DeathDeathSiblingAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
     private void doqueries() {
@@ -43,7 +44,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             DeathDeathSiblingAccuracy acc = new DeathDeathSiblingAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathGroomOwnMarriageAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathGroomOwnMarriageAccuracy.java
index d3f21690..7457417c 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathGroomOwnMarriageAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/DeathGroomOwnMarriageAccuracy.java
@@ -22,7 +22,7 @@ public class DeathGroomOwnMarriageAccuracy extends AbstractAccuracy {
 
     private static final String DEATH_GROOM_ID_TPC = "MATCH (d:Death)-[r:ID {actors: \"Deceased-Groom\"}]->(m:Marriage) WHERE (d)-[:GT_ID {actors: \"Deceased-Groom\"}]-(m) return count(r)";
     private static final String DEATH_GROOM_ID_FPC = "MATCH (d:Death)-[r:ID {actors: \"Deceased-Groom\"}]->(m:Marriage) WHERE NOT (d)-[:GT_ID {actors: \"Deceased-Groom\"}]-(m) return count(r)";
-    private static final String DEATH_GROOM_ID_FNC = "MATCH (d:Death)-[r:GT_ID {actors: \"Deceased-Groom\"}]->(m:Marriage) WHERE NOT (d)-[:GROOM {actors: \"Deceased-Groom\"}]-(m) return count(r)";
+    private static final String DEATH_GROOM_ID_FNC = "MATCH (d:Death)-[r:GT_ID {actors: \"Deceased-Groom\"}]->(m:Marriage) WHERE NOT (d)-[:ID {actors: \"Deceased-Groom\"}]-(m) return count(r)";
 
     public DeathGroomOwnMarriageAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/GroomMarriageParentsMarriageAccuracy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/GroomMarriageParentsMarriageAccuracy.java
index 35d4567c..d26fbc5d 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/GroomMarriageParentsMarriageAccuracy.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageAccuracy/GroomMarriageParentsMarriageAccuracy.java
@@ -20,12 +20,13 @@
 
 public class GroomMarriageParentsMarriageAccuracy extends AbstractAccuracy {
 
-    private static final String GROOM_PARENTS_MARRIAGE_TPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE (m1)-[:GT_ID {actors: \"Groom-Couple\"}]-(m2) return count(r)";
-    private static final String GROOM_PARENTS_MARRIAGE_FPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:GT_ID {actors: \"Groom-Couple\"}]-(m2) return count(r)";
-    private static final String GROOM_PARENTS_MARRIAGE_FNC = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:ID {actors: \"Groom-Couple\"}]-(m2) return count(r)";
+    private static final String GROOM_PARENTS_MARRIAGE_TPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE (m1)-[:GT_ID {actors: \"Groom-Couple\"}]-(m2) AND NOT (m1)-[:DELETED]-(m2) return count(r)";
+    private static final String GROOM_PARENTS_MARRIAGE_FPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:GT_ID {actors: \"Groom-Couple\"}]-(m2) AND NOT (m1)-[:DELETED]-(m2) return count(r)";
+    private static final String GROOM_PARENTS_MARRIAGE_FNC = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:ID {actors: \"Groom-Couple\"}]-(m2) OR (m1)-[:DELETED]-(m2) return count(r)";
 
     public GroomMarriageParentsMarriageAccuracy(NeoDbCypherBridge bridge) {
         super(bridge);
+        doqueries();
     }
 
     private void doqueries() {
@@ -42,7 +43,6 @@ private void doqueries() {
     public static void main(String[] args) {
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge()) {
             GroomMarriageParentsMarriageAccuracy acc = new GroomMarriageParentsMarriageAccuracy(bridge);
-            acc.doqueries();
         }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthBrideIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthBrideIdentityLinkageRecipe.java
index 522c665e..9d0353db 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthBrideIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthBrideIdentityLinkageRecipe.java
@@ -51,6 +51,7 @@ public class BirthBrideIdentityLinkageRecipe extends LinkageRecipe {
     // TODO Experiment with including father/mother occupation in all relevant linkages.
 
     private static final double DISTANCE_THRESHOLD = 0.49;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "birth-bride-identity";
 
@@ -148,9 +149,25 @@ protected Collection<LXP> getMarriageRecords() {
         return records;
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
-        return DISTANCE_THRESHOLD;
+        if(MAX_THRESHOLD > 0) {
+            return MAX_THRESHOLD;
+        }
+        switch (getNumberOfLinkageFieldsRequired()) {
+            case 6:
+            case 5:
+                return 1.51;
+            case 4:
+            case 3:
+                return 1.43;
+            default:
+                return DISTANCE_THRESHOLD;
+        }
     }
 
     @Override
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathIdentityLinkageRecipe.java
index 679f261e..d37b1531 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathIdentityLinkageRecipe.java
@@ -41,7 +41,8 @@
  */
 public class BirthDeathIdentityLinkageRecipe extends LinkageRecipe {
 
-    protected static double THRESHOLD = 0.38;  // from earlier experiments
+    protected static double THRESHOLD = 0.88;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "birth-death-identity";
 
@@ -209,8 +210,16 @@ public static int countBirthDeathIdentityGTLinks(NeoDbCypherBridge bridge, LXP b
         return getBirthDeathIdentityGTLinks(bridge, birth_record).size();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
+        if (MAX_THRESHOLD > 0){
+            return MAX_THRESHOLD;
+        }
+
         return THRESHOLD;
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathSiblingLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathSiblingLinkageRecipe.java
index d8d84449..df21f0c4 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathSiblingLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthDeathSiblingLinkageRecipe.java
@@ -19,14 +19,19 @@
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Relationship;
 import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
 import uk.ac.standrews.cs.population_linkage.characterisation.LinkStatus;
 import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
 import uk.ac.standrews.cs.population_linkage.compositeMeasures.SumOfFieldDistances;
 import uk.ac.standrews.cs.population_linkage.helpers.RecordFiltering;
+import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Link;
+import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Birth;
 import uk.ac.standrews.cs.population_records.record_types.Death;
+import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
 
 import java.time.LocalDate;
 import java.util.HashMap;
@@ -41,6 +46,7 @@
 public class BirthDeathSiblingLinkageRecipe extends LinkageRecipe {
 
     private static final double DISTANCE_THRESHOLD = 0.36;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "birth-death-sibling";
 
@@ -143,10 +149,19 @@ public boolean isViableLink(final LXP record1, final LXP record2) {
      * @return true if the link is viable
      */
     public static boolean isViable(final LXP birth_record, final LXP death_record) {
+        final StringMeasure base_measure = Constants.LEVENSHTEIN;;
+        final LXPMeasure composite_measure_bd = getCompositeMeasureBirthDeath(base_measure);
+        RecordRepository record_repository = new RecordRepository("umea");
+
         try {
             String birth_name = CommonLinkViabilityLogic.getPrimaryNameFromBirthRecord(birth_record);
             String death_name = CommonLinkViabilityLogic.getPrimaryNameFromDeathRecord(death_record);
-            if( birth_name.equals(death_name)) {
+//            if( birth_name.equals(death_name)) {
+//                return false; // they are the same person and therefore not siblings
+//            }
+
+            //TODO make this a distance comparison
+            if( getDistance(birth_record, death_record, composite_measure_bd) < 5) {
                 return false; // they are the same person and therefore not siblings
             }
 
@@ -157,6 +172,8 @@ public static boolean isViable(final LXP birth_record, final LXP death_record) {
 
         } catch (NumberFormatException e) { // Invalid year.
             return true;
+        } catch (BucketException e) {
+            throw new RuntimeException(e);
         }
     }
 
@@ -188,13 +205,47 @@ public static int countBirthDeathSiblingGTLinks(NeoDbCypherBridge bridge, LXP bi
         return relationships.size();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
-        return DISTANCE_THRESHOLD;
+        if(MAX_THRESHOLD > 0){
+            return MAX_THRESHOLD;
+        }
+
+        switch (getNumberOfLinkageFieldsRequired()){
+            case 4:
+            case 3:
+                return 0.83;
+            case 2:
+                return 0.5;
+            default:
+                return DISTANCE_THRESHOLD;
+        }
     }
 
     @Override
     public LXPMeasure getCompositeMeasure() {
         return new SumOfFieldDistances(getBaseMeasure(), getLinkageFields());
     }
+
+    protected static LXPMeasure getCompositeMeasureBirthDeath(StringMeasure base_measure) {
+        final List<Integer> LINKAGE_FIELDS_BIRTH = list(
+                Birth.FORENAME,
+                Birth.SURNAME
+        );
+
+        final List<Integer> LINKAGE_FIELDS_DEATH = list(
+                Death.FORENAME,
+                Death.SURNAME
+        );
+
+        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS_BIRTH, LINKAGE_FIELDS_DEATH);
+    }
+
+    private static double getDistance(LXP id1, LXP id2, LXPMeasure composite_measure) throws BucketException {
+        return composite_measure.distance(id1, id2);
+    }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthGroomIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthGroomIdentityLinkageRecipe.java
index 62d242a6..bf62c32d 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthGroomIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthGroomIdentityLinkageRecipe.java
@@ -37,7 +37,8 @@
  */
 public class BirthGroomIdentityLinkageRecipe extends LinkageRecipe {
 
-    private static final double DISTANCE_THRESHOLD = 0.49;
+    private static final double DISTANCE_THRESHOLD = 1.37;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "birth-groom-identity";
 
@@ -174,6 +175,10 @@ public static int countBirthGroomIdentityGTLinks(NeoDbCypherBridge bridge, LXP b
         return relationships.size();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
         return DISTANCE_THRESHOLD;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthHalfSiblingLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthHalfSiblingLinkageRecipe.java
new file mode 100644
index 00000000..c092bdf6
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthHalfSiblingLinkageRecipe.java
@@ -0,0 +1,184 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+
+package uk.ac.standrews.cs.population_linkage.linkageRecipes;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.types.Relationship;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.characterisation.LinkStatus;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.SumOfFieldDistances;
+import uk.ac.standrews.cs.population_linkage.helpers.RecordFiltering;
+import uk.ac.standrews.cs.population_linkage.supportClasses.Link;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+
+import java.time.LocalDate;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+import static uk.ac.standrews.cs.population_linkage.linkageRecipes.CommonLinkViabilityLogic.siblingBirthDatesAreViable;
+
+/**
+ * Links a person appearing as the child on a birth record with a sibling appearing as the child on another birth record.
+ */
+public class BirthHalfSiblingLinkageRecipe extends LinkageRecipe {
+
+    private static final double THRESHOLD = 0.67;
+
+    public static final String LINKAGE_TYPE = "birth-birth-half-sibling";
+
+    public static final int ID_FIELD_INDEX = Birth.STANDARDISED_ID;
+
+    public static final int ALL_LINKAGE_FIELDS = 2;
+    private int number_of_births = 0;
+
+    public static final List<Integer> LINKAGE_FIELDS = list(
+            Birth.MOTHER_FORENAME,
+            Birth.MOTHER_MAIDEN_SURNAME
+    );
+
+    /**
+     * Various possible relevant sources of ground truth for siblings:
+     * * identities of parents
+     * * identities of parents' marriage record
+     * * identities of parents' birth records
+     */
+    @SuppressWarnings("unchecked")
+    public static final List<List<Pair>> TRUE_MATCH_ALTERNATIVES = list(
+            list(pair(Birth.MOTHER_IDENTITY, Birth.MOTHER_IDENTITY)),
+            list(pair(Birth.MOTHER_BIRTH_RECORD_IDENTITY, Birth.MOTHER_BIRTH_RECORD_IDENTITY))
+    );
+
+    public BirthHalfSiblingLinkageRecipe(String source_repository_name, String number_of_records, String links_persistent_name) {
+
+        super(source_repository_name, links_persistent_name);
+        if (number_of_records.equals(EVERYTHING_STRING)) {
+            number_of_births = EVERYTHING;
+        } else {
+            number_of_births = Integer.parseInt(number_of_records);
+        }
+        setNumberOfLinkageFieldsRequired(ALL_LINKAGE_FIELDS);
+    }
+
+    @Override
+    public Iterable<LXP> getBirthRecords() {
+        Iterable<LXP> filtered = filterBySingleParent(super.getBirthRecords(), Birth.FATHER_SURNAME);
+        return RecordFiltering.filter(getNumberOfLinkageFieldsRequired(), number_of_births, filtered, getLinkageFields());
+    }
+
+    @Override
+    public LinkStatus isTrueMatch(LXP record1, LXP record2) {
+        return trueMatch(record1, record2);
+    }
+
+    public static LinkStatus trueMatch(LXP record1, LXP record2) {
+        return trueMatch(record1, record2, TRUE_MATCH_ALTERNATIVES);
+    }
+
+    @Override
+    public String getLinkageType() {
+        return LINKAGE_TYPE;
+    }
+
+    @Override
+    public Class<? extends LXP> getStoredType() {
+        return Birth.class;
+    }
+
+    @Override
+    public Class<? extends LXP> getQueryType() {
+        return Birth.class;
+    }
+
+    @Override
+    public String getStoredRole() {
+        return Birth.ROLE_BABY;
+    }
+
+    @Override
+    public String getQueryRole() {
+        return Birth.ROLE_BABY;
+    }
+
+    @Override
+    public List<Integer> getLinkageFields() {
+        return LINKAGE_FIELDS;
+    }
+
+    public static boolean isViable(final LXP birth_record1, final LXP birth_record2) {
+
+        try {
+            final LocalDate date_of_birth_from_birth_record1 = CommonLinkViabilityLogic.getBirthDateFromBirthRecord(birth_record1);
+            final LocalDate date_of_birth_from_birth_record2 = CommonLinkViabilityLogic.getBirthDateFromBirthRecord(birth_record2);
+
+            return siblingBirthDatesAreViable(date_of_birth_from_birth_record1, date_of_birth_from_birth_record2);
+
+        } catch (NumberFormatException e) { // in this case a BIRTH_YEAR is invalid
+            return true;
+        }
+    }
+
+    @Override
+    public boolean isViableLink(final LXP record1, final LXP record2) {
+        return isViable(record1, record2);
+    }
+
+    @Override
+    public List<Integer> getQueryMappingFields() {
+        return getLinkageFields();
+    }
+
+    @Override
+    public Map<String, Link> getGroundTruthLinks() {
+        return getGroundTruthLinksSymmetric();
+    }
+
+    @Override
+    public long getNumberOfGroundTruthTrueLinks() {
+        int count = 0;
+        for (LXP query_record : getQueryRecords()) {
+            count += countBirthSiblingGTLinks(bridge, query_record);
+        }
+        return count;
+    }
+
+    private static final String BIRTH_GT_SIBLING_LINKS_QUERY = "MATCH (a:Birth)-[r:GT_HALF_SIBLING, { actors: \"Child-Child\" } ]-(b:Birth) WHERE b.STANDARDISED_ID = $standard_id_from RETURN r";
+
+    public static int countBirthSiblingGTLinks(NeoDbCypherBridge bridge, LXP birth_record) {
+        String standard_id_from = birth_record.getString(Birth.STANDARDISED_ID);
+
+        Map<String, Object> parameters = new HashMap<>();
+        parameters.put("standard_id_from", standard_id_from);
+        Result result = bridge.getNewSession().run(BIRTH_GT_SIBLING_LINKS_QUERY, parameters);
+        List<Relationship> relationships = result.list(r -> r.get("r").asRelationship());
+        return relationships.size();
+    }
+
+    @Override
+    public double getThreshold() {
+        return THRESHOLD;
+    }
+
+    @Override
+    public LXPMeasure getCompositeMeasure() {
+        return new SumOfFieldDistances(getBaseMeasure(), getLinkageFields());
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthParentsMarriageIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthParentsMarriageIdentityLinkageRecipe.java
index 53e07d37..e83b5a2e 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthParentsMarriageIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthParentsMarriageIdentityLinkageRecipe.java
@@ -37,6 +37,7 @@
 public class BirthParentsMarriageIdentityLinkageRecipe extends LinkageRecipe {
 
     private static final double DISTANCE_THRESHOLD = 0.4;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "birth-parents-marriage-identity";
 
@@ -168,9 +169,27 @@ public long getNumberOfGroundTruthTrueLinks() {
         return getNumberOfGroundTruthLinksAsymmetric();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
-        return DISTANCE_THRESHOLD;
+        if(MAX_THRESHOLD > 0) {
+            return MAX_THRESHOLD;
+        }
+        switch (getNumberOfLinkageFieldsRequired()){
+            case 8:
+                return 1.78;
+            case 7:
+            case 6:
+                return 1.43;
+            case 5:
+            case 4:
+                return 1.4;
+            default:
+                return DISTANCE_THRESHOLD;
+        }
     }
 
     @Override
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthSiblingLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthSiblingLinkageRecipe.java
index c36a8d2a..23655a94 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthSiblingLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BirthSiblingLinkageRecipe.java
@@ -39,7 +39,8 @@
  */
 public class BirthSiblingLinkageRecipe extends LinkageRecipe {
 
-    private static final double THRESHOLD = 1.0;
+    private static final double THRESHOLD = 1;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "birth-birth-sibling";
 
@@ -127,6 +128,15 @@ public List<Integer> getLinkageFields() {
         return LINKAGE_FIELDS;
     }
 
+    public List<Integer> getLinkageFieldsMSED() {
+        return list(
+                Birth.MOTHER_FORENAME,
+                Birth.MOTHER_MAIDEN_SURNAME,
+                Birth.FATHER_FORENAME,
+                Birth.FATHER_SURNAME
+        );
+    }
+
     public static boolean isViable(final LXP birth_record1, final LXP birth_record2) {
 
         try {
@@ -176,9 +186,31 @@ public static int countBirthSiblingGTLinks(NeoDbCypherBridge bridge, LXP birth_r
         return relationships.size();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
-        return THRESHOLD;
+        if(MAX_THRESHOLD != 0) {
+            if(getNumberOfLinkageFieldsRequired() == ALL_LINKAGE_FIELDS / 2) {
+                return MAX_THRESHOLD / 2;
+            }
+            return MAX_THRESHOLD;
+        }
+
+        switch (getNumberOfLinkageFieldsRequired()){
+            case 8:
+                return 1.81;
+            case 7:
+            case 6:
+            case 5:
+                return 1.78;
+            case 4:
+                return 0.98;
+            default:
+                return THRESHOLD;
+        }
     }
 
     @Override
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BrideMarriageParentsMarriageIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BrideMarriageParentsMarriageIdentityLinkageRecipe.java
index 4be7c25a..4e725495 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BrideMarriageParentsMarriageIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/BrideMarriageParentsMarriageIdentityLinkageRecipe.java
@@ -33,7 +33,8 @@
  */
 public class BrideMarriageParentsMarriageIdentityLinkageRecipe extends LinkageRecipe {
 
-    private static final double DISTANCE_THRESHOLD = 0.55;
+    private static final double DISTANCE_THRESHOLD = 0.89;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "bride-parents-marriage-identity";
 
@@ -149,8 +150,15 @@ public long getNumberOfGroundTruthTrueLinks() {
         return getNumberOfGroundTruthLinksAsymmetric();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
+        if(MAX_THRESHOLD > 0) {
+            return MAX_THRESHOLD;
+        }
         return DISTANCE_THRESHOLD;
     }
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathBrideIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathBrideIdentityLinkageRecipe.java
index 2af351c4..96af29e5 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathBrideIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathBrideIdentityLinkageRecipe.java
@@ -37,7 +37,7 @@
  */
 public class DeathBrideIdentityLinkageRecipe extends LinkageRecipe {
 
-    public static final double DISTANCE_THRESHOLD = 0.49;
+    public static final double DISTANCE_THRESHOLD = 1;
 
     public static final String LINKAGE_TYPE = "death-bride-identity";
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathGroomIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathGroomIdentityLinkageRecipe.java
index 97b53aed..869a5a27 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathGroomIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathGroomIdentityLinkageRecipe.java
@@ -37,7 +37,7 @@
  */
 public class DeathGroomIdentityLinkageRecipe extends LinkageRecipe {
 
-    public static final double DISTANCE_THRESHOLD = 0.35;
+    public static final double DISTANCE_THRESHOLD = 1;
 
     public static final String LINKAGE_TYPE = "death-groom-identity";
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathSiblingLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathSiblingLinkageRecipe.java
index f19161fe..1db85330 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathSiblingLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/DeathSiblingLinkageRecipe.java
@@ -41,6 +41,7 @@
 public class DeathSiblingLinkageRecipe extends LinkageRecipe {
 
     protected static final double DISTANCE_THRESHOLD = 0.53;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "death-death-sibling";
 
@@ -177,9 +178,28 @@ public static int countDeathSiblingGTLinks(NeoDbCypherBridge bridge, LXP death_r
         return relationships.size();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
-        return DISTANCE_THRESHOLD;
+        if(MAX_THRESHOLD > 0){
+            if(getNumberOfLinkageFieldsRequired() == ALL_LINKAGE_FIELDS / 2) {
+                return MAX_THRESHOLD / 2;
+            }
+            return MAX_THRESHOLD;
+        }
+        switch (getNumberOfLinkageFieldsRequired()){
+            case 4:
+                return 0.85;
+            case 3:
+                return 0.86;
+            case 2:
+                return 0.28;
+            default:
+                return DISTANCE_THRESHOLD;
+        }
     }
 
     @Override
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/GroomMarriageParentsMarriageIdentityLinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/GroomMarriageParentsMarriageIdentityLinkageRecipe.java
index a1424af6..ba654ee3 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/GroomMarriageParentsMarriageIdentityLinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/GroomMarriageParentsMarriageIdentityLinkageRecipe.java
@@ -34,6 +34,7 @@
 public class GroomMarriageParentsMarriageIdentityLinkageRecipe extends LinkageRecipe {
 
     private static final double DISTANCE_THRESHOLD = 0.6;
+    private static double MAX_THRESHOLD = 0;
 
     public static final String LINKAGE_TYPE = "groom-parents-marriage-identity";
 
@@ -44,23 +45,23 @@ public class GroomMarriageParentsMarriageIdentityLinkageRecipe extends LinkageRe
     private final int number_of_marriages;
 
     public static final List<Integer> LINKAGE_FIELDS = list(
-            Marriage.GROOM_MOTHER_FORENAME,
-            Marriage.GROOM_MOTHER_MAIDEN_SURNAME,
-            Marriage.GROOM_FATHER_FORENAME,
-            Marriage.GROOM_FATHER_SURNAME
-    );
-
-    public static final List<Integer> SEARCH_FIELDS = list(
             Marriage.BRIDE_FORENAME,
             Marriage.BRIDE_SURNAME,
             Marriage.GROOM_FORENAME,
             Marriage.GROOM_SURNAME
     );
 
+    public static final List<Integer> SEARCH_FIELDS = list(
+            Marriage.GROOM_MOTHER_FORENAME,
+            Marriage.GROOM_MOTHER_MAIDEN_SURNAME,
+            Marriage.GROOM_FATHER_FORENAME,
+            Marriage.GROOM_FATHER_SURNAME
+    );
+
     @SuppressWarnings("unchecked")
     public static final List<List<Pair>> TRUE_MATCH_ALTERNATIVES = list(
-            list(pair(Marriage.GROOM_FATHER_IDENTITY, Marriage.GROOM_IDENTITY)),
-            list(pair(Marriage.GROOM_MOTHER_IDENTITY, Marriage.BRIDE_IDENTITY))
+            list(pair(Marriage.BRIDE_IDENTITY, Marriage.GROOM_MOTHER_IDENTITY)),
+            list(pair(Marriage.GROOM_IDENTITY, Marriage.GROOM_FATHER_IDENTITY))
     );
 
     public GroomMarriageParentsMarriageIdentityLinkageRecipe(String source_repository_name, String number_of_records, String links_persistent_name) {
@@ -79,12 +80,12 @@ protected Iterable<LXP> getMarriageRecords() {
 
 
     @Override
-    public LinkStatus isTrueMatch(LXP birth, LXP marriage) {
-        return trueMatch(birth, marriage);
+    public LinkStatus isTrueMatch(LXP marriage1, LXP marriage2) {
+        return trueMatch(marriage1, marriage2);
     }
 
-    public static LinkStatus trueMatch(LXP birth, LXP marriage) {
-        return trueMatch(birth, marriage, TRUE_MATCH_ALTERNATIVES);
+    public static LinkStatus trueMatch(LXP marriage1, LXP marriage2) {
+        return trueMatch(marriage1, marriage2, TRUE_MATCH_ALTERNATIVES);
     }
 
     @Override
@@ -104,12 +105,12 @@ public Class<? extends LXP> getQueryType() {
 
     @Override
     public String getStoredRole() {
-        return Marriage.ROLE_GROOMS_PARENTS;
+        return Marriage.ROLE_SPOUSES;
     }
 
     @Override
     public String getQueryRole() {
-        return Marriage.ROLE_SPOUSES;  // bride and groom
+        return Marriage.ROLE_GROOMS_PARENTS;  // bride and groom
     }
 
     @Override
@@ -147,9 +148,25 @@ public long getNumberOfGroundTruthTrueLinks() {
         return getNumberOfGroundTruthLinksAsymmetric();
     }
 
+    public static void setMaxThreshold(double maxThreshold) {
+        MAX_THRESHOLD = maxThreshold;
+    }
+
     @Override
     public double getThreshold() {
-        return DISTANCE_THRESHOLD;
+        if(MAX_THRESHOLD > 0) {
+            return MAX_THRESHOLD;
+        }
+
+        switch (getNumberOfLinkageFieldsRequired()){
+            case 4:
+                return 0.82;
+            case 3:
+            case 2:
+                return 0.85;
+            default:
+                return DISTANCE_THRESHOLD;
+        }
     }
 
     @Override
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/LinkageRecipe.java b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/LinkageRecipe.java
index 68c97445..0c6796de 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/LinkageRecipe.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/linkageRecipes/LinkageRecipe.java
@@ -479,6 +479,16 @@ protected Iterable<LXP> filterBySex(Iterable<LXP> records, int sexField, String
         return filteredRecords;
     }
 
+    protected Iterable<LXP> filterBySingleParent(Iterable<LXP> records, int parentField) {
+        Collection<LXP> filteredRecords = new HashSet<>();
+
+        records.forEach(record -> {
+            if (record.getString(parentField).equalsIgnoreCase(""))
+                filteredRecords.add(record);
+        });
+        return filteredRecords;
+    }
+
     public String getLinksPersistentName() {
         return links_persistent_name;
     }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/chains/SiblingDeathOpenChainResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/chains/SiblingDeathOpenChainResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/chains/SiblingDeathOpenChainResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/chains/SiblingDeathOpenChainResolver.java
index 48f98b36..862a26cf 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/chains/SiblingDeathOpenChainResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/chains/SiblingDeathOpenChainResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.chains;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.chains;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -28,7 +28,7 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.DeathSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.DeathSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Death;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBirthClusterAllTrianglesResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBirthClusterAllTrianglesResolver.java
similarity index 97%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBirthClusterAllTrianglesResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBirthClusterAllTrianglesResolver.java
index b0e62fb0..92a118a0 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBirthClusterAllTrianglesResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBirthClusterAllTrianglesResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBirthClusterOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBirthClusterOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBirthClusterOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBirthClusterOpenTriangleResolver.java
index d6d2f859..8dc1637e 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBirthClusterOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBirthClusterOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import HierachicalClustering.AverageLinkage;
 import HierachicalClustering.Cluster;
@@ -32,8 +32,8 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.Distance;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.Distance;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Birth;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBrideClusterAllTrianglesResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBrideClusterAllTrianglesResolver.java
similarity index 97%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBrideClusterAllTrianglesResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBrideClusterAllTrianglesResolver.java
index 7e5e82a8..f756a8a1 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBrideClusterAllTrianglesResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBrideClusterAllTrianglesResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBrideClusterOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBrideClusterOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBrideClusterOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBrideClusterOpenTriangleResolver.java
index 591f26ee..5f8f5c5f 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingBrideClusterOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingBrideClusterOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import HierachicalClustering.AverageLinkage;
 import HierachicalClustering.Cluster;
@@ -32,8 +32,8 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.BrideBrideSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.Distance;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.Distance;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Marriage;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingDeathClusterAllTrianglesResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingDeathClusterAllTrianglesResolver.java
similarity index 97%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingDeathClusterAllTrianglesResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingDeathClusterAllTrianglesResolver.java
index 0528caa5..db943675 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingDeathClusterAllTrianglesResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingDeathClusterAllTrianglesResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingDeathClusterOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingDeathClusterOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingDeathClusterOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingDeathClusterOpenTriangleResolver.java
index 680919b5..280be2dd 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingDeathClusterOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingDeathClusterOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import HierachicalClustering.AverageLinkage;
 import HierachicalClustering.Cluster;
@@ -32,8 +32,8 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.DeathSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.Distance;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.Distance;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Death;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingGroomClusterAllTrianglesResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingGroomClusterAllTrianglesResolver.java
similarity index 97%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingGroomClusterAllTrianglesResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingGroomClusterAllTrianglesResolver.java
index e772c030..4da68dec 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingGroomClusterAllTrianglesResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingGroomClusterAllTrianglesResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingGroomClusterOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingGroomClusterOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingGroomClusterOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingGroomClusterOpenTriangleResolver.java
index 6ef1ee62..5e0c6ace 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/cluster/SiblingGroomClusterOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/cluster/SiblingGroomClusterOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.cluster;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.cluster;
 
 import HierachicalClustering.AverageLinkage;
 import HierachicalClustering.Cluster;
@@ -32,8 +32,8 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.GroomGroomSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.Distance;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.Distance;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Marriage;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/hexagons/SiblingBirthOpenHexagonResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/hexagons/SiblingBirthOpenHexagonResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/hexagons/SiblingBirthOpenHexagonResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/hexagons/SiblingBirthOpenHexagonResolver.java
index 786a1a4d..ea98bd9a 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/hexagons/SiblingBirthOpenHexagonResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/hexagons/SiblingBirthOpenHexagonResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.hexagons;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.hexagons;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -28,7 +28,7 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Birth;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/isomorphism/BirthDeathClusterMissingIdResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/isomorphism/BirthDeathClusterMissingIdResolver.java
similarity index 97%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/isomorphism/BirthDeathClusterMissingIdResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/isomorphism/BirthDeathClusterMissingIdResolver.java
index 9fff2bcf..1bcdeb3c 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/isomorphism/BirthDeathClusterMissingIdResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/isomorphism/BirthDeathClusterMissingIdResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.isomorphism;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.isomorphism;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -23,7 +23,7 @@
 import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
 import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthDeathSiblingBundleBuilder;
-import uk.ac.standrews.cs.population_linkage.resolver.util.TwoTriangles;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.TwoTriangles;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 
 import java.util.stream.Stream;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Binomials.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Binomials.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Binomials.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Binomials.java
index ec6e2adb..344b400a 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Binomials.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Binomials.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;
 
 import java.math.BigInteger;
 import java.util.ArrayList;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Explore.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Explore.java
similarity index 95%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Explore.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Explore.java
index c65f2922..9c47cf49 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Explore.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Explore.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -31,10 +31,7 @@
 import uk.ac.standrews.cs.population_records.record_types.Birth;
 import uk.ac.standrews.cs.utilities.measures.JensenShannon;
 
-import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.List;
-import java.util.Map;
+import java.util.*;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
 
@@ -52,7 +49,7 @@ public class Explore {
     // TODO in the example of example_query_stor_id6 the bundle should be about 10 records
 
     private static final String GET_BIRTH_SIBLINGS = "MATCH (a:Birth)-[r:SIBLING*1..2]-(b:Birth) WHERE a.STORR_ID = $stor_id_from RETURN b";
-    protected static final String SIBLING_QUERY = "MATCH (x:Birth)-[xy:SIBLING]-(y:Birth) WHERE x.STORR_ID = $stor_id_from  return x,xy,y";
+    protected static final String SIBLING_QUERY = "MATCH (x:Birth)-[xy:SIBLING]-(y:Birth) WHERE x.STORR_ID = $stor_id_from and NOT (x)-[:DELETED-(y) return x,xy,y";
     private final BirthSiblingLinkageRecipe recipe;
 
     public Explore(NeoDbCypherBridge bridge, String source_repo_name, BirthSiblingLinkageRecipe recipe) {
@@ -118,7 +115,7 @@ private void showUnlinked() throws BucketException {
     private OrderedList<List<Birth>,Double> examineDivergences(List<Long> sibling_ids) throws BucketException {
         // TreeMap<List<Birth>,Double> all_mseds = new TreeMap<>();
         OrderedList<List<Birth>,Double> all_mseds = new OrderedList<>(Integer.MAX_VALUE); // don't want a limit!
-        List<Birth> bs  = getBirths(sibling_ids);
+        List<Birth> bs = getBirths(sibling_ids);
         for( int n = 2; n < bs.size() - 1; n++ ) {
             List<List<Integer>> indices = Binomials.pickAll(sibling_ids.size(), n);
             for (List<Integer> choices : indices) {
@@ -228,7 +225,7 @@ private void examineGroupsOfSizeK(List<Long> sibling_ids, int k) throws BucketEx
     }
 
     private void examineGroupsOfSizeK(long query_from_bundle_stor_ids, long extra_stor_id, int k) throws BucketException {
-        List<Long> all_stor_ids =getSiblingStorIds(query_from_bundle_stor_ids); // A set of partially interconnected siblings
+        List<Long> all_stor_ids = getSiblingStorIds(query_from_bundle_stor_ids); // A set of partially interconnected siblings
         all_stor_ids.add(query_from_bundle_stor_ids); // add the query too
         all_stor_ids.add(extra_stor_id);                // add the extra member
         examineGroupsOfSizeK( new ArrayList<>( all_stor_ids ), k); // now examine the whole lot.
@@ -240,6 +237,7 @@ private void examineGroupsOfSizeK(long query_from_bundle_stor_ids, int k) throws
         examineGroupsOfSizeK( new ArrayList<>( all_stor_ids ),k ); // now examine the whole lot.
     }
 
+
     public static void main(String[] args) throws BucketException {
 
         String sourceRepo = "umea";
@@ -249,13 +247,14 @@ public static void main(String[] args) throws BucketException {
         long example_query_stor_id3 = 4377094037612468415l; // part of another grroup of 4 with a missing link
         long example_query_stor_id5 = 8472462191637179711l; // part of a network with possibly extra links.
         long example_query_stor_id6 = 8951651435219393113l; // this only has two links but should be part of a complex of 10 siblings
+        long test = 3693888651293933206l; //example of when breaks (STDID - 705146)
 
         try (NeoDbCypherBridge bridge = new NeoDbCypherBridge();
              BirthSiblingLinkageRecipe linkageRecipe = new BirthSiblingLinkageRecipe(sourceRepo, "EVERYTHING", BirthSiblingBundleBuilder.class.getName())) {
 
             Explore ex = new Explore(bridge, sourceRepo, linkageRecipe); // this class
 //            System.out.println( "****************** Related ******************");
-//            ex.examineAll(example_query_stor_id1);
+//            ex.examineAll(test);
 //            System.out.println( "****************** Unrelated ******************");
 //            ex.examineAll(example_query_stor_id1,example_query_stor_id2);
 
@@ -274,7 +273,7 @@ public static void main(String[] args) throws BucketException {
 //            ex.examineGroupsOfSizeK(example_query_stor_id5,example_query_stor_id2,3);
 
             System.out.println( "****************** Related ******************");
-            ex.examineGroupsOfSizeK(example_query_stor_id6,3);  //Super it finds all the sibs in the group with a max of 0.0677 (higher than I had hoped for)
+            ex.examineGroupsOfSizeK(test,3);  //Super it finds all the sibs in the group with a max of 0.0677 (higher than I had hoped for)
 
         }
     }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/LinkPair.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/LinkPair.java
similarity index 95%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/LinkPair.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/LinkPair.java
index 80c393fb..1f727e33 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/LinkPair.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/LinkPair.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;
 
 import org.neo4j.driver.types.Node;
 import org.neo4j.driver.types.Relationship;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/MSED.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/MSED.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/MSED.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/MSED.java
index f4da603d..1e025737 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/MSED.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/MSED.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;/*
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;/*
  * Copyright 2021 Systems Research Group, University of St Andrews:
  * <https://github.com/stacs-srg>
  *
@@ -62,7 +62,7 @@ public MSED(List<String> strings) {
         num_of_vals = strings.size();
 
         this.sparse_reps = stringsToProbs(strings);
-        //Debug.showProbabilites( "sparse_reps:", sparse_reps);
+//        Debug.showProbabilites( "sparse_reps:", sparse_reps);
 
         this.av_data = normalisedColumnSums(sparse_reps);
         //Debug.showDoubles( "av_data:", av_data);
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/OrderedList.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/OrderedList.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/OrderedList.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/OrderedList.java
index 86018156..876248b2 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/OrderedList.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/OrderedList.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/ProbCount.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/ProbCount.java
similarity index 93%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/ProbCount.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/ProbCount.java
index fd0f4817..17d5394e 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/ProbCount.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/ProbCount.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;
 
 /**
  * A helper class to count probabilites and counts
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/README.txt b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/README.txt
similarity index 100%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/README.txt
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/README.txt
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/SparseProbabilityArray.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/SparseProbabilityArray.java
similarity index 95%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/SparseProbabilityArray.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/SparseProbabilityArray.java
index 32c65674..f0a2aefb 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/SparseProbabilityArray.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/SparseProbabilityArray.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;/*
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;/*
  * Copyright 2021 Systems Research Group, University of St Andrews:
  * <https://github.com/stacs-srg>
  *
@@ -31,10 +31,7 @@
  * <http://www.gnu.org/licenses/>.
  */
 
-import java.util.HashSet;
-import java.util.Map;
-import java.util.Set;
-import java.util.TreeMap;
+import java.util.*;
 import java.util.stream.Stream;
 
 /**
@@ -67,7 +64,7 @@ public SparseProbabilityArray() {
      */
     public SparseProbabilityArray(String s) {
         this();
-        Set<String> grams = bigrams(s);
+        List<String> grams = bigrams(s);
         for( String bigram : grams ) {
             addEvent( bigram, 1);
         }
@@ -78,8 +75,8 @@ public SparseProbabilityArray(String s) {
      * @param string - s string from which to construct bigrams
      * @return - a list of bigrams from the string
      */
-    private static Set<String> bigrams(String string) {
-        Set<String> out = new HashSet<>();
+    private static List<String> bigrams(String string) {
+        List<String> out = new ArrayList<String>();
         for (int i = 0; i + 1 < string.length(); i++) {
             out.add(string.substring(i, i + 2));
         }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Test.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Test.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Test.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Test.java
index 6384eac3..df6a0ee0 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/msed/Test.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/msed/Test.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.msed;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.msed;
 
 import java.util.List;
 
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingBirthOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingBirthOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingBirthOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingBirthOpenTriangleResolver.java
index 44a86e60..8a6e8d34 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingBirthOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingBirthOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.triangles;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -28,7 +28,7 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Birth;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingBrideOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingBrideOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingBrideOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingBrideOpenTriangleResolver.java
index 7130ad34..33e555ee 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingBrideOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingBrideOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.triangles;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -28,7 +28,7 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.BrideBrideSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Marriage;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingDeathOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingDeathOpenTriangleResolver.java
similarity index 98%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingDeathOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingDeathOpenTriangleResolver.java
index 7bd31a09..0b31bb09 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles/SiblingDeathOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles/SiblingDeathOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.triangles;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -28,7 +28,7 @@
 import uk.ac.standrews.cs.population_linkage.endToEnd.builders.DeathSiblingBundleBuilder;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.DeathSiblingLinkageRecipe;
 import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
-import uk.ac.standrews.cs.population_linkage.resolver.util.OpenTriangle;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.util.OpenTriangle;
 import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Death;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles2/BirthDeathOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles2/BirthDeathOpenTriangleResolver.java
similarity index 99%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles2/BirthDeathOpenTriangleResolver.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles2/BirthDeathOpenTriangleResolver.java
index 191efa39..a951a000 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles2/BirthDeathOpenTriangleResolver.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles2/BirthDeathOpenTriangleResolver.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.triangles2;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles2;
 
 import org.neo4j.driver.Result;
 import org.neo4j.driver.types.Node;
@@ -39,7 +39,7 @@
 import java.util.*;
 import java.util.stream.Stream;
 
-import static uk.ac.standrews.cs.population_linkage.resolver.triangles2.OpenTriangle2.*;
+import static uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles2.OpenTriangle2.*;
 
 /**
  * @author al@st-andrews.ac.uk
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles2/OpenTriangle2.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles2/OpenTriangle2.java
similarity index 96%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles2/OpenTriangle2.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles2/OpenTriangle2.java
index 850f0f80..c2f47a49 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/triangles2/OpenTriangle2.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/triangles2/OpenTriangle2.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.triangles2;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.triangles2;
 
 import org.neo4j.driver.types.Node;
 import org.neo4j.driver.types.Relationship;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/Distance.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/Distance.java
similarity index 96%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/Distance.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/Distance.java
index 79b5909a..c3d80c71 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/Distance.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/Distance.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.util;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.util;
 
 public class Distance {
     public final long startNodeId;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/OpenTriangle.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/OpenTriangle.java
similarity index 95%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/OpenTriangle.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/OpenTriangle.java
index c635373e..3a4dbd6a 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/OpenTriangle.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/OpenTriangle.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.util;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.util;
 
 /**
  * Used to encode unmatched triangles with nodes x and y and z
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/TwoTriangles.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/TwoTriangles.java
similarity index 95%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/TwoTriangles.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/TwoTriangles.java
index da70a248..06a67291 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/TwoTriangles.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/TwoTriangles.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.util;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.util;
 
 /**
  * Used to encode twp unmatched triangles with nodes t1,t2,t3 and s1,s2,s3
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/UsefulCodeUnused.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/UsefulCodeUnused.java
similarity index 96%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/UsefulCodeUnused.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/UsefulCodeUnused.java
index 95205685..0071763b 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/resolver/util/UsefulCodeUnused.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolverExperiments/util/UsefulCodeUnused.java
@@ -14,7 +14,7 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.resolver.util;
+package uk.ac.standrews.cs.population_linkage.resolverExperiments.util;
 
 import uk.ac.standrews.cs.neoStorr.impl.LXP;
 import uk.ac.standrews.cs.population_records.record_types.Birth;
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthBirthOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthBirthOpenTriangleResolver.java
new file mode 100644
index 00000000..aeeaf208
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthBirthOpenTriangleResolver.java
@@ -0,0 +1,489 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import org.neo4j.driver.types.Node;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthBirthSiblingAccuracy;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthSiblingLinkageRecipe;
+import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
+
+import java.time.LocalDate;
+import java.time.temporal.ChronoUnit;
+import java.util.*;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+import java.util.stream.Collectors;
+
+public class BirthBirthOpenTriangleResolver extends SiblingOpenTriangleResolver {
+    //Cypher queries used in predicates
+    private final String BB_SIBLING_QUERY = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:SIBLING { provenance: $prov, actors: \"Child-Child\" } ]-(b)";
+    private final String BB_SIBLING_QUERY_DEL_PROV = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:DELETED { provenance: $prov, actors: \"Child-Child\" } ]-(b)";
+    private final String BB_SIBLING_WITH_PARENTS = "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[:SIBLING]-(z:Birth),\n" +
+            "(x)-[s:ID]-(m:Marriage),\n" +
+            "(y)-[t:ID]-(m)\n" +
+            "WHERE (s.actors = \"Child-Father\" or s.actors = \"Child-Mother\") and (t.actors = \"Child-Father\" or t.actors = \"Child-Mother\") and NOT (x)-[:SIBLING]-(z) and NOT (z)-[:ID]-(m) and z.PARENTS_YEAR_OF_MARRIAGE <> m.MARRIAGE_YEAR and x.PARENTS_YEAR_OF_MARRIAGE = m.MARRIAGE_YEAR and y.PARENTS_YEAR_OF_MARRIAGE = m.MARRIAGE_YEAR MERGE (y)-[r:DELETED { provenance: \"m_pred\",actors: \"Child-Child\" } ]-(z)";
+    private final String BB_ISO = "MATCH (b1:Birth)-[:SIBLING]-(b2:Birth)-[:SIBLING]-(b3:Birth),\n" +
+            "(d1:Death)-[:SIBLING]-(d2:Death)-[:SIBLING]-(d3:Death),\n" +
+            "(d1)-[:SIBLING]-(d3),\n" +
+            "(b1)-[:ID]-(d1),\n" +
+            "(b2)-[:ID]-(d2),\n" +
+            "(b3)-[:ID]-(d3)\n" +
+            "WHERE NOT (b1)-[:SIBLING]-(b3)\n" +
+            "MERGE (b1)-[r:SIBLING { provenance: \"bb_iso\",actors: \"Child-Child\" } ]-(b3)";
+
+    //Names of predicates to be used as prov
+    private final String[] creationPredicates = {"match_m_date", "bb_iso"};
+    private final String[] deletionPredicates = {"max_age_range", "min_b_interval", "birthplace_mode", "bad_m_date", "msed" , "m_pred"};
+
+    public static void main(String[] args){
+        String sourceRepo = args[0]; // e.g. umea
+        String numberOfRecords = args[1]; // e.g. EVERYTHING or 10000 etc.
+
+        if(args.length != 2){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new BirthBirthOpenTriangleResolver(sourceRepo, numberOfRecords);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public BirthBirthOpenTriangleResolver(String sourceRepo, String numberOfRecords) throws InterruptedException  {
+        super(sourceRepo);
+
+        final StringMeasure base_measure = Constants.LEVENSHTEIN;
+        final LXPMeasure composite_measure_date = getCompositeMeasureDate(base_measure);
+        IBucket births = record_repository.getBucket("birth_records");
+        BirthSiblingLinkageRecipe recipe = new BirthSiblingLinkageRecipe(sourceRepo, numberOfRecords, BirthSiblingBundleBuilder.class.getName());
+        int availableProcessors = Runtime.getRuntime().availableProcessors();
+        ExecutorService executorService = Executors.newFixedThreadPool(availableProcessors);
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Birth"); //get number of triangles before resolution
+        new BirthBirthSiblingAccuracy(bridge);
+
+        //Run all graph predicates
+        System.out.println("Running graph predicates...");
+        String[] graphPredicates = {BB_SIBLING_WITH_PARENTS, BB_ISO};
+        for (String graphPredicate : graphPredicates) {
+            try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction()) {
+                tx.run(graphPredicate);
+                tx.commit();
+            } catch (Exception e) {
+                throw new RuntimeException(e);
+            }
+        }
+
+        System.out.println("Locating triangles...");
+        List<OpenTriangleClusterBB> triangles = findIllegalBirthBirthSiblingTriangles(bridge, sourceRepo); //get all open triangles in their clusters
+        System.out.println("Triangle clusters found: " + triangles.size());
+
+        System.out.println("Resolving triangles with MSED...");
+        for (OpenTriangleClusterBB triangle : triangles) {
+            executorService.submit(() ->
+                {
+                    try {
+                        resolveTrianglesMSED(triangle.getTriangleChain(), triangle.x, recipe, deletionPredicates[4], Birth.STANDARDISED_ID, BB_SIBLING_QUERY_DEL_PROV);
+                    } catch (BucketException e) {
+                        throw new RuntimeException(e);
+                    }
+                }
+            );
+        }
+
+        System.out.println("Resolving triangles with predicates...");
+        for (OpenTriangleClusterBB cluster : triangles) { //loop through each triangle cluster
+            executorService.submit(() ->
+                {
+                    try {
+                        resolveTrianglesPredicates(cluster, births, composite_measure_date);
+                    } catch (BucketException e) {
+                        throw new RuntimeException(e);
+                    }
+                }
+            );
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(1, TimeUnit.HOURS);
+
+        System.out.println("After");
+        System.out.println("\n");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        pef.countSiblingEfficacy(creationPredicates, deletionPredicates, "Birth", "Birth");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Birth"); //count number of open triangles after resolution
+        new BirthBirthSiblingAccuracy(bridge);
+    }
+
+    /**
+     * Method to resolve open triangles using logical predicates
+     *
+     * @param cluster cluster of open triangles to resolve
+     * @param births births bucket
+     * @param composite_measure_date composite measure for date
+     * @throws BucketException
+     */
+    private void resolveTrianglesPredicates(OpenTriangleClusterBB cluster, IBucket births, LXPMeasure composite_measure_date) throws BucketException {
+        for (List<Long> chain : cluster.getTriangleChain()){ //loop through each chain of open triangles in cluster
+            LXP[] tempKids = {(LXP) births.getObjectById(cluster.x), (LXP) births.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))}; //get node objects
+            String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+            String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
+            String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+            cluster.getYearStatistics(); //get statistics for brith years
+            boolean hasChanged = false; //prevent resolution if chain has already been resolved
+
+            //1. Check age of child not outside of max difference
+            hasChanged = maxRangePredicate(cluster, tempKids, hasChanged, 0);
+
+            //2. check DOB at least 9 months away from rest
+            hasChanged = minBirthIntervalPredicate(cluster, tempKids, hasChanged, 1);
+
+            //3. Get mode of birthplace
+            hasChanged = mostCommonBirthPlacePredicate(cluster, hasChanged, tempKids, 2);
+
+            //4. If same marriage date and pass other checks, create link
+            if(!hasChanged && getDistance(cluster.x, chain.get(1), composite_measure_date, births) < DATE_THRESHOLD &&
+                    !Objects.equals(tempKids[0].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----") &&
+                    !Objects.equals(tempKids[2].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----")){
+                createLink(bridge, std_id_x, std_id_z, creationPredicates[0], BB_SIBLING_QUERY);
+            }else{
+                if(!hasChanged && getDistance(cluster.x, chain.get(0), composite_measure_date, births) > DATE_THRESHOLD &&
+                        !Objects.equals(tempKids[0].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----") &&
+                        !Objects.equals(tempKids[1].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----")){
+                    deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[3], BB_SIBLING_QUERY_DEL_PROV);
+                }
+
+                if (!hasChanged && getDistance(chain.get(0), chain.get(1), composite_measure_date, births) > DATE_THRESHOLD &&
+                        !Objects.equals(tempKids[1].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----") &&
+                        !Objects.equals(tempKids[2].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----")){
+                    deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[3], BB_SIBLING_QUERY_DEL_PROV);
+                }
+            }
+        }
+    }
+
+    /**
+     * Method to locate all open triangles in the database
+     *
+     * @param bridge Neo4j Bridge
+     * @return List of open triangle clusters
+     */
+    private List<OpenTriangleClusterBB> findIllegalBirthBirthSiblingTriangles(NeoDbCypherBridge bridge, String recordRepo) {
+        final String BIRTH_SIBLING_TRIANGLE_QUERY = "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[:SIBLING]-(z:Birth)\n" +
+                "WHERE NOT (x)-[:SIBLING]-(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)\n" +
+                "RETURN x, collect([y, z]) AS openTriangles";
+
+        //run query to get all open triangles
+        Result result = bridge.getNewSession().run(BIRTH_SIBLING_TRIANGLE_QUERY);
+        List<OpenTriangleClusterBB> clusters = new ArrayList<>();
+        List<List<Long>> temp = new ArrayList<>();
+
+        //loop through each cluster
+        result.stream().forEach(r -> {
+            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
+            List<List<Node>> openTrianglesNodes = (List<List<Node>>) r.asMap().get("openTriangles");
+
+            for (List<Node> innerList : openTrianglesNodes) {
+                List<Long> openTriangleList = innerList.stream()
+                        .map(obj -> {
+                            if (obj instanceof Node) {
+                                return ((Node) obj).get("STORR_ID").asLong();
+                            } else {
+                                throw new IllegalArgumentException("Expected a Node but got: " + obj.getClass());
+                            }
+                        })
+                        .collect(Collectors.toList());
+
+                temp.add(openTriangleList); //add triangles to a temporary list
+
+                if (temp.size() == 360) { //limit number of triangles in cluster
+                    clusters.add(new OpenTriangleClusterBB(x, new ArrayList<>(temp), recordRepo));
+                    temp.clear();
+                }
+            }
+
+            if (!temp.isEmpty()) { //if not reached limit, create a cluster object with whatever is left
+                clusters.add(new OpenTriangleClusterBB(x, new ArrayList<>(temp), recordRepo));
+                temp.clear();
+            }
+        });
+
+        return clusters;
+    }
+
+    /**
+     * Predicate to resolve triangles based on the maximum age range two siblings can have
+     * If a record's birthday is more than MAX_AGE_DIFFERENCE away from its link or the median of the cluster
+     * then it is deleted
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean maxRangePredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber) {
+        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+        //Check if record x is outside of range
+        if(!Objects.equals(tempKids[0].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Birth.BIRTH_YEAR), "----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR)) - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record z is outside of range
+        } else if (!Objects.equals(tempKids[2].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Birth.BIRTH_YEAR), "----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR)) - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record y is outside of range compared to x
+        } else if (!Objects.equals(tempKids[0].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Birth.BIRTH_YEAR), "----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR)) - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)) {
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record y is outside of range compared to z
+        } else if (!Objects.equals(tempKids[2].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Birth.BIRTH_YEAR), "----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt(tempKids[1].getString(Birth.BIRTH_YEAR)) - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Predicate to resolve triangles based on a minimum birth interval between two records
+     * Either the interval between two connected records needs to be above BIRTH_INTERVAL
+     * Or the interval between two closest siblings based on the birthday inside the cluster needs to be above BIRTH_INTERVAL
+     *
+     * Code for finding closest date has been amended from https://stackoverflow.com/a/67767630
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean minBirthIntervalPredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber) {
+        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+        for (int i = 0; i < tempKids.length; i+=2) {
+            try{
+                LocalDate childDate = getBirthdayAsDate(tempKids[i], false); //get birth date of node being analysed
+                LocalDate dateY = getBirthdayAsDate(tempKids[1], false); //get birth date of middle node
+                if(!hasChanged && Math.abs(ChronoUnit.DAYS.between(dateY, childDate)) < BIRTH_INTERVAL && Math.abs(ChronoUnit.DAYS.between(dateY, childDate)) > 2){
+                    if(i == 0){
+                        deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+                    }else{
+                        deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+                    }
+                    hasChanged = true;
+                }
+            }catch (Exception e){
+
+            }
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Predicate to resolve triangles based on most common birthplace. If neighbouring node and birthplace mode of cluster don't match
+     * record, then delete link
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean mostCommonBirthPlacePredicate(OpenTriangleCluster cluster, boolean hasChanged, LXP[] tempKids, int predNumber) {
+        int MIN_FAMILY_SIZE = 3; //delete link only if cluster contains more children than threshold
+        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Birth.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+        //check on x
+        if(!hasChanged && !Objects.equals(tempKids[1].getString(Birth.BIRTH_ADDRESS), "----") && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), "----") &&
+                !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), tempKids[1].getString(Birth.BIRTH_ADDRESS)) && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), cluster.getMostCommonBirthplace()) && cluster.getNumOfChildren() > MIN_FAMILY_SIZE ){
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //check on z
+        } else if (!hasChanged && !Objects.equals(tempKids[1].getString(Birth.BIRTH_ADDRESS), "----") && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), "----") &&
+                !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), tempKids[1].getString(Birth.BIRTH_ADDRESS)) && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), cluster.getMostCommonBirthplace()) && cluster.getNumOfChildren() > MIN_FAMILY_SIZE) {
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BB_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Method to clean and standardise strings
+     *
+     * @param triangle triangle to clean
+     */
+    @Override
+    protected void cleanStrings(List<LXP> triangle) {
+        int[] fields = {Birth.FATHER_FORENAME, Birth.MOTHER_FORENAME, Birth.FATHER_SURNAME, Birth.MOTHER_MAIDEN_SURNAME};
+
+        for (int i = 0; i < triangle.size(); i++) {
+            //1. DOTTER/SON
+            String dotterRegex = "D[.:ORT](?!.*D[.:RT])";
+            Pattern pattern = Pattern.compile(dotterRegex);
+            Matcher matcher = pattern.matcher(triangle.get(i).getString(Birth.MOTHER_MAIDEN_SURNAME));
+            if (matcher.find()) {
+                String newString = triangle.get(i).getString(Birth.MOTHER_MAIDEN_SURNAME).substring(0, matcher.start()) + "DOTTER";
+                triangle.get(i).put(Birth.MOTHER_MAIDEN_SURNAME, newString);
+            }
+
+            String sonRegex = "S[.]";
+            pattern = Pattern.compile(sonRegex);
+            matcher = pattern.matcher(triangle.get(i).getString(Birth.FATHER_SURNAME));
+            if (matcher.find()) {
+                String newString = triangle.get(i).getString(Birth.FATHER_SURNAME).substring(0, matcher.start()) + "SON";
+                triangle.get(i).put(Birth.FATHER_SURNAME, newString);
+            }
+
+            //2. Initials or incomplete names
+            String initialRegex = "^[A-Z]*\\.$";
+            pattern = Pattern.compile(initialRegex);
+            for (int j = 0; j < fields.length - 3; j++) {
+                matcher = pattern.matcher(triangle.get(i).getString(fields[j]));
+
+                if(matcher.find()) {
+                    String substringX = triangle.get(0).getString(fields[j]).length() >= matcher.end() - 1 ? triangle.get(0).getString(fields[j]).substring(matcher.start(), matcher.end() - 1) : triangle.get(0).getString(j);
+                    String substringY = triangle.get(1).getString(fields[j]).length() >= matcher.end() - 1 ? triangle.get(1).getString(fields[j]).substring(matcher.start(), matcher.end() - 1) : triangle.get(1).getString(j);
+                    String substringZ = triangle.get(2).getString(fields[j]).length() >= matcher.end() - 1 ? triangle.get(2).getString(fields[j]).substring(matcher.start(), matcher.end() - 1) : triangle.get(2).getString(j);
+
+                    if (i == 0 && substringX.equals(substringY) && substringX.equals(substringZ)) {
+                        triangle.get(0).put(fields[j], triangle.get(0).getString(fields[j]).replace(".", ""));
+                        triangle.get(1).put(fields[j], triangle.get(0).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                        triangle.get(2).put(fields[j], triangle.get(0).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                    } else if (i == 1 && substringY.equals(substringX) && substringY.equals(substringZ)) {
+                        triangle.get(1).put(fields[j], triangle.get(1).getString(fields[j]).replace(".", ""));
+                        triangle.get(0).put(fields[j], triangle.get(1).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                        triangle.get(2).put(fields[j], triangle.get(1).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                    } else if (i == 2 && substringZ.equals(substringX) && substringZ.equals(substringY)) {
+                        triangle.get(2).put(fields[j], triangle.get(2).getString(fields[j]).replace(".", ""));
+                        triangle.get(0).put(fields[j], triangle.get(2).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                        triangle.get(1).put(fields[j], triangle.get(2).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                    }
+                }
+            }
+
+            //3. Middle names and double barrel surnames
+            for (int field : fields) {
+                if (triangle.get(i).getString(field).contains(" ")) {
+                    if (i == 0 && !triangle.get(2).getString(field).contains(" ")) {
+                        String[] names = triangle.get(0).getString(field).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(triangle.get(2).getString(field))) {
+                                triangle.get(0).put(field, name);
+                                break;
+                            }
+                        }
+                    } else if(i == 1 && (!triangle.get(0).getString(field).contains(" ") || !triangle.get(2).getString(field).contains(" "))) {
+                        String[] names = triangle.get(1).getString(field).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(triangle.get(0).getString(field))) {
+                                triangle.get(1).put(field, name);
+                                break;
+                            }
+                        }
+                        for (String name : names) {
+                            if (name.equals(triangle.get(2).getString(field))) {
+                                triangle.get(1).put(field, name);
+                                break;
+                            }
+                        }
+                    } else if(i == 2 && !triangle.get(0).getString(field).contains(" ")) {
+                        String[] names = triangle.get(2).getString(field).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(triangle.get(0).getString(field))) {
+                                triangle.get(2).put(field, name);
+                                break;
+                            }
+                        }
+                    }
+                }
+            }
+
+            //4. Parentheses
+            for (int field : fields) {
+                String parenthesesRegex = "\\(([^)]+)\\)";
+                pattern = Pattern.compile(parenthesesRegex);
+                matcher = pattern.matcher(triangle.get(i).getString(field));
+
+                if (matcher.find() && matcher.start() > 0) {
+                    String newString = triangle.get(i).getString(field).substring(0, matcher.start()).strip();
+                    triangle.get(i).put(field, newString);
+                }
+            }
+        }
+    }
+
+    /**
+     * Method to get birth objects based on storr IDs
+     *
+     * @param sibling_ids ids of records to find
+     * @param record_repository repository of where records stored
+     * @return list of birth objects
+     * @throws BucketException
+     */
+    @Override
+    protected List<LXP> getRecords(List<Long> sibling_ids, RecordRepository record_repository) throws BucketException {
+        IBucket<LXP> births = record_repository.getBucket("birth_records");
+        ArrayList<LXP> bs = new ArrayList();
+        for( long id : sibling_ids) {
+            bs.add(births.getObjectById(id));
+        }
+        return bs;
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathIDGraphOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathIDGraphOpenTriangleResolver.java
new file mode 100644
index 00000000..17f65811
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathIDGraphOpenTriangleResolver.java
@@ -0,0 +1,87 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthOwnDeathAccuracy;
+
+import java.util.Map;
+
+
+public class BirthDeathIDGraphOpenTriangleResolver extends IdentityOpenTriangleResolver {
+
+    //cypher queries for all graph predicates
+    private final String BD_BAD_DATE = "MATCH (a:Birth)-[r:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE a.BIRTH_YEAR <> right(d.DATE_OF_BIRTH, 4)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: \"Child-Deceased\" } ]-(d)";
+    private final String BD_BORN_AFTER = "MATCH (a:Birth)-[r:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE toInteger(a.BIRTH_YEAR) > toInteger(d.DEATH_YEAR)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: \"Child-Deceased\" } ]-(d)";
+    private final String BD_BORN_BEFORE = "MATCH (a:Birth)-[r:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE toInteger(d.DEATH_YEAR) - toInteger(a.BIRTH_YEAR) > 105\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: \"Child-Deceased\" } ]-(d)";
+    private final String BD_SIBLING = "MATCH (a:Birth)-[:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE NOT (a)-[:SIBLING]-(d) and (b)-[:SIBLING]-(d)\n" +
+            "MERGE (b)-[:DELETED { provenance: $prov, actors: \"Child-Deceased\" } ]-(d)";
+
+    //Names of predicates to be used as prov
+    private static final String[] deletionPredicates = {"bad_b_date", "born_after_death", "born_way_before_death", "sibling"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+
+        if(args.length != 1){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new BirthDeathIDGraphOpenTriangleResolver(sourceRepo);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public BirthDeathIDGraphOpenTriangleResolver(String sourceRepo) throws BucketException {
+        super(sourceRepo);
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Death"); //get number of triangles before resolution
+        new BirthOwnDeathAccuracy(bridge);
+
+        //run through all graph predicates
+        System.out.println("Running graph predicates...");
+        String[] graphPredicates = {BD_BAD_DATE, BD_BORN_AFTER, BD_BORN_BEFORE, BD_SIBLING};
+        for (int i = 0; i < graphPredicates.length; i++) {
+            try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction()) {
+                Map<String, Object> parameters = getCreationParameterMap(null, null, deletionPredicates[i], "Child-Deceased");
+                tx.run(graphPredicates[i], parameters);
+                tx.commit();
+            } catch (Exception e) {
+                throw new RuntimeException(e);
+            }
+        }
+
+        System.out.println("After");
+        System.out.println("\n");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        pef.countIDEfficacyDel(deletionPredicates, "Birth", "Death", "Child-Deceased");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Death"); //get number of triangles before resolution
+        new BirthOwnDeathAccuracy(bridge);
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathIDPredicateOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathIDPredicateOpenTriangleResolver.java
new file mode 100644
index 00000000..eecdd654
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathIDPredicateOpenTriangleResolver.java
@@ -0,0 +1,194 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import org.neo4j.driver.types.Node;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthOwnDeathAccuracy;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+
+import java.time.LocalDate;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Objects;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+
+public class BirthDeathIDPredicateOpenTriangleResolver extends IdentityOpenTriangleResolver {
+    private final String BD_BAD_DATE = "MATCH (a:Birth)-[r:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE a.BIRTH_YEAR <> right(d.DATE_OF_BIRTH, 4)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: \"Child-Deceased\" } ]-(d)";
+    private final String BD_BORN_AFER = "MATCH (a:Birth)-[r:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE toInteger(a.BIRTH_YEAR) > toInteger(d.DEATH_YEAR)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: \"Child-Deceased\" } ]-(d)";
+    private final String BD_SIBLING = "MATCH (a:Birth)-[:ID]-(d:Death)-[:ID]-(b:Birth) \n" +
+            "WHERE NOT (a)-[:SIBLING]-(d) and (b)-[:SIBLING]-(d)\n" +
+            "MERGE (b)-[:DELETED { provenance: \"sibling\", actors: \"Child-Deceased\" } ]-(d)";
+
+    private static final String BM_ID_QUERY_DEL_PROV = "MATCH (a:Birth), (b:Death) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:DELETED { provenance: $prov, actors: $actor } ]-(b)";
+
+
+    //Names of predicates to be used as prov
+    private static final String[] deletionPredicates = {"bad_b_date", "born_after_death", "sibling"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+
+        if(args.length != 1){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new BirthDeathIDPredicateOpenTriangleResolver(sourceRepo);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public BirthDeathIDPredicateOpenTriangleResolver(String sourceRepo) throws BucketException, InterruptedException {
+        super(sourceRepo);
+
+        IBucket births = record_repository.getBucket("birth_records");
+        IBucket deaths = record_repository.getBucket("death_records");
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Death"); //get number of triangles before resolution
+        new BirthOwnDeathAccuracy(bridge);
+
+        System.out.println("Locating triangles...");
+        List<Long[]> triangles = findIllegalBirthDeathTriangles(bridge); //get all open triangles in their clusters
+        System.out.println("Triangles found: " + triangles.size());
+
+        System.out.println("Running graph predicates...");
+        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
+            tx.run(BD_SIBLING); //run birth-marriage graph pattern
+            tx.commit();
+        }
+
+        int availableProcessors = Runtime.getRuntime().availableProcessors();
+        ExecutorService executorService = Executors.newFixedThreadPool(availableProcessors);
+
+        System.out.println("Resolving triangles with predicates...");
+        for (Long[] triangle : triangles) {
+            executorService.submit(() ->
+                    {
+                        try {
+                            resolveTriangle(triangle, births, deaths);
+                        } catch (BucketException e) {
+                            throw new RuntimeException(e);
+                        }
+                    }
+            );
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(1, TimeUnit.HOURS);
+
+        System.out.println("After");
+        System.out.println("\n");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        pef.countIDEfficacyDel(deletionPredicates, "Birth", "Death", "Child-Deceased");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Death"); //get number of triangles before resolution
+        new BirthOwnDeathAccuracy(bridge);
+    }
+
+    private void resolveTriangle(Long[] triangle, IBucket births, IBucket deaths) throws BucketException {
+        boolean isDeleted = false;
+        LXP[] tempKids = {(LXP) births.getObjectById(triangle[0]), (LXP) deaths.getObjectById(triangle[1]), (LXP) births.getObjectById(triangle[2])};
+        String[] stds = {tempKids[0].getString(Birth.STANDARDISED_ID), tempKids[1].getString(Death.STANDARDISED_ID), tempKids[2].getString(Birth.STANDARDISED_ID)};
+
+        int day = 1;
+        if(!Objects.equals(tempKids[1].getString(Death.DEATH_DAY), "--")){
+            day = Integer.parseInt(tempKids[1].getString(Death.DEATH_DAY));
+        }
+        int month = 1;
+        if(!Objects.equals(tempKids[1].getString(Death.DEATH_MONTH), "--")){
+            month = Integer.parseInt(tempKids[1].getString(Death.DEATH_MONTH));
+        }
+
+        LocalDate dateD = null;
+        if(!Objects.equals(tempKids[1].getString(Death.DEATH_YEAR), "----")){
+            dateD = LocalDate.of(Integer.parseInt(tempKids[1].getString(Death.DEATH_YEAR)), month, day);
+        }
+
+        for (int i = 0; i < triangle.length; i += 2) {
+            day = 1;
+            if(!Objects.equals(tempKids[i].getString(Birth.BIRTH_DAY), "--")){
+                day = Integer.parseInt(tempKids[i].getString(Birth.BIRTH_DAY));
+            }
+            month = 1;
+            if(!Objects.equals(tempKids[i].getString(Birth.BIRTH_MONTH), "--")){
+                month = Integer.parseInt(tempKids[i].getString(Birth.BIRTH_MONTH));
+            }
+
+            LocalDate date = null;
+            if(!Objects.equals(tempKids[i].getString(Birth.BIRTH_YEAR), "----")){
+                date = LocalDate.of(Integer.parseInt(tempKids[i].getString(Birth.BIRTH_YEAR)), month, day);
+            }
+
+            //1. Match birthdays
+            if (!Objects.equals(tempKids[i].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH).substring(6), "----")) {
+                if (!Objects.equals(tempKids[i].getString(Birth.BIRTH_YEAR), tempKids[1].getString(Death.DATE_OF_BIRTH).substring(6))) {
+                    deleteLink(bridge, stds[i], stds[1], "Child-Deceased", deletionPredicates[0], BM_ID_QUERY_DEL_PROV);
+                    isDeleted = true;
+                }
+            }
+
+            if (!isDeleted && date != null && dateD != null) { //2. If born after death
+                if (date.isAfter(dateD)) {
+                    deleteLink(bridge, stds[i], stds[1], "Child-Deceased", deletionPredicates[1], BM_ID_QUERY_DEL_PROV);
+                    isDeleted = true;
+                }
+            }
+
+//        } else if (ChronoUnit.YEARS.between(date, dateD) >= 0 && //4. If born way before death
+//                ChronoUnit.YEARS.between(date, dateD)> MAX_MARRIAGE_AGE) {
+//            deleteLink(bridge, stds[i], stds[1], "Child-Deceased", deletionPredicates[3], BM_ID_QUERY_DEL_PROV);
+//            isDeleted = true;
+//        }
+        }
+    }
+
+    private List<Long[]> findIllegalBirthDeathTriangles(NeoDbCypherBridge bridge) {
+        final String BIRTH_DEATH_TRIANGLE_QUERY = "MATCH (x:Birth)-[:ID]-(y:Death)-[:ID]-(z:Birth)\n" +
+                "WHERE id(x) < id(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)\n" +
+                "RETURN x, y, z";
+
+        //run query to get all open triangles
+        Result result = bridge.getNewSession().run(BIRTH_DEATH_TRIANGLE_QUERY);
+        List<Long[]> triangles = new ArrayList<>();
+        result.stream().forEach(r -> {
+            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
+            long y = ((Node) r.asMap().get("y")).get("STORR_ID").asLong();
+            long z = ((Node) r.asMap().get("z")).get("STORR_ID").asLong();
+
+            Long[] tempList = {x, y, z};
+            triangles.add(tempList);
+        });
+
+        return triangles;
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathOpenTriangleResolver.java
new file mode 100644
index 00000000..36e325b0
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthDeathOpenTriangleResolver.java
@@ -0,0 +1,489 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.types.Node;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthDeathSiblingBundleBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthBirthSiblingAccuracy;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthDeathSiblingAccuracy;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthDeathSiblingLinkageRecipe;
+import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
+
+import java.time.LocalDate;
+import java.time.temporal.ChronoUnit;
+import java.util.*;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+import java.util.stream.Collectors;
+
+public class BirthDeathOpenTriangleResolver extends SiblingOpenTriangleResolver {
+    //Cypher queries used in predicates
+    private final String BB_SIBLING_QUERY = "MATCH (a:Birth), (b:Birth) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:SIBLING { provenance: $prov, actors: \"Child-Child\" } ]-(b)";
+    private final String BD_SIBLING_QUERY_DEL_PROV = "MATCH (a:Birth), (b:Death) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:DELETED { provenance: $prov } ]-(b)";
+
+    //Names of predicates to be used as prov
+    private final String[] creationPredicates = {"match_m_date_bd"};
+    private final String[] deletionPredicates = {"max_age_range", "min_b_interval", "birthplace_mode", "bad_m_date", "msed"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+        String numberOfRecords = args[1]; // e.g. EVERYTHING or 10000 etc.
+
+        if(args.length != 2){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new BirthDeathOpenTriangleResolver(sourceRepo, numberOfRecords);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+
+    }
+
+    public BirthDeathOpenTriangleResolver(String sourceRepo, String numberOfRecords) throws BucketException, InterruptedException {
+        super(sourceRepo);
+        final StringMeasure base_measure = Constants.LEVENSHTEIN;
+        final LXPMeasure composite_measure_date = getCompositeMeasureDate(base_measure);
+        IBucket births = record_repository.getBucket("birth_records");
+        IBucket deaths = record_repository.getBucket("death_records");
+        BirthDeathSiblingLinkageRecipe recipe = new BirthDeathSiblingLinkageRecipe(sourceRepo, numberOfRecords, BirthDeathSiblingBundleBuilder.class.getName(), null);
+        int availableProcessors = Runtime.getRuntime().availableProcessors();
+        ExecutorService executorService = Executors.newFixedThreadPool(availableProcessors);
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Death");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Birth");
+        new BirthDeathSiblingAccuracy(bridge);
+        new BirthBirthSiblingAccuracy(bridge);
+
+        System.out.println("Locating triangles...");
+        List<OpenTriangleClusterBD> triangles = findIllegalBirthDeathSiblingTriangles(bridge, sourceRepo);
+        System.out.println("Triangle clusters found: " + triangles.size());
+
+        System.out.println("Resolving triangles with MSED...");
+        for (OpenTriangleClusterBD cluster : triangles) {
+            executorService.submit(() ->
+                {
+                    try {
+                        resolveTrianglesMSED(cluster.getTriangleChain(), cluster.x, recipe, deletionPredicates[4], Birth.STANDARDISED_ID, BD_SIBLING_QUERY_DEL_PROV);
+                    } catch (BucketException e) {
+                        throw new RuntimeException(e);
+                    }
+                }
+            );
+        }
+
+        System.out.println("Resolving triangles with predicates...");
+        for (OpenTriangleCluster cluster : triangles) {
+            executorService.submit(() ->
+                {
+                    try {
+                        resolveTrianglesPredicates(cluster, births, deaths, composite_measure_date);
+                    } catch (BucketException e) {
+                        throw new RuntimeException(e);
+                    }
+                }
+            );
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(1, TimeUnit.HOURS);
+
+        System.out.println("After");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        System.out.println("Birth-Death");
+        pef.countSiblingEfficacy(new String[0], deletionPredicates, "Birth", "Death");
+        System.out.println("Birth-Birth");
+        pef.countSiblingEfficacy(creationPredicates, new String[0], "Birth", "Birth");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Death");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Birth", "Birth");
+        new BirthDeathSiblingAccuracy(bridge);
+        new BirthBirthSiblingAccuracy(bridge);
+    }
+
+    /**
+     * Method to resolve open triangles using logical predicates
+     *
+     * @param cluster cluster of open triangles to resolve
+     * @param births births bucket
+     * @param composite_measure_date composite measure for date
+     * @throws BucketException
+     */
+    private void resolveTrianglesPredicates(OpenTriangleCluster cluster, IBucket births, IBucket deaths, LXPMeasure composite_measure_date) throws BucketException {
+        for (List<Long> chain : cluster.getTriangleChain()){
+            LXP[] tempKids = {(LXP) births.getObjectById(cluster.x), (LXP) deaths.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))};
+            String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+            String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+            String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+            cluster.getYearStatistics();
+            boolean hasChanged = false;
+
+            //1. Check age of child not outside of max difference
+            hasChanged = maxRangePredicate(cluster, tempKids, hasChanged, 0);
+
+            //2. check DOB at least 9 months away from rest
+            hasChanged = minBirthIntervalPredicate(cluster, tempKids, hasChanged, 1);
+
+            //3. Get mode of birthplace
+            hasChanged = mostCommonBirthPlacePredicate(cluster, hasChanged, tempKids, 2);
+
+            //4. If same marriage date and pass other checks, create link. Match for same birthplace as well?
+            if(!hasChanged && getDistance(cluster.x, chain.get(1), composite_measure_date, births) < DATE_THRESHOLD &&
+                    !Objects.equals(tempKids[0].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----") &&
+                    !Objects.equals(tempKids[2].getString(Birth.PARENTS_YEAR_OF_MARRIAGE), "----")){
+                createLink(bridge, std_id_x, std_id_z, creationPredicates[0], BB_SIBLING_QUERY);
+            }
+        }
+    }
+
+    /**
+     * Method to locate all open triangles in the database
+     *
+     * @param bridge Neo4j Bridge
+     * @return List of open triangle clusters
+     */
+    private List<OpenTriangleClusterBD> findIllegalBirthDeathSiblingTriangles(NeoDbCypherBridge bridge, String recordRepo) {
+        final String BIRTH_SIBLING_TRIANGLE_QUERY = "MATCH (x:Birth)-[:SIBLING]-(y:Death)-[:SIBLING]-(z:Birth)\n"+
+                "WHERE NOT (x)-[:SIBLING]-(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)\n" +
+                "RETURN x, collect([y, z]) AS openTriangles";
+
+        //run query to get all open triangles
+        Result result = bridge.getNewSession().run(BIRTH_SIBLING_TRIANGLE_QUERY);
+        List<OpenTriangleClusterBD> clusters = new ArrayList<>();
+        List<List<Long>> temp = new ArrayList<>();
+
+        //loop through each cluster
+        result.stream().forEach(r -> {
+            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
+            List<List<Node>> openTrianglesNodes = (List<List<Node>>) r.asMap().get("openTriangles");
+
+            for (List<Node> innerList : openTrianglesNodes) {
+                List<Long> openTriangleList = innerList.stream()
+                        .map(obj -> {
+                            if (obj instanceof Node) {
+                                return ((Node) obj).get("STORR_ID").asLong();
+                            } else {
+                                throw new IllegalArgumentException("Expected a Node but got: " + obj.getClass());
+                            }
+                        })
+                        .collect(Collectors.toList());
+
+                temp.add(openTriangleList); //add triangles to a temporary list
+
+                if (temp.size() == 360) { //limit number of triangles in cluster
+                    clusters.add(new OpenTriangleClusterBD(x, new ArrayList<>(temp), recordRepo));
+                    temp.clear();
+                }
+            }
+
+            if (!temp.isEmpty()) { //if not reached limit, create a cluster object with whatever is left
+                clusters.add(new OpenTriangleClusterBD(x, new ArrayList<>(temp), recordRepo));
+                temp.clear();
+            }
+        });
+
+        return clusters;
+    }
+
+    /**
+     * Predicate to resolve triangles based on the maximum age range two siblings can have
+     * If a record's birthday is more than MAX_AGE_DIFFERENCE away from its link or the median of the cluster
+     * then it is deleted
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean maxRangePredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber) {
+        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+        //Check if record x is outside of range
+        if(!Objects.equals(tempKids[0].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record z is outside of range
+        } else if (!Objects.equals(tempKids[2].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))- Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record y is outside of range compared to x
+        } else if (!Objects.equals(tempKids[0].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----")  &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) - Integer.parseInt(tempKids[0].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)) {
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record y is outside of range compared to z
+        } else if (!Objects.equals(tempKids[2].getString(Birth.BIRTH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----")  &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) - Integer.parseInt(tempKids[2].getString(Birth.BIRTH_YEAR))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Predicate to resolve triangles based on a minimum birth interval between two records
+     * Either the interval between two connected records needs to be above BIRTH_INTERVAL
+     * Or the interval between two closest siblings based on the birthday inside the cluster needs to be above BIRTH_INTERVAL
+     *
+     * Code for finding closest date has been amended from https://stackoverflow.com/a/67767630
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean minBirthIntervalPredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber) {
+        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+        for (int i = 0; i < tempKids.length; i+=2) {
+            try{
+                LocalDate childDate = getBirthdayAsDate(tempKids[i], false); //get birth date of node being analysed
+                LocalDate dateY = getBirthdayAsDate(tempKids[1], true); //get birth date of middle node
+                if(!hasChanged && Math.abs(ChronoUnit.DAYS.between(dateY, childDate)) < BIRTH_INTERVAL && Math.abs(ChronoUnit.DAYS.between(dateY, childDate)) > 2){
+                    if(i == 0){
+                        deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+                    }else{
+                        deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+                    }
+                    hasChanged = true;
+                }
+            }catch (Exception e){
+
+            }
+        }
+
+        return hasChanged;
+    }
+
+
+    /**
+     * Predicate to resolve triangles based on most common birthplace. If neighbouring node and birthplace mode of cluster don't match
+     * record, then delete link
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean mostCommonBirthPlacePredicate(OpenTriangleCluster cluster, boolean hasChanged, LXP[] tempKids, int predNumber) {
+        int MIN_FAMILY_SIZE = 3;
+        String std_id_x = tempKids[0].getString(Birth.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Birth.STANDARDISED_ID);
+
+        //check on x
+        if(!hasChanged && !Objects.equals(tempKids[1].getString(Death.PLACE_OF_DEATH), "----") &&
+                ((!Objects.equals(tempKids[1].getString(Death.AGE_AT_DEATH), "") && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), "----") && Integer.parseInt(tempKids[1].getString(Death.AGE_AT_DEATH)) < cluster.getAgeRange() / 2) ||
+                (!Objects.equals(tempKids[1].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                        Integer.parseInt(tempKids[1].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) < cluster.getAgeRange() / 2)) &&
+                !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), tempKids[1].getString(Death.PLACE_OF_DEATH)) && !Objects.equals(tempKids[0].getString(Birth.BIRTH_ADDRESS), cluster.getMostCommonBirthplace()) && cluster.getNumOfChildren() > MIN_FAMILY_SIZE){
+
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //check on z
+        } else if (!hasChanged && !Objects.equals(tempKids[1].getString(Death.PLACE_OF_DEATH), "----") && ((!Objects.equals(tempKids[1].getString(Death.AGE_AT_DEATH), "") && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), "----") && Integer.parseInt(tempKids[1].getString(Death.AGE_AT_DEATH)) < cluster.getAgeRange() / 2) ||
+                (!Objects.equals(tempKids[1].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                        Integer.parseInt(tempKids[1].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) < cluster.getAgeRange() / 2)) &&
+                !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), tempKids[1].getString(Death.PLACE_OF_DEATH)) && !Objects.equals(tempKids[2].getString(Birth.BIRTH_ADDRESS), cluster.getMostCommonBirthplace()) && cluster.getNumOfChildren() > MIN_FAMILY_SIZE) {
+
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], BD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Method to clean and standardise strings
+     *
+     * @param triangle triangle to clean
+     */
+    @Override
+    protected void cleanStrings(List<LXP> triangle) {
+        int[] fieldsB = {Birth.FATHER_FORENAME, Birth.MOTHER_FORENAME, Birth.FATHER_SURNAME, Birth.MOTHER_MAIDEN_SURNAME};
+        int[] fieldsD = {Death.FATHER_FORENAME, Death.MOTHER_FORENAME, Death.FATHER_SURNAME, Death.MOTHER_MAIDEN_SURNAME};
+
+        for (int i = 0; i < triangle.size(); i++) {
+            //1. DOTTER/SON
+            String dotterRegex = "D[.:ORT](?!.*D[.:RT])";
+            Pattern pattern = Pattern.compile(dotterRegex);
+            Matcher matcher = pattern.matcher(triangle.get(i).getString(Birth.MOTHER_MAIDEN_SURNAME));
+            if (matcher.find()) {
+                String newString = triangle.get(i).getString(Birth.MOTHER_MAIDEN_SURNAME).substring(0, matcher.start()) + "DOTTER";
+                triangle.get(i).put(Birth.MOTHER_MAIDEN_SURNAME, newString);
+            }
+
+            String sonRegex = "S[.]";
+            pattern = Pattern.compile(sonRegex);
+            matcher = pattern.matcher(triangle.get(i).getString(Birth.FATHER_SURNAME));
+            if (matcher.find()) {
+                String newString = triangle.get(i).getString(Birth.FATHER_SURNAME).substring(0, matcher.start()) + "SON";
+                triangle.get(i).put(Birth.FATHER_SURNAME, newString);
+            }
+
+            //2. Initials or incomplete names
+            String initialRegex = "^[A-Z]*\\.$";
+            pattern = Pattern.compile(initialRegex);
+            for (int j = 0; j < fieldsB.length - 3; j++) {
+                if(i == 1){
+                    matcher = pattern.matcher(triangle.get(i).getString(fieldsD[j]));
+                }else{
+                    matcher = pattern.matcher(triangle.get(i).getString(fieldsB[j]));
+                }
+
+                if(matcher.find()){
+                    String substringX = triangle.get(0).getString(fieldsB[j]).length() >= matcher.end() - 1 ? triangle.get(0).getString(fieldsB[j]).substring(matcher.start(), matcher.end() - 1) : triangle.get(0).getString(j);
+                    String substringY = triangle.get(1).getString(fieldsD[j]).length() >= matcher.end() - 1 ? triangle.get(1).getString(fieldsD[j]).substring(matcher.start(), matcher.end() - 1) : triangle.get(1).getString(j);
+                    String substringZ = triangle.get(2).getString(fieldsB[j]).length() >= matcher.end() - 1 ? triangle.get(2).getString(fieldsB[j]).substring(matcher.start(), matcher.end() - 1) : triangle.get(2).getString(j);
+
+                    if (i == 0 && substringX.equals(substringY) && substringX.equals(substringZ)) {
+                        triangle.get(0).put(fieldsB[j], triangle.get(0).getString(fieldsB[j]).replace(".", ""));
+                        triangle.get(1).put(fieldsD[j], triangle.get(0).getString(fieldsD[j]).substring(matcher.start(), matcher.end() - 1));
+                        triangle.get(2).put(fieldsB[j], triangle.get(0).getString(fieldsB[j]).substring(matcher.start(), matcher.end() - 1));
+                    } else if (i == 1 && substringY.equals(substringX) && substringY.equals(substringZ)) {
+                        triangle.get(1).put(fieldsB[j], triangle.get(1).getString(fieldsB[j]).replace(".", ""));
+                        triangle.get(0).put(fieldsD[j], triangle.get(1).getString(fieldsD[j]).substring(matcher.start(), matcher.end() - 1));
+                        triangle.get(2).put(fieldsB[j], triangle.get(1).getString(fieldsB[j]).substring(matcher.start(), matcher.end() - 1));
+                    } else if (i == 2 && substringZ.equals(substringX) && substringZ.equals(substringY)) {
+                        triangle.get(2).put(fieldsB[j], triangle.get(2).getString(fieldsB[j]).replace(".", ""));
+                        triangle.get(0).put(fieldsD[j], triangle.get(2).getString(fieldsD[j]).substring(matcher.start(), matcher.end() - 1));
+                        triangle.get(1).put(fieldsB[j], triangle.get(2).getString(fieldsB[j]).substring(matcher.start(), matcher.end() - 1));
+                    }
+                }
+            }
+
+            //3. Middle names and double barrel surnames
+            for (int j = 0; j < fieldsB.length - 1; j++) {
+                if (triangle.get(i).getString(fieldsB[j]).contains(" ") || triangle.get(i).getString(fieldsD[j]).contains(" ")) {
+                    if (i == 0 && !triangle.get(2).getString(fieldsB[j]).contains(" ")) {
+                        String[] names = triangle.get(0).getString(fieldsB[j]).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(triangle.get(2).getString(fieldsB[j]))) {
+                                triangle.get(0).put(fieldsB[j], name);
+                                break;
+                            }
+                        }
+                    } else if(i == 1 && (!triangle.get(0).getString(fieldsB[j]).contains(" ") || !triangle.get(2).getString(fieldsB[j]).contains(" "))) {
+                        String[] names = triangle.get(1).getString(fieldsD[j]).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(triangle.get(0).getString(fieldsB[j]))) {
+                                triangle.get(1).put(fieldsD[j], name);
+                                break;
+                            }
+                        }
+                        for (String name : names) {
+                            if (name.equals(triangle.get(2).getString(fieldsB[j]))) {
+                                triangle.get(1).put(fieldsD[j], name);
+                                break;
+                            }
+                        }
+                    } else if(i == 2 && !triangle.get(0).getString(fieldsB[j]).contains(" ")) {
+                        String[] names = triangle.get(2).getString(fieldsB[j]).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(triangle.get(0).getString(fieldsB[j]))) {
+                                triangle.get(2).put(fieldsB[j], name);
+                                break;
+                            }
+                        }
+                    }
+                }
+            }
+
+            //4. Parentheses
+            for (int j = 0; j < fieldsB.length - 1; j++) {
+                String parenthesesRegex = "\\(([^)]+)\\)";
+                pattern = Pattern.compile(parenthesesRegex);
+                if(i == 1){
+                    matcher = pattern.matcher(triangle.get(i).getString(fieldsD[j]));
+
+                    if (matcher.find() && matcher.start() > 0) {
+                        String newString = triangle.get(i).getString(fieldsD[j]).substring(0, matcher.start()).strip();
+                        triangle.get(i).put(fieldsD[j], newString);
+                    }
+                }else{
+                    matcher = pattern.matcher(triangle.get(i).getString(fieldsB[j]));
+
+                    if (matcher.find() && matcher.start() > 0) {
+                        String newString = triangle.get(i).getString(fieldsB[j]).substring(0, matcher.start()).strip();
+                        triangle.get(i).put(fieldsB[j], newString);
+                    }
+                }
+            }
+        }
+    }
+
+    /**
+     * Method to get birth/death objects based on storr IDs
+     *
+     * @param sibling_ids ids of records to find
+     * @param record_repository repository of where records stored
+     * @return list of birth/death objects
+     * @throws BucketException
+     */
+    @Override
+    protected List<LXP> getRecords(List<Long> sibling_ids, RecordRepository record_repository) throws BucketException {
+        IBucket<Birth> births = record_repository.getBucket("birth_records");
+        IBucket<Death> deaths = record_repository.getBucket("death_records");
+        ArrayList<LXP> bs = new ArrayList();
+
+        for (int i = 0; i < sibling_ids.size(); i++) {
+            if(i == 1){
+                bs.add(deaths.getObjectById(sibling_ids.get(i)));
+            }else{
+                bs.add(births.getObjectById(sibling_ids.get(i)));
+            }
+        }
+
+        return bs;
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthMarriageIDOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthMarriageIDOpenTriangleResolver.java
new file mode 100644
index 00000000..6d9947c6
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthMarriageIDOpenTriangleResolver.java
@@ -0,0 +1,217 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import org.neo4j.driver.types.Node;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.SumOfFieldDistances;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthBrideOwnMarriageAccuracy;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthGroomOwnMarriageBundleAccuracy;
+import uk.ac.standrews.cs.population_linkage.supportClasses.Constants;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.population_records.record_types.Marriage;
+import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
+
+import java.util.*;
+
+import static uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe.list;
+
+
+public class BirthMarriageIDOpenTriangleResolver extends IdentityOpenTriangleResolver {
+    private static final double NAME_THRESHOLD = 0.5;
+
+    //Cypher queries used in predicates
+    private static final String BM_ID_QUERY_DEL_PROV = "MATCH (a:Birth), (b:Marriage) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:DELETED { provenance: $prov, actors: $actor } ]-(b)";
+
+    private final String BM_BAD_DATE = "MATCH (a:Birth)-[r:ID {actors: \"Child-%1$s\"}]-(d:Marriage)-[s:ID {actors: \"Child-%1$s\"}]-(b:Birth) \n" +
+            "WHERE a.BIRTH_YEAR <> right(d.%2$s_AGE_OR_DATE_OF_BIRTH, 4)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: $actor } ]-(d)";
+    private final String BM_BORN_AFER = "MATCH (a:Birth)-[r:ID {actors: \"Child-%1$s\"}]-(d:Marriage)-[s:ID {actors: \"Child-%1$s\"}]-(b:Birth) \n" +
+            "WHERE toInteger(a.BIRTH_YEAR) > toInteger(d.MARRIAGE_YEAR)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: $actor } ]-(d)";
+    private final String BM_BORN_BEFORE = "MATCH (a:Birth)-[r:ID {actors: \"Child-%1$s\"}]-(d:Marriage)-[s:ID {actors: \"Child-%1$s\"}]-(b:Birth) \n" +
+            "WHERE toInteger(d.MARRIAGE_YEAR) - toInteger(a.BIRTH_YEAR) < 16\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: $actor } ]-(d)";
+    private final String BM_BORN_OLD = "MATCH (a:Birth)-[r:ID {actors: \"Child-%1$s\"}]-(d:Marriage)-[s:ID {actors: \"Child-%1$s\"}]-(b:Birth) \n" +
+            "WHERE toInteger(d.MARRIAGE_YEAR) - toInteger(a.BIRTH_YEAR) > 60\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: $actor } ]-(d)";
+    private final String BM_SIBLING = "MATCH (a:Birth)-[r:ID {actors: \"Child-%1$s\"}]-(d:Marriage)-[s:ID {actors: \"Child-%1$s\"}]-(b:Birth) \n" +
+            "WHERE NOT (a)-[:SIBLING]-(d) and (b)-[:SIBLING]-(d)\n" +
+            "MERGE (a)-[:DELETED { provenance: $prov, actors: $actor } ]-(d)";
+
+    //Names of predicates to be used as prov
+    private static final String[] deletionPredicates = {"diff_birth", "born_after", "too_young", "too_old", "siblings", "bad_name"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+
+        if(args.length != 1){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new BirthMarriageIDOpenTriangleResolver(sourceRepo);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public BirthMarriageIDOpenTriangleResolver(String sourceRepo) throws BucketException {
+        super(sourceRepo);
+
+        final StringMeasure base_measure = Constants.JENSEN_SHANNON;
+        LXPMeasure composite_measure;
+        IBucket births = record_repository.getBucket("birth_records");
+        IBucket marriages = record_repository.getBucket("marriage_records");
+        String[] partners = {"Groom", "Bride"};
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Marriage"); //get number of triangles before resolution
+        new BirthGroomOwnMarriageBundleAccuracy(bridge);
+        new BirthBrideOwnMarriageAccuracy(bridge);
+
+        //loop through each partner
+        for (String partner : partners) {
+            composite_measure = getCompositeMeasureBirthMarriage(base_measure, partner);
+            System.out.println("Resolving " + partner);
+            System.out.println("Locating triangles...");
+            List<Long[]> triangles = findIllegalBirthMarriageTriangles(bridge, partner); //get all open triangles in their clusters
+            System.out.println("Triangles found: " + triangles.size());
+
+            //run through all graph predicates
+            System.out.println("Running graph predicates...");
+            String[] graphPredicates = {BM_BAD_DATE, BM_BORN_AFER, BM_BORN_BEFORE, BM_BORN_OLD, BM_SIBLING};
+            for (int i = 0; i < graphPredicates.length; i++) {
+                try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction()) {
+                    Map<String, Object> parameters = getCreationParameterMap(null, null, deletionPredicates[i], "Child-" + partner);
+                    if(i == 0){
+                        tx.run(String.format(graphPredicates[i], partner, partner.toUpperCase()), parameters);
+                    }else{
+                        tx.run(String.format(graphPredicates[i], partner), parameters);
+                    }
+                    tx.commit();
+                } catch (Exception e) {
+                    throw new RuntimeException(e);
+                }
+            }
+
+            //run through all logical predicates
+            System.out.println("Resolving triangles with predicates...");
+            for (Long[] triangle : triangles) {
+                resolveTriangle(partner, triangle, births, marriages, composite_measure);
+            }
+        }
+
+        System.out.println("After");
+        System.out.println("\n");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        for (String partner : partners) {
+            System.out.println("\n" + partner + " efficacy:");
+            pef.countIDEfficacyDel(deletionPredicates, "Birth", "Marriage", "Child-" + partner);
+        }
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Marriage"); //count number of open triangles after resolution
+        new BirthGroomOwnMarriageBundleAccuracy(bridge);
+        new BirthBrideOwnMarriageAccuracy(bridge);
+    }
+
+    /**
+     * Method to resolve triangle
+     *
+     * @param partner which partner is being resolved
+     * @param triangle the triangle in resolution
+     * @param births births bucket
+     * @param marriages marriages bucket
+     * @param composite_measure composite measure
+     * @throws BucketException
+     */
+    private void resolveTriangle(String partner, Long[] triangle, IBucket births, IBucket marriages, LXPMeasure composite_measure) throws BucketException {
+        boolean isDeleted = false;
+        LXP[] tempKids = {(LXP) births.getObjectById(triangle[0]), (LXP) marriages.getObjectById(triangle[1]), (LXP) births.getObjectById(triangle[2])};
+        String[] stds = {tempKids[0].getString(Birth.STANDARDISED_ID), tempKids[1].getString(Marriage.STANDARDISED_ID), tempKids[2].getString(Birth.STANDARDISED_ID)};
+
+        for (int i = 0; i < triangle.length; i += 2) {
+            //5. Check names
+            if (!isDeleted && getDistance(tempKids[i], tempKids[1], composite_measure) > NAME_THRESHOLD) {
+                deleteLink(bridge, stds[i], stds[1], "Child-" + partner, deletionPredicates[5], BM_ID_QUERY_DEL_PROV);
+            }
+        }
+    }
+
+    /**
+     * Method to locate all open triangles in the database
+     *
+     * @param bridge Neo4j Bridge
+     * @param partner which partner in marriage to get
+     * @return List of open triangle clusters
+     */
+    private List<Long[]> findIllegalBirthMarriageTriangles(NeoDbCypherBridge bridge, String partner) {
+        final String BIRTH_MARRIAGE_TRIANGLE_QUERY = String.format("MATCH (x:Birth)-[:ID {actors: \"Child-%1$s\"}]-(y:Marriage)-[:ID {actors: \"Child-%1$s\"}]-(z:Birth)\n" +
+                "WHERE id(x) < id(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)\n" +
+                "RETURN x, y, z", partner);
+
+        //run query to get all open triangles
+        Result result = bridge.getNewSession().run(BIRTH_MARRIAGE_TRIANGLE_QUERY);
+        List<Long[]> triangles = new ArrayList<>();
+        result.stream().forEach(r -> {
+            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
+            long y = ((Node) r.asMap().get("y")).get("STORR_ID").asLong();
+            long z = ((Node) r.asMap().get("z")).get("STORR_ID").asLong();
+
+            Long[] tempList = {x, y, z};
+            triangles.add(tempList);
+        });
+
+        return triangles;
+    }
+
+    /**
+     * Method to get distance between names of groom/bride
+     *
+     * @param base_measure base measure
+     * @param partner which partner to measure distance
+     * @return distance between birth and marriage
+     */
+    protected LXPMeasure getCompositeMeasureBirthMarriage(StringMeasure base_measure, String partner) {
+        final List<Integer> LINKAGE_FIELDS_BIRTH = list(
+                Birth.FORENAME,
+                Birth.SURNAME
+        );
+
+        final List<Integer> LINKAGE_FIELDS_MARRIAGE;
+
+        if(Objects.equals(partner, "Groom")){
+            LINKAGE_FIELDS_MARRIAGE = list(
+                    Marriage.GROOM_FORENAME,
+                    Marriage.GROOM_SURNAME
+            );
+        }else{
+            LINKAGE_FIELDS_MARRIAGE = list(
+                    Marriage.BRIDE_FORENAME,
+                    Marriage.BRIDE_SURNAME
+            );
+        }
+
+        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS_BIRTH, LINKAGE_FIELDS_MARRIAGE);
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthParentsMarriageIDOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthParentsMarriageIDOpenTriangleResolver.java
new file mode 100644
index 00000000..b7c82a2f
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/BirthParentsMarriageIDOpenTriangleResolver.java
@@ -0,0 +1,87 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BirthParentsMarriageAccuracy;
+
+import java.util.*;
+
+public class BirthParentsMarriageIDOpenTriangleResolver extends IdentityOpenTriangleResolver {
+    private final String BMP_SUPPORTED_TRIANGLE = "MATCH (a:Birth)-[:SIBLING]-(b:Birth)-[r:ID {actors: $actor}]-(m:Marriage),\n" +
+            "(a)-[:ID {actors: $actor}]-(m1:Marriage)-[:ID {actors: $actor}]-(b)\n" +
+            "WHERE NOT (a)-[:ID {actors: $actor}]-(m) AND a <> b AND m <> m1 AND NOT (m)-[:ID]-(m1)\n" +
+            "MERGE (b)-[:DELETED { provenance: $prov, actors: $actor } ]-(m)";
+    private final String BMP_DOUBLE_RECORD = "MATCH (m1:Marriage)-[r:ID]-(b:Birth)-[s:ID]-(m2:Marriage)\n" +
+            "WHERE m1.GROOM_SURNAME <> m2.GROOM_SURNAME and m1.BRIDE_SURNAME <> m2.BRIDE_SURNAME and m1 <> m2 AND (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\") AND (s.actors = \"Child-Father\" OR s.actors = \"Child-Mother\") and s.distance > r.distance and not (m2)-[:ID]-(m1)\n" +
+            "MERGE (b)-[:DELETED { provenance: $prov, actors: $actor } ]-(m2)";
+
+    //Names of predicates to be used as prov
+    private static final String[] deletionPredicates = {"supported_triangle", "double_record"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+
+        if(args.length != 1){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new BirthParentsMarriageIDOpenTriangleResolver(sourceRepo);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public BirthParentsMarriageIDOpenTriangleResolver(String sourceRepo) throws BucketException {
+        super(sourceRepo);
+
+        String[] partners = {"Father", "Mother"};
+        String[] partnersGT = {"Father-Groom", "Mother-Bride"};
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Marriage"); //get number of triangles before resolution
+        new BirthParentsMarriageAccuracy(bridge);
+
+        //run through all graph predicates
+        System.out.println("Running graph predicates...");
+        String[] graphPredicates = {BMP_SUPPORTED_TRIANGLE, BMP_DOUBLE_RECORD};
+        for (String partner : partners) {
+            for (int i = 0; i < graphPredicates.length; i++) {
+                try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
+                    Map<String, Object> parameters = getCreationParameterMap(null, null, deletionPredicates[i], "Child-" + partner);
+                    tx.run(graphPredicates[i], parameters);
+                    tx.commit();
+                } catch (Exception e) {
+                    throw new RuntimeException(e);
+                }
+            }
+        }
+
+        System.out.println("After");
+        System.out.println("\n");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        for (String partner : partnersGT) {
+            System.out.println("\n" + partner + " efficacy:");
+            pef.countIDEfficacyDel(deletionPredicates, "Birth", "Marriage", partner);
+        }
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Birth", "Marriage"); //get number of triangles before resolution
+        new BirthParentsMarriageAccuracy(bridge);
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/DeathDeathOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/DeathDeathOpenTriangleResolver.java
new file mode 100644
index 00000000..3018c5dd
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/DeathDeathOpenTriangleResolver.java
@@ -0,0 +1,480 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import org.neo4j.driver.types.Node;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.DeathSiblingBundleBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.DeathDeathSiblingAccuracy;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.DeathSiblingLinkageRecipe;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+
+import java.time.LocalDate;
+import java.time.temporal.ChronoUnit;
+import java.util.*;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+import java.util.stream.Collectors;
+
+public class DeathDeathOpenTriangleResolver extends SiblingOpenTriangleResolver {
+    //Cypher queries used in predicates
+    private final String DD_SIBLING_QUERY_DEL_PROV = "MATCH (a:Death), (b:Death) WHERE a.STANDARDISED_ID = $standard_id_from AND b.STANDARDISED_ID = $standard_id_to MERGE (a)-[r:DELETED { provenance: $prov } ]-(b)";
+    private final String DD_ISO = "MATCH (b1:Birth)-[:SIBLING]-(b2:Birth)-[:SIBLING]-(b3:Birth),\n" +
+            "(d1:Death)-[:SIBLING]-(d2:Death)-[:SIBLING]-(d3:Death),\n" +
+            "(b1)-[:SIBLING]-(b3),\n" +
+            "(b1)-[:ID]-(d1),\n" +
+            "(b2)-[:ID]-(d2),\n" +
+            "(b3)-[:ID]-(d3)\n" +
+            "WHERE NOT (d1)-[:SIBLING]-(d3)\n" +
+            "MERGE (d1)-[r:SIBLING { provenance: \"dd_iso\",actors: \"Deceased-Deceased\" } ]-(d3)";
+    private final String DD_SIB_ISO = "MATCH (b1:Death)-[:SIBLING]-(d:Birth),\n" +
+            "(b2:Death)-[:SIBLING]-(d),\n" +
+            "(b1:Death)-[:ID]-(d1:Birth),\n" +
+            "(b2:Death)-[:ID]-(d2:Birth),\n" +
+            "(d)-[:SIBLING]-(d1)-[:SIBLING]-(d2)\n" +
+            "WHERE NOT (b1)-[:SIBLING]-(b2) and not (b1)-[:SIBLING]-(d1) and not (b2)-[:SIBLING]-(d2)\n" +
+            "MERGE (b1)-[r:SIBLING { provenance: \"dd_sib_iso\", actors: \"Deceased-Deceased\" } ]-(b2)";
+
+    //Names of predicates to be used as prov
+    private final String[] creationPredicates = {"dd_iso", "dd_sib_iso"};
+    private final String[] deletionPredicates = {"max_age_range", "min_b_interval", "birthplace_mode", "bad_m_date", "msed"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+        String numberOfRecords = args[1]; // e.g. EVERYTHING or 10000 etc.
+
+        if(args.length != 2){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new DeathDeathOpenTriangleResolver(sourceRepo, numberOfRecords);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+
+    }
+
+    public DeathDeathOpenTriangleResolver(String sourceRepo, String numberOfRecords) throws BucketException, InterruptedException {
+        super(sourceRepo);
+        IBucket deaths = record_repository.getBucket("death_records");
+        DeathSiblingLinkageRecipe recipe = new DeathSiblingLinkageRecipe(sourceRepo, numberOfRecords, DeathSiblingBundleBuilder.class.getName());
+        int availableProcessors = Runtime.getRuntime().availableProcessors();
+        ExecutorService executorService = Executors.newFixedThreadPool(availableProcessors);
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Death", "Death");
+        new DeathDeathSiblingAccuracy(bridge);
+
+        //Run all graph predicates
+        System.out.println("Running graph predicates...");
+        String[] graphPredicates = {DD_ISO, DD_SIB_ISO};
+        for (int i = 0; i < graphPredicates.length; i++) {
+            try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
+                tx.run(graphPredicates[i]);
+                tx.commit();
+            } catch (Exception e) {
+                throw new RuntimeException(e);
+            }
+        }
+
+        System.out.println("Locating triangles...");
+        List<OpenTriangleClusterDD> triangles = findIllegalDeathDeathSiblingTriangles(bridge, sourceRepo);
+        System.out.println("Triangle clusters found: " + triangles.size());
+
+        System.out.println("Resolving triangles with MSED...");
+        for (OpenTriangleClusterDD cluster : triangles) {
+            executorService.submit(() ->
+                {
+                    try {
+                        resolveTrianglesMSED(cluster.getTriangleChain(), cluster.x, recipe, deletionPredicates[4], Death.STANDARDISED_ID, DD_SIBLING_QUERY_DEL_PROV);
+                    } catch (BucketException e) {
+                        throw new RuntimeException(e);
+                    }
+                }
+            );
+        }
+
+        System.out.println("Resolving triangles with predicates...");
+        for (OpenTriangleCluster cluster : triangles) {
+            executorService.submit(() ->
+                {
+                    try {
+                        resolveTrianglesPredicates(cluster, deaths);
+                    } catch (BucketException e) {
+                        throw new RuntimeException(e);
+                    }
+                }
+            );
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(1, TimeUnit.HOURS);
+
+        System.out.println("After");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        System.out.println("Death-Death");
+        pef.countSiblingEfficacy(creationPredicates, deletionPredicates, "Death", "Death");
+        PatternsCounter.countOpenTrianglesToString(bridge, "Death", "Death");
+        new DeathDeathSiblingAccuracy(bridge);
+    }
+
+    /**
+     * Method to resolve open triangles using logical predicates
+     *
+     * @param cluster cluster of open triangles to resolve
+     * @param deaths deaths bucket
+     * @throws BucketException
+     */
+    private void resolveTrianglesPredicates(OpenTriangleCluster cluster, IBucket deaths) throws BucketException {
+        for (List<Long> chain : cluster.getTriangleChain()){ //loop through each chain of open triangles in cluster
+            LXP[] tempKids = {(LXP) deaths.getObjectById(cluster.x), (LXP) deaths.getObjectById(chain.get(0)), (LXP) deaths.getObjectById(chain.get(1))};
+
+            cluster.getYearStatistics();
+            boolean hasChanged = false;
+
+            //1. Check age of child not outside of max difference
+            hasChanged = maxRangePredicate(cluster, tempKids, hasChanged, 0);
+
+            //2. check DOB at least 9 months away from rest
+            hasChanged = minBirthIntervalPredicate(cluster, tempKids, hasChanged, 1);
+
+            //3. Get mode of birthplace
+            hasChanged = mostCommonBirthPlacePredicate(cluster, hasChanged, tempKids, 2);
+        }
+    }
+
+    /**
+     * Method to locate all open triangles in the database
+     *
+     * @param bridge Neo4j Bridge
+     * @return List of open triangle clusters
+     */
+    private List<OpenTriangleClusterDD> findIllegalDeathDeathSiblingTriangles(NeoDbCypherBridge bridge, String recordRepo) {
+        final String DEATH_SIBLING_TRIANGLE_QUERY = "MATCH (x:Death)-[:SIBLING]-(y:Death)-[:SIBLING]-(z:Death)\n"+
+                "WHERE NOT (x)-[:SIBLING]-(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)\n" +
+                "RETURN x, collect([y, z]) AS openTriangles";
+
+        //run query to get all open triangles
+        Result result = bridge.getNewSession().run(DEATH_SIBLING_TRIANGLE_QUERY);
+        List<OpenTriangleClusterDD> clusters = new ArrayList<>();
+        List<List<Long>> temp = new ArrayList<>();
+
+        //loop through each cluster
+        result.stream().forEach(r -> {
+            long x = ((Node) r.asMap().get("x")).get("STORR_ID").asLong();
+            List<List<Node>> openTrianglesNodes = (List<List<Node>>) r.asMap().get("openTriangles");
+
+            for (List<Node> innerList : openTrianglesNodes) {
+                List<Long> openTriangleList = innerList.stream()
+                        .map(obj -> {
+                            if (obj instanceof Node) {
+                                return ((Node) obj).get("STORR_ID").asLong();
+                            } else {
+                                throw new IllegalArgumentException("Expected a Node but got: " + obj.getClass());
+                            }
+                        })
+                        .collect(Collectors.toList());
+
+                temp.add(openTriangleList); //add triangles to a temporary list
+
+                if (temp.size() == 360) { //limit number of triangles in cluster
+                    clusters.add(new OpenTriangleClusterDD(x, new ArrayList<>(temp), recordRepo));
+                    temp.clear();
+                }
+            }
+
+            if (!temp.isEmpty()) { //if not reached limit, create a cluster object with whatever is left
+                clusters.add(new OpenTriangleClusterDD(x, new ArrayList<>(temp), recordRepo));
+                temp.clear();
+            }
+        });
+
+        return clusters;
+    }
+
+    /**
+     * Predicate to resolve triangles based on the maximum age range two siblings can have
+     * If a record's birthday is more than MAX_AGE_DIFFERENCE away from its link or the median of the cluster
+     * then it is deleted
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean maxRangePredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber) {
+        String std_id_x = tempKids[0].getString(Death.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Death.STANDARDISED_ID);
+
+        //Check if record x is outside of range
+        if(!Objects.equals(tempKids[0].getString(Death.DATE_OF_BIRTH), "--/--/----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[0].getString(Death.DATE_OF_BIRTH).substring(6))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) - Integer.parseInt(tempKids[0].getString(Death.DATE_OF_BIRTH).substring(6))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record z is outside of range
+        } else if (!Objects.equals(tempKids[2].getString(Death.DATE_OF_BIRTH), "--/--/----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt(tempKids[2].getString(Death.DATE_OF_BIRTH).substring(6))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))- Integer.parseInt(tempKids[2].getString(Death.DATE_OF_BIRTH).substring(6))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record y is outside of range compared to x
+        } else if (!Objects.equals(tempKids[0].getString(Death.DATE_OF_BIRTH), "--/--/----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----")  &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) - Integer.parseInt(tempKids[0].getString(Death.DATE_OF_BIRTH).substring(6))) > MAX_AGE_DIFFERENCE)) {
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+
+        //Check if record y is outside of range compared to z
+        } else if (!Objects.equals(tempKids[2].getString(Death.DATE_OF_BIRTH), "--/--/----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----")  &&
+                (Math.abs(cluster.getYearMedian() - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6))) > MAX_AGE_DIFFERENCE ||
+                Math.abs(Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) - Integer.parseInt(tempKids[2].getString(Death.DATE_OF_BIRTH).substring(6))) > MAX_AGE_DIFFERENCE)){
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Predicate to resolve triangles based on a minimum birth interval between two records
+     * Either the interval between two connected records needs to be above BIRTH_INTERVAL
+     * Or the interval between two closest siblings based on the birthday inside the cluster needs to be above BIRTH_INTERVAL
+     *
+     * Code for finding closest date has been amended from https://stackoverflow.com/a/67767630
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean minBirthIntervalPredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber) {
+        String std_id_x = tempKids[0].getString(Death.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Death.STANDARDISED_ID);
+
+        for (int i = 0; i < tempKids.length; i+=2) {
+            try{
+                LocalDate childDate = getBirthdayAsDate(tempKids[i], true); //get birth date of node being analysed
+                LocalDate dateY = getBirthdayAsDate(tempKids[1], true); //get birth date of middle node
+                if(!hasChanged && Math.abs(ChronoUnit.DAYS.between(dateY, childDate)) < BIRTH_INTERVAL && Math.abs(ChronoUnit.DAYS.between(dateY, childDate)) > 2){
+                    if(i == 0){
+                        deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+                    }else{
+                        deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+                    }
+                    hasChanged = true;
+                }
+            }catch (Exception e){
+
+            }
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Predicate to resolve triangles based on most common birthplace. If neighbouring node and birthplace mode of cluster don't match
+     * record, then delete link
+     *
+     * @param cluster cluster of open triangles
+     * @param tempKids three children in the open triangle
+     * @param hasChanged check if triangle already resolved
+     * @param predNumber index of predicate name
+     * @return if triangle has been resolved
+     */
+    @Override
+    protected boolean mostCommonBirthPlacePredicate(OpenTriangleCluster cluster, boolean hasChanged, LXP[] tempKids, int predNumber) {
+        int MIN_FAMILY_SIZE = 3;
+        String std_id_x = tempKids[0].getString(Death.STANDARDISED_ID);
+        String std_id_y = tempKids[1].getString(Death.STANDARDISED_ID);
+        String std_id_z = tempKids[2].getString(Death.STANDARDISED_ID);
+
+        if(!hasChanged &&
+                !Objects.equals(tempKids[1].getString(Death.PLACE_OF_DEATH), "----") &&
+                !Objects.equals(tempKids[0].getString(Death.PLACE_OF_DEATH), "----") &&
+                ((!Objects.equals(tempKids[1].getString(Death.AGE_AT_DEATH), "") && Integer.parseInt(tempKids[1].getString(Death.AGE_AT_DEATH)) < cluster.getAgeRange() / 2) ||
+                (!Objects.equals(tempKids[1].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                        Integer.parseInt(tempKids[1].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) < cluster.getAgeRange() / 2)) &&
+                ((!Objects.equals(tempKids[0].getString(Death.AGE_AT_DEATH), "") && Integer.parseInt(tempKids[0].getString(Death.AGE_AT_DEATH)) < cluster.getAgeRange() / 2) ||
+                (!Objects.equals(tempKids[0].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[0].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                    Integer.parseInt(tempKids[0].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[0].getString(Death.DATE_OF_BIRTH)).substring(6)) < cluster.getAgeRange() / 2)) &&
+                !Objects.equals(tempKids[0].getString(Death.PLACE_OF_DEATH), tempKids[1].getString(Death.PLACE_OF_DEATH)) && !Objects.equals(tempKids[0].getString(Death.PLACE_OF_DEATH), cluster.getMostCommonBirthplace()) && cluster.getNumOfChildren() > MIN_FAMILY_SIZE){
+
+            deleteLink(bridge, std_id_x, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        } else if (!hasChanged &&
+        !Objects.equals(tempKids[1].getString(Death.PLACE_OF_DEATH), "----") &&
+                !Objects.equals(tempKids[2].getString(Death.PLACE_OF_DEATH), "----") &&
+                ((!Objects.equals(tempKids[1].getString(Death.AGE_AT_DEATH), "") && Integer.parseInt(tempKids[1].getString(Death.AGE_AT_DEATH)) < cluster.getAgeRange() / 2) ||
+                        (!Objects.equals(tempKids[1].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[1].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                                Integer.parseInt(tempKids[1].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[1].getString(Death.DATE_OF_BIRTH)).substring(6)) < cluster.getAgeRange() / 2)) &&
+                ((!Objects.equals(tempKids[2].getString(Death.AGE_AT_DEATH), "") && Integer.parseInt(tempKids[2].getString(Death.AGE_AT_DEATH)) < cluster.getAgeRange() / 2) ||
+                        (!Objects.equals(tempKids[2].getString(Death.DEATH_YEAR), "----") && !Objects.equals(tempKids[2].getString(Death.DATE_OF_BIRTH), "--/--/----") &&
+                                Integer.parseInt(tempKids[2].getString(Death.DEATH_YEAR)) - Integer.parseInt((tempKids[2].getString(Death.DATE_OF_BIRTH)).substring(6)) < cluster.getAgeRange() / 2)) &&
+                !Objects.equals(tempKids[2].getString(Death.PLACE_OF_DEATH), tempKids[1].getString(Death.PLACE_OF_DEATH)) && !Objects.equals(tempKids[2].getString(Death.PLACE_OF_DEATH), cluster.getMostCommonBirthplace()) && cluster.getNumOfChildren() > MIN_FAMILY_SIZE){
+
+            deleteLink(bridge, std_id_z, std_id_y, deletionPredicates[predNumber], DD_SIBLING_QUERY_DEL_PROV);
+            hasChanged = true;
+        }
+
+        return hasChanged;
+    }
+
+    /**
+     * Method to clean and standardise strings
+     *
+     * @param bs triangle to clean
+     */
+    @Override
+    protected void cleanStrings(List<LXP> bs) {
+        int[] fields = {Death.FATHER_FORENAME, Death.MOTHER_FORENAME, Death.FATHER_SURNAME, Death.MOTHER_MAIDEN_SURNAME};
+
+        for (int i = 0; i < bs.size(); i++) {
+            //1. DOTTER/SON
+            String dotterRegex = "D[.:ORT](?!.*D[.:RT])";
+            Pattern pattern = Pattern.compile(dotterRegex);
+            Matcher matcher = pattern.matcher(bs.get(i).getString(Death.MOTHER_MAIDEN_SURNAME));
+            if (matcher.find()) {
+                String newString = bs.get(i).getString(Death.MOTHER_MAIDEN_SURNAME).substring(0, matcher.start()) + "DOTTER";
+                bs.get(i).put(Death.MOTHER_MAIDEN_SURNAME, newString);
+            }
+
+            String sonRegex = "S[.]";
+            pattern = Pattern.compile(sonRegex);
+            matcher = pattern.matcher(bs.get(i).getString(Death.FATHER_SURNAME));
+            if (matcher.find()) {
+                String newString = bs.get(i).getString(Death.FATHER_SURNAME).substring(0, matcher.start()) + "SON";
+                bs.get(i).put(Death.FATHER_SURNAME, newString);
+            }
+
+            //2. Initials or incomplete names
+            String initialRegex = "^[A-Z]*\\.$";
+            pattern = Pattern.compile(initialRegex);
+            for (int j = 0; j < fields.length - 3; j++) {
+                matcher = pattern.matcher(bs.get(i).getString(fields[j]));
+
+                if(matcher.find()) {
+                    String substringX = bs.get(0).getString(fields[j]).length() >= matcher.end() - 1 ? bs.get(0).getString(fields[j]).substring(matcher.start(), matcher.end() - 1) : bs.get(0).getString(j);
+                    String substringY = bs.get(1).getString(fields[j]).length() >= matcher.end() - 1 ? bs.get(1).getString(fields[j]).substring(matcher.start(), matcher.end() - 1) : bs.get(1).getString(j);
+                    String substringZ = bs.get(2).getString(fields[j]).length() >= matcher.end() - 1 ? bs.get(2).getString(fields[j]).substring(matcher.start(), matcher.end() - 1) : bs.get(2).getString(j);
+
+                    if (i == 0 && substringX.equals(substringY) && substringX.equals(substringZ)) {
+                        bs.get(0).put(fields[j], bs.get(0).getString(fields[j]).replace(".", ""));
+                        bs.get(1).put(fields[j], bs.get(0).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                        bs.get(2).put(fields[j], bs.get(0).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                    } else if (i == 1 && substringY.equals(substringX) && substringY.equals(substringZ)) {
+                        bs.get(1).put(fields[j], bs.get(1).getString(fields[j]).replace(".", ""));
+                        bs.get(0).put(fields[j], bs.get(1).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                        bs.get(2).put(fields[j], bs.get(1).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                    } else if (i == 2 && substringZ.equals(substringX) && substringZ.equals(substringY)) {
+                        bs.get(2).put(fields[j], bs.get(2).getString(fields[j]).replace(".", ""));
+                        bs.get(0).put(fields[j], bs.get(2).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                        bs.get(1).put(fields[j], bs.get(2).getString(fields[j]).substring(matcher.start(), matcher.end() - 1));
+                    }
+                }
+            }
+
+            //3. Middle names and double barrel surnames
+            for (int field : fields) {
+                if (bs.get(i).getString(field).contains(" ")) {
+                    if (i == 0 && !bs.get(2).getString(field).contains(" ")) {
+                        String[] names = bs.get(0).getString(field).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(bs.get(2).getString(field))) {
+                                bs.get(0).put(field, name);
+                                break;
+                            }
+                        }
+                    } else if(i == 1 && (!bs.get(0).getString(field).contains(" ") || !bs.get(2).getString(field).contains(" "))) {
+                        String[] names = bs.get(1).getString(field).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(bs.get(0).getString(field))) {
+                                bs.get(1).put(field, name);
+                                break;
+                            }
+                        }
+                        for (String name : names) {
+                            if (name.equals(bs.get(2).getString(field))) {
+                                bs.get(1).put(field, name);
+                                break;
+                            }
+                        }
+                    } else if(i == 2 && !bs.get(0).getString(field).contains(" ")) {
+                        String[] names = bs.get(2).getString(field).split("\\s+");
+                        for (String name : names) {
+                            if (name.equals(bs.get(0).getString(field))) {
+                                bs.get(2).put(field, name);
+                                break;
+                            }
+                        }
+                    }
+                }
+            }
+
+            //4. Parentheses
+            for (int field : fields) {
+                String parenthesesRegex = "\\(([^)]+)\\)";
+                pattern = Pattern.compile(parenthesesRegex);
+                matcher = pattern.matcher(bs.get(i).getString(field));
+
+                if (matcher.find() && matcher.start() > 0) {
+                    String newString = bs.get(i).getString(field).substring(0, matcher.start()).strip();
+                    bs.get(i).put(field, newString);
+                }
+            }
+        }
+    }
+
+    /**
+     * Method to get death objects based on storr IDs
+     *
+     * @param sibling_ids ids of records to find
+     * @param record_repository repository of where records stored
+     * @return list of death objects
+     * @throws BucketException
+     */
+    @Override
+    protected List<LXP> getRecords(List<Long> sibling_ids, RecordRepository record_repository) throws BucketException {
+        IBucket<Death> deaths = record_repository.getBucket("death_records");
+        ArrayList<LXP> bs = new ArrayList();
+
+        for (int i = 0; i < sibling_ids.size(); i++) {
+            bs.add(deaths.getObjectById(sibling_ids.get(i)));
+        }
+
+        return bs;
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/IdentityOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/IdentityOpenTriangleResolver.java
new file mode 100644
index 00000000..9a9e459b
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/IdentityOpenTriangleResolver.java
@@ -0,0 +1,79 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.Store;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+
+import java.util.*;
+
+public abstract class IdentityOpenTriangleResolver {
+    protected NeoDbCypherBridge bridge;
+    protected RecordRepository record_repository;
+
+    protected final int MIN_MARRIAGE_AGE = 15;
+    protected final int MAX_MARRIAGE_AGE = 60;
+
+    public IdentityOpenTriangleResolver(String sourceRepo) {
+        bridge = Store.getInstance().getBridge();
+        record_repository= new RecordRepository(sourceRepo);
+    }
+
+    /**
+     * Method to create a delete link between two records, used in testing
+     *
+     * @param bridge Neo4j bridge
+     * @param std_id_x standardised id of record x
+     * @param std_id_y standardised id of record y
+     */
+    protected void deleteLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_y, String actor, String prov, String query){
+        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
+            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_y, prov, actor);
+            tx.run(query, parameters);
+            tx.commit();
+        }
+    }
+
+    /**
+     * Method to get map of parameters to be used in cypher queries
+     *
+     * @param standard_id_from record ID to link from
+     * @param standard_id_to record ID to link to
+     * @param prov provenance of resolver
+     * @return map of parameters
+     */
+    protected Map<String, Object> getCreationParameterMap(String standard_id_from, String standard_id_to, String prov, String actor) {
+        Map<String, Object> parameters = new HashMap<>();
+        if(standard_id_from != null && standard_id_to != null) {
+            parameters.put("standard_id_from", standard_id_from);
+            parameters.put("standard_id_to", standard_id_to);
+        }
+        parameters.put("prov", prov);
+        parameters.put("actor", actor);
+        return parameters;
+    }
+
+    protected double getDistance(LXP id1, LXP id2, LXPMeasure composite_measure) throws BucketException {
+        return composite_measure.distance(id1, id2);
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/MarriageParentsMarriageIDOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/MarriageParentsMarriageIDOpenTriangleResolver.java
new file mode 100644
index 00000000..3d7d15b6
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/MarriageParentsMarriageIDOpenTriangleResolver.java
@@ -0,0 +1,119 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.BrideMarriageParentsMarriageAccuracy;
+import uk.ac.standrews.cs.population_linkage.linkageAccuracy.GroomMarriageParentsMarriageAccuracy;
+
+import java.util.Map;
+
+public class MarriageParentsMarriageIDOpenTriangleResolver extends IdentityOpenTriangleResolver {
+    private final String MMP_ISO_B = "MATCH (b1:Birth)-[:SIBLING]-(b2:Birth)-[:SIBLING]-(b3:Birth),\n" +
+            "(b3)-[:SIBLING]-(b1),\n" +
+            "(m:Marriage)-[r:ID]-(b1),\n" +
+            "(m)-[s:ID]-(b2),\n" +
+            "(m)-[t:ID]-(b3),\n" +
+            "(m1:Marriage)-[u:ID]-(b1),\n" +
+            "(m2:Marriage)-[v:ID]-(b2),\n" +
+            "(m3:Marriage)-[w:ID]-(b3),\n" +
+            "(m1)-[:SIBLING]-(m2)-[:SIBLING]-(m3)\n" +
+            "WHERE (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\")\n" +
+            "AND (s.actors = \"Child-Father\" OR s.actors = \"Child-Mother\") AND (t.actors = \"Child-Father\"\n" +
+            "or t.actors = \"Child-Mother\")\n" +
+            "AND NOT (m1)-[:SIBLING]-(b1) AND (u.actors = \"Child-Groom\" OR u.actors = \"Child-Bride\")\n" +
+            "AND NOT (m2)-[:SIBLING]-(b2) AND (v.actors = \"Child-Groom\" OR v.actors = \"Child-Bride\")\n" +
+            "AND NOT (m3)-[:SIBLING]-(b3) AND (w.actors = \"Child-Bride\")\n" +
+            "AND NOT (m3)-[:ID]-(m)\n" +
+            "MERGE (m3)-[:ID { provenance: $prov, actors: $actor } ]-(m)";
+    private final String MMP_ISO_G = "MATCH (b1:Birth)-[:SIBLING]-(b2:Birth)-[:SIBLING]-(b3:Birth),\n" +
+            "(b3)-[:SIBLING]-(b1),\n" +
+            "(m:Marriage)-[r:ID]-(b1),\n" +
+            "(m)-[s:ID]-(b2),\n" +
+            "(m)-[t:ID]-(b3),\n" +
+            "(m1:Marriage)-[u:ID]-(b1),\n" +
+            "(m2:Marriage)-[v:ID]-(b2),\n" +
+            "(m3:Marriage)-[w:ID]-(b3),\n" +
+            "(m1)-[:SIBLING]-(m2)-[:SIBLING]-(m3)\n" +
+            "WHERE (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\")\n" +
+            "AND (s.actors = \"Child-Father\" OR s.actors = \"Child-Mother\") AND (t.actors = \"Child-Father\"\n" +
+            "or t.actors = \"Child-Mother\")\n" +
+            "AND NOT (m1)-[:SIBLING]-(b1) AND (u.actors = \"Child-Groom\" OR u.actors = \"Child-Bride\")\n" +
+            "AND NOT (m2)-[:SIBLING]-(b2) AND (v.actors = \"Child-Groom\" OR v.actors = \"Child-Bride\")\n" +
+            "AND NOT (m3)-[:SIBLING]-(b3) AND (w.actors = \"Child-Groom\")\n" +
+            "AND NOT (m3)-[:ID]-(m)\n" +
+            "MERGE (m3)-[:ID { provenance: $prov, actors: $actor } ]-(m)";
+
+    //Names of predicates to be used as prov
+    private static final String[] creationPredicates = {"iso"};
+
+    public static void main(String[] args) throws BucketException {
+        String sourceRepo = args[0]; // e.g. umea
+
+        if(args.length != 1){
+            throw new IllegalArgumentException("Invalid number of arguments");
+        }
+
+        try {
+            new MarriageParentsMarriageIDOpenTriangleResolver(sourceRepo);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public MarriageParentsMarriageIDOpenTriangleResolver(String sourceRepo) throws BucketException {
+        super(sourceRepo);
+
+        System.out.println("Before");
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Marriage", "Marriage"); //get number of triangles before resolution
+        new GroomMarriageParentsMarriageAccuracy(bridge);
+        new BrideMarriageParentsMarriageAccuracy(bridge);
+
+        String[] partners = {"Groom", "Bride"};
+
+        //run through all graph predicates
+        System.out.println("Running graph predicates...");
+        String[] graphPredicates = {MMP_ISO_G, MMP_ISO_B};
+        for (String partner : partners) {
+            try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
+                if(partner.equals("Groom")){
+                    Map<String, Object> parameters = getCreationParameterMap(null, null, creationPredicates[0], partner + "-Couple");
+                    tx.run(graphPredicates[0], parameters);
+                }else{
+                    Map<String, Object> parameters = getCreationParameterMap(null, null, creationPredicates[0], partner + "-Couple");
+                    tx.run(graphPredicates[1], parameters);
+                }
+                tx.commit();
+            } catch (Exception e) {
+                throw new RuntimeException(e);
+            }
+        }
+
+        System.out.println("After");
+        System.out.println("\n");
+        PredicateEfficacy pef = new PredicateEfficacy(); //get efficacy of each predicate
+        for (String partner : partners) {
+            System.out.println("\n" + partner + " efficacy:");
+            pef.countIDEfficacyCreate(creationPredicates, "Marriage", "Marriage", partner + "-Couple");
+        }
+        PatternsCounter.countOpenTrianglesToStringID(bridge, "Marriage", "Marriage"); //get number of triangles before resolution
+        new GroomMarriageParentsMarriageAccuracy(bridge);
+        new BrideMarriageParentsMarriageAccuracy(bridge);
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleCluster.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleCluster.java
new file mode 100644
index 00000000..49c75d95
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleCluster.java
@@ -0,0 +1,75 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+
+import java.time.LocalDate;
+import java.util.*;
+
+public abstract class OpenTriangleCluster {
+    public final long x;
+    public List<List<Long>> triangleChain = new ArrayList<>();
+    protected Set<LXP> children = new HashSet<LXP>();
+    protected Map<String, LocalDate> birthDays = new HashMap<String, LocalDate>();
+    protected Map<String, Integer> birthplaceMap = new HashMap<String, Integer>();
+    protected double yearTotal = 0;
+    protected int ageRange;
+    protected double yearAvg;
+    protected int yearMedian;
+    protected String mostCommonBirthplace = null;
+
+    public OpenTriangleCluster(long x, List<List<Long>>  triangleChain) {
+        this.x = x;
+        this.triangleChain = triangleChain;
+    }
+
+    public String toString() {
+        return "X = " + x;
+    }
+
+    public List<List<Long>> getTriangleChain() {
+        return triangleChain;
+    }
+
+    public abstract void getYearStatistics() throws BucketException;
+
+    public int getAgeRange() {
+        return ageRange;
+    }
+
+    public double getYearAvg() {
+        return yearAvg;
+    }
+
+    public double getNumOfChildren() {
+        return children.size();
+    }
+
+    public Map<String, LocalDate> getBirthDays() {
+        return birthDays;
+    }
+
+    public double getYearMedian() {
+        return yearMedian;
+    }
+
+    public String getMostCommonBirthplace() {
+        return mostCommonBirthplace;
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/OpenTriangleClusterBB.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterBB.java
similarity index 50%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/aleks/OpenTriangleClusterBB.java
rename to src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterBB.java
index 0f7a727d..01995a43 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/OpenTriangleClusterBB.java
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterBB.java
@@ -14,80 +14,81 @@
  * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
  * <http://www.gnu.org/licenses/>.
  */
-package uk.ac.standrews.cs.population_linkage.aleks;
+package uk.ac.standrews.cs.population_linkage.resolvers;
 
 import uk.ac.standrews.cs.neoStorr.impl.LXP;
 import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
 import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
 import uk.ac.standrews.cs.population_records.RecordRepository;
 import uk.ac.standrews.cs.population_records.record_types.Birth;
-import uk.ac.standrews.cs.population_records.record_types.Death;
 
 import java.time.LocalDate;
 import java.util.*;
 
-/**
- * Used to encode unmatched triangles with nodes x and y and z
- * x and y are xy_distance apart, y and z are yz_distance apart
- * but xz is not connected.
- * All the ids are storr ids of Nodes.
- */
-public class OpenTriangleClusterBB {
-    public final long x;
-    public List<List<Long>> triangleChain = new ArrayList<>();
-    private Set<LXP> children = new HashSet<LXP>();
-    private List<LocalDate> birthDays = new ArrayList<>();
-    Map<String, Integer> birthplaceMap = new HashMap<String, Integer>();
-    private double yearTotal = 0;
-    private int ageRange;
-    private double yearAvg;
-    private int yearMedian;
-    private String mostCommonBirthplace = null;
-
+public class OpenTriangleClusterBB extends OpenTriangleCluster {
     IBucket births;
 
-    public OpenTriangleClusterBB(long x, List<List<Long>>  triangleChain) {
-        RecordRepository record_repository = new RecordRepository("umea");
+    public OpenTriangleClusterBB(long x, List<List<Long>>  triangleChain, String recordRepo) {
+        super(x, triangleChain);
+        RecordRepository record_repository = new RecordRepository(recordRepo);
         births = record_repository.getBucket("birth_records");
-        this.x = x;
-        this.triangleChain = triangleChain;
-    }
-
-    public String toString() {
-        return "X = " + x;
-    }
-
-    public List<List<Long>> getTriangleChain() {
-        return triangleChain;
     }
 
-    public void getYearStatistics() throws BucketException {
-        for (List<Long> chain : triangleChain){
+    /**
+     * Method to get birth year statistics for cluster
+     */
+    @Override
+    public void getYearStatistics() throws BucketException  {
+        for (List<Long> chain : triangleChain){ //loop through each open triangle
             LXP[] tempKids = {(LXP) births.getObjectById(x), (LXP) births.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))};
-            for (int i = 0; i < tempKids.length; i++) {
-                if (!children.contains(tempKids[i])) {
+            for (int i = 0; i < tempKids.length; i++) { //loop through children in triangle
+                if (!children.contains(tempKids[i])) { //if not in children set
+                    //set default date if child has missing DOB details
                     int year = 1850;
                     int month = 1;
                     int day = 1;
 
+                    //get year if available
                     try{
                         year = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_YEAR)));
-                        month = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_MONTH)));
-                        day = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_DAY)));
                     }catch(Exception e){
                         if(!children.isEmpty()){
                             year = (int) Math.round(yearTotal/children.size());
                         }
                     }
 
-                    birthDays.add(LocalDate.of(year, month, day));
+                    //get month if available
+                    try{
+                        month = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_MONTH)));
+                    }catch(Exception e){
+                        month = -1; //if not available, set to -1 as month is too specific
+                    }
+
+                    //get day if available
+                    try{
+                        day = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_DAY)));
+                    } catch (Exception e) {
+
+                    }
+
+                    //if month is available, add to birthdays set
+                    if(month != -1){
+                        birthDays.put(tempKids[i].getString(Birth.STANDARDISED_ID), LocalDate.of(year, month, day));
+                    }
                     yearTotal += year;
+
+                    //add birth address to map for mode calculation
+                    if(!Objects.equals(tempKids[i].getString(Birth.BIRTH_ADDRESS), "----")){
+                        birthplaceMap.merge(tempKids[i].getString(Birth.BIRTH_ADDRESS), 1, Integer::sum);
+                    }
+
+                    //add child to set
+                    children.add(tempKids[i]);
                 }
-                children.add(tempKids[i]);
             }
         }
 
-        //https://deveshsharmablogs.wordpress.com/2013/07/16/find-most-common-element-in-a-list-in-java/
+        //code inspired by https://deveshsharmablogs.wordpress.com/2013/07/16/find-most-common-element-in-a-list-in-java/
         int maxValue = -1;
         for(Map.Entry<String, Integer> entry: birthplaceMap.entrySet()) {
             if(entry.getValue() > maxValue) {
@@ -96,41 +97,22 @@ public void getYearStatistics() throws BucketException {
             }
         }
 
-        Collections.sort(birthDays);
-        ageRange = birthDays.get(birthDays.size() - 1).getYear() - birthDays.get(0).getYear();
         yearAvg = yearTotal / children.size();
-        if ((birthDays.size() % 2) == 0) {
-            yearMedian = ((birthDays.get(birthDays.size() / 2)).getYear() + (birthDays.get(birthDays.size() / 2 - 1)).getYear()) / 2;
-        }else {
-            yearMedian = birthDays.get(birthDays.size() / 2).getYear();
-        }
-    }
-
-    public void removeChain(List<Long> chain) {
-        triangleChain.remove(chain);
-    }
-
-    public int getAgeRange() {
-        return ageRange;
-    }
 
-    public double getYearAvg() {
-        return yearAvg;
-    }
-
-    public double getNumOfChildren() {
-        return children.size();
-    }
-
-    public List<LocalDate> getBirthDays() {
-        return birthDays;
-    }
+        //get age range and median by sorting dates
+        List<LocalDate> sortedBirthDays = new ArrayList<>(birthDays.values());
+        Collections.sort(sortedBirthDays);
+        if(!sortedBirthDays.isEmpty()){
+            ageRange = sortedBirthDays.get(sortedBirthDays.size() - 1).getYear() - sortedBirthDays.get(0).getYear();
 
-    public double getYearMedian() {
-        return yearMedian;
-    }
-
-    public String getMostCommonBirthplace() {
-        return mostCommonBirthplace;
+            if ((sortedBirthDays.size() % 2) == 0) {
+                yearMedian = ((sortedBirthDays.get(sortedBirthDays.size() / 2)).getYear() + (sortedBirthDays.get(sortedBirthDays.size() / 2 - 1)).getYear()) / 2;
+            }else {
+                yearMedian = sortedBirthDays.get(sortedBirthDays.size() / 2).getYear();
+            }
+        }else{
+            ageRange = 0;
+            yearMedian = (int) yearAvg;
+        }
     }
 }
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterBD.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterBD.java
new file mode 100644
index 00000000..60377024
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterBD.java
@@ -0,0 +1,141 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+
+import java.time.LocalDate;
+import java.util.*;
+
+public class OpenTriangleClusterBD extends OpenTriangleCluster {
+    private IBucket births;
+    private IBucket deaths;
+
+    public OpenTriangleClusterBD(long x, List<List<Long>> triangleChain, String recordRepo) {
+        super(x, triangleChain);
+        RecordRepository record_repository = new RecordRepository(recordRepo);
+        births = record_repository.getBucket("birth_records");
+        deaths = record_repository.getBucket("death_records");
+    }
+
+    /**
+     * Method to get birth year statistics for cluster
+     */
+    @Override
+    public void getYearStatistics() throws BucketException {
+        for (List<Long> chain : triangleChain){ //loop through each open triangle
+            LXP[] tempKids = {(LXP) births.getObjectById(x), (LXP) deaths.getObjectById(chain.get(0)), (LXP) births.getObjectById(chain.get(1))};
+            for (int i = 0; i < tempKids.length; i++) { //loop through children in triangle
+                if (!children.contains(tempKids[i])) { //if not in children set
+                    //set default date if child has missing DOB details
+                    int year = 1850;
+                    int month = 1;
+                    int day = 1;
+
+                    //if not death record
+                    if(i != 1){
+                        //get year if available
+                        try{
+                            year = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_YEAR)));
+                        }catch(Exception e){
+                            if(!children.isEmpty()){
+                                year = (int) Math.round(yearTotal/children.size());
+                            }
+                        }
+
+                        //get month if available
+                        try{
+                            month = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_MONTH)));
+                        }catch(Exception e){
+                            month = -1; //if not available, set to -1 as month is too specific
+                        }
+
+                        //get day if available
+                        try{
+                            day = Integer.parseInt((tempKids[i].getString(Birth.BIRTH_DAY)));
+                        } catch (Exception e) {
+
+                        }
+
+                        //if month is available, add to birthdays set
+                        if(month != -1){
+                            birthDays.put(tempKids[i].getString(Birth.STANDARDISED_ID), LocalDate.of(year, month, day));
+                        }
+                        yearTotal += year;
+
+                        //add birth address to map for mode calculation
+                        if(!Objects.equals(tempKids[i].getString(Birth.BIRTH_ADDRESS), "----")){
+                            birthplaceMap.merge(tempKids[i].getString(Birth.BIRTH_ADDRESS), 1, Integer::sum);
+                        }
+                    }else{ //if death record
+                        try{
+                            year = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(6));
+                            month = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(3, 5));
+                            day = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(0, 2));
+
+                            birthDays.put(tempKids[i].getString(Death.STANDARDISED_ID), LocalDate.of(year, month, day));
+                            //if died as child, set assume birthplace from death place
+                            if(Integer.parseInt((tempKids[i].getString(Death.DEATH_YEAR))) - year < 12 && !Objects.equals(tempKids[i].getString(Death.PLACE_OF_DEATH), "----")){
+                                birthplaceMap.merge(tempKids[i].getString(Death.PLACE_OF_DEATH), 1, Integer::sum);
+                            }
+                        }catch(Exception e){
+                            if(!children.isEmpty()){
+                                year = (int) Math.round(yearTotal/children.size());
+                            }
+                        }
+                    }
+
+                    yearTotal += year;
+
+                    children.add(tempKids[i]);
+                }
+            }
+        }
+
+        //code inspired by https://deveshsharmablogs.wordpress.com/2013/07/16/find-most-common-element-in-a-list-in-java/
+        int maxValue = -1;
+        for(Map.Entry<String, Integer> entry: birthplaceMap.entrySet()) {
+            if(entry.getValue() > maxValue) {
+                mostCommonBirthplace = entry.getKey();
+                maxValue = entry.getValue();
+            }
+        }
+
+        yearAvg = yearTotal / children.size();
+
+        //get age range and median by sorting dates
+        List<LocalDate> sortedBirthDays = new ArrayList<>(birthDays.values());
+        Collections.sort(sortedBirthDays);
+        if(!sortedBirthDays.isEmpty()){
+            ageRange = sortedBirthDays.get(sortedBirthDays.size() - 1).getYear() - sortedBirthDays.get(0).getYear();
+
+            if ((sortedBirthDays.size() % 2) == 0) {
+                yearMedian = ((sortedBirthDays.get(sortedBirthDays.size() / 2)).getYear() + (sortedBirthDays.get(sortedBirthDays.size() / 2 - 1)).getYear()) / 2;
+            }else {
+                yearMedian = sortedBirthDays.get(sortedBirthDays.size() / 2).getYear();
+            }
+        }else{
+            ageRange = 0;
+            yearMedian = (int) yearAvg;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterDD.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterDD.java
new file mode 100644
index 00000000..86c63495
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/OpenTriangleClusterDD.java
@@ -0,0 +1,102 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+
+import java.time.LocalDate;
+import java.util.*;
+
+public class OpenTriangleClusterDD extends OpenTriangleCluster {
+    private IBucket deaths;
+
+    public OpenTriangleClusterDD(long x, List<List<Long>> triangleChain, String recordRepo) {
+        super(x, triangleChain);
+        RecordRepository record_repository = new RecordRepository(recordRepo);
+        deaths = record_repository.getBucket("death_records");
+    }
+
+    /**
+     * Method to get birth year statistics for cluster
+     */
+    @Override
+    public void getYearStatistics() throws BucketException {
+        for (List<Long> chain : triangleChain){ //loop through each open triangle
+            LXP[] tempKids = {(LXP) deaths.getObjectById(x), (LXP) deaths.getObjectById(chain.get(0)), (LXP) deaths.getObjectById(chain.get(1))};
+            for (int i = 0; i < tempKids.length; i++) { //loop through children in triangle
+                if (!children.contains(tempKids[i])) { //if not in children set
+                    //set default date if child has missing DOB details
+                    int year = 1850;
+                    int month = 1;
+                    int day = 1;
+
+                    try{
+                        year = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(6));
+                        month = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(3, 5));
+                        day = Integer.parseInt((tempKids[i].getString(Death.DATE_OF_BIRTH)).substring(0, 2));
+
+                        birthDays.put(tempKids[i].getString(Death.STANDARDISED_ID), LocalDate.of(year, month, day));
+
+                        //if died as child, set assume birthplace from death place
+                        if(Integer.parseInt((tempKids[i].getString(Death.DEATH_YEAR))) - year < 12 && !Objects.equals(tempKids[i].getString(Death.PLACE_OF_DEATH), "----")){
+                            birthplaceMap.merge(tempKids[i].getString(Death.PLACE_OF_DEATH), 1, Integer::sum);
+                        }
+                    }catch(Exception e){
+                        if(!children.isEmpty()){
+                            year = (int) Math.round(yearTotal/children.size());
+                        }
+                    }
+
+                    yearTotal += year;
+
+                    children.add(tempKids[i]);
+                }
+            }
+        }
+
+        //code inspired by https://deveshsharmablogs.wordpress.com/2013/07/16/find-most-common-element-in-a-list-in-java/
+        int maxValue = -1;
+        for(Map.Entry<String, Integer> entry: birthplaceMap.entrySet()) {
+            if(entry.getValue() > maxValue) {
+                mostCommonBirthplace = entry.getKey();
+                maxValue = entry.getValue();
+            }
+        }
+
+        yearAvg = yearTotal / children.size();
+
+        //get age range and median by sorting dates
+        List<LocalDate> sortedBirthDays = new ArrayList<>(birthDays.values());
+        Collections.sort(sortedBirthDays);
+        if(!sortedBirthDays.isEmpty()){
+            ageRange = sortedBirthDays.get(sortedBirthDays.size() - 1).getYear() - sortedBirthDays.get(0).getYear();
+
+            if ((sortedBirthDays.size() % 2) == 0) {
+                yearMedian = ((sortedBirthDays.get(sortedBirthDays.size() / 2)).getYear() + (sortedBirthDays.get(sortedBirthDays.size() / 2 - 1)).getYear()) / 2;
+            }else {
+                yearMedian = sortedBirthDays.get(sortedBirthDays.size() / 2).getYear();
+            }
+        }else{
+            ageRange = 0;
+            yearMedian = (int) yearAvg;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/PatternsCounter.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/PatternsCounter.java
new file mode 100644
index 00000000..5713aa26
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/PatternsCounter.java
@@ -0,0 +1,566 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import uk.ac.standrews.cs.neoStorr.impl.Store;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+
+import java.util.List;
+import java.util.Objects;
+
+public class PatternsCounter {
+
+    final static String[] RECORD_TYPES = {"Birth", "Marriage", "Death"};
+
+    public static void main(String[] args) {
+        NeoDbCypherBridge bridge = Store.getInstance().getBridge();
+
+        for(String type1: RECORD_TYPES){
+            for(String type2: RECORD_TYPES) {
+                countOpenTrianglesToString(bridge, type1, type2);
+            }
+        }
+    }
+
+    /**
+     * Method to count all sibling triangles and print
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 records x,z
+     * @param type2 record y
+     */
+    public static void countOpenTrianglesToString(NeoDbCypherBridge bridge, String type1, String type2) {
+        int count = countOpenTriangles(bridge, type1, type2);
+        System.out.println(type1 + "-" + type2 + "-" + type1 + " triangle: " + count);
+    }
+
+    /**
+     * Method to count all ID triangles and print
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 records x,z
+     * @param type2 record y
+     */
+    public static void countOpenTrianglesToStringID(NeoDbCypherBridge bridge, String type1, String type2) {
+        int count = countOpenTrianglesID(bridge, type1, type2);
+        System.out.println(type1 + "-" + type2 + "-" + type1 + " triangle: " + count);
+    }
+
+    /**
+     * Method to count all sibling triangles
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 records x,z
+     * @param type2 record y
+     */
+    public static int countOpenTriangles(NeoDbCypherBridge bridge, String type1, String type2) {
+        String openTriangleQuery = String.format(
+                "MATCH (x:%s)-[:SIBLING]-(y:%s)-[:SIBLING]-(z:%s) " +
+                        "WHERE NOT (x)-[:SIBLING]-(z) AND id(x) < id(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)" +
+                        "RETURN count(DISTINCT [x, z]) as cluster_count",
+                type1, type2, type1
+        );
+
+        Result result = bridge.getNewSession().run(openTriangleQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long count = 0;
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        return (int) count;
+    }
+
+    /**
+     * Method to count all ID triangles and print
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 records x,z
+     * @param type2 record y
+     */
+    public static int countOpenTrianglesID(NeoDbCypherBridge bridge, String type1, String type2) {
+        String openTriangleQuery = String.format(
+                "MATCH (x:%s)-[:SIBLING]-(y:%s)-[:ID]-(z:%s) " +
+                        "WHERE NOT (x)-[:ID]-(z) AND id(x) < id(z) AND NOT (x)-[:DELETED]-(y) AND NOT (z)-[:DELETED]-(y)" +
+                        "RETURN count(DISTINCT [x, z]) as cluster_count",
+                type1, type1, type2
+        );
+
+        Result result = bridge.getNewSession().run(openTriangleQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long count = 0;
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        return (int) count;
+    }
+
+    /**
+     * Method to count all sibling triangles for particular field and threshold
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 x,z records
+     * @param type2 y record
+     * @param threshold threshold to count at
+     * @param fields number of fields to count at
+     * @return total number of open triangles
+     */
+    public static int countOpenTrianglesCumulative(NeoDbCypherBridge bridge, String type1, String type2, double threshold, int fields) {
+        long count = 0;
+        //query to count all open triangles at the threshold and filed number
+        String openTriangleQuery = String.format(
+                "MATCH (x:%1$s)-[s:SIBLING]-(y:%2$s)-[r:SIBLING]-(z:%1$s) " +
+                        "WHERE NOT (x)-[:SIBLING]-(z) AND id(x) < id(z) AND r.distance <= %3$s AND s.distance <= %3$s AND r.fields_populated >= %4$s AND s.fields_populated >= %4$s " +
+                        "RETURN count(DISTINCT [x, z]) as cluster_count",
+                type1, type2, threshold, fields
+        );
+
+        Result result = bridge.getNewSession().run(openTriangleQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        //query to count all open triangles that would be there if the threshold was not maximised
+        String openTriangleQuery2 = String.format(
+                "MATCH (x:%1$s)-[s:SIBLING]-(y:%2$s)-[r:SIBLING]-(z:%1$s), (x)-[t:SIBLING]-(z)  " +
+                        "WHERE id(x) < id(z) AND r.distance <= %3$s AND s.distance <= %3$s AND r.fields_populated >= %4$s AND s.fields_populated >= %4$s " +
+                        "AND (t.fields_populated < %4$s OR t.distance > %3$s) " +
+                        "RETURN count(DISTINCT [x, z]) as cluster_count",
+                type1, type2, threshold, fields
+        );
+
+        result = bridge.getNewSession().run(openTriangleQuery2);
+        clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long tCount = 0;
+        if (!clusters.isEmpty()) {
+            tCount = clusters.get(0);
+        }
+
+        return (int) count + (int) tCount;
+    }
+
+    /**
+     * Method to count FNOTs for sibling open triangles
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 records x,z
+     * @param type2 record y
+     * @param threshold threshold to count at
+     * @param fields number of fields to count at
+     * @return total number of open triangles
+     */
+    public static int countOpenTrianglesSibFNOT(NeoDbCypherBridge bridge, String type1, String type2, double threshold, int fields) {
+        long count = 0;
+        String openTriangleQuery = "";
+        String openTriangleQuery2 = "";
+
+        //if Birth-Birth-Birth open triangle
+        if(Objects.equals(type1, "Birth") && Objects.equals(type2, "Birth")){
+            //count number of FNOTs
+            openTriangleQuery = String.format(
+                    "MATCH (x:%1$s)-[s:SIBLING]-(y:%2$s)-[r:SIBLING]-(z:%1$s) " +
+                            "WHERE NOT (x)-[:SIBLING]-(z) AND id(x) < id(z) AND x.PARENTS_DAY_OF_MARRIAGE = z.PARENTS_DAY_OF_MARRIAGE AND x.PARENTS_MONTH_OF_MARRIAGE = z.PARENTS_MONTH_OF_MARRIAGE AND x.PARENTS_YEAR_OF_MARRIAGE = z.PARENTS_YEAR_OF_MARRIAGE and x.PARENTS_YEAR_OF_MARRIAGE <> \"----\" AND z.PARENTS_YEAR_OF_MARRIAGE <> \"----\"\n" +
+                            "AND r.distance <= %3$s AND s.distance <= %3$s AND r.fields_populated >= %4$s AND s.fields_populated >= %4$s\n" +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    type1, type2, threshold, fields
+            );
+
+            //count number of FNOTs that would be there if the threshold was not maximised
+            openTriangleQuery2 = String.format(
+                    "MATCH (x:%1$s)-[s:SIBLING]-(y:%2$s)-[r:SIBLING]-(z:%1$s), (x)-[t:SIBLING]-(z)  " +
+                            "WHERE id(x) < id(z) AND x.PARENTS_DAY_OF_MARRIAGE = z.PARENTS_DAY_OF_MARRIAGE AND x.PARENTS_MONTH_OF_MARRIAGE = z.PARENTS_MONTH_OF_MARRIAGE AND x.PARENTS_YEAR_OF_MARRIAGE = z.PARENTS_YEAR_OF_MARRIAGE and x.PARENTS_YEAR_OF_MARRIAGE <> \"----\" AND z.PARENTS_YEAR_OF_MARRIAGE <> \"----\"\n" +
+                            "AND r.distance <= %3$s AND s.distance <= %3$s AND r.fields_populated >= %4$s AND s.fields_populated >= %4$s\n" +
+                            "AND (t.fields_populated < %4$s OR t.distance > %3$s)\n" +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    type1, type2, threshold, fields
+            );
+        }
+
+        Result result = bridge.getNewSession().run(openTriangleQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        result = bridge.getNewSession().run(openTriangleQuery2);
+        clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long tCount = 0;
+        if (!clusters.isEmpty()) {
+            tCount = clusters.get(0);
+        }
+
+        return (int) count + (int) tCount;
+    }
+
+    /**
+     * Method to count number of open triangles for Birth-Marriage Parents ID
+     *
+     * @param bridge Neo4j bridge
+     * @param threshold threshold to count at
+     * @param fields number of fields to count at
+     * @param isTotal check if total number of triangles or FNOTs is required
+     * @return number of open triangles
+     */
+    public static int countOpenTrianglesParentsMarriage(NeoDbCypherBridge bridge, double threshold, int fields, boolean isTotal){
+        long count = 0;
+        String openSquaresQuery = "";
+        String openSquaresQuery2 = "";
+
+        if(isTotal){
+            openSquaresQuery = String.format(
+                    "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[r:ID]-(z:Marriage) " +
+                            "WHERE NOT (x)-[:ID]-(z) AND id(x) < id(z) AND (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\") AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                            "AND x.PARENTS_YEAR_OF_MARRIAGE = y.PARENTS_YEAR_OF_MARRIAGE " +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    threshold, fields
+            );
+
+            openSquaresQuery2 = String.format(
+                    "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[r:ID]-(z:Marriage), (x)-[t:ID]-(z) " +
+                            "WHERE id(x) < id(z) AND (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\") AND (t.actors = \"Child-Father\" OR t.actors = \"Child-Mother\") " +
+                            "AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                            "AND (t.fields_populated < %2$s OR t.distance > %1$s) " +
+                            "AND x.PARENTS_YEAR_OF_MARRIAGE = y.PARENTS_YEAR_OF_MARRIAGE " +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    threshold, fields
+            );
+        }else{
+            openSquaresQuery = String.format(
+                    "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[r:ID]-(z:Marriage) " +
+                            "WHERE NOT (x)-[:ID]-(z) AND id(x) < id(z) AND (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\") AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                            "AND x.PARENTS_YEAR_OF_MARRIAGE = z.MARRIAGE_YEAR " +
+                            "AND y.PARENTS_YEAR_OF_MARRIAGE = z.MARRIAGE_YEAR " +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    threshold, fields
+            );
+
+            openSquaresQuery2 = String.format(
+                    "MATCH (x:Birth)-[:SIBLING]-(y:Birth)-[r:ID]-(z:Marriage), (x)-[t:ID]-(z) " +
+                            "WHERE id(x) < id(z) AND (r.actors = \"Child-Father\" OR r.actors = \"Child-Mother\") AND (t.actors = \"Child-Father\" OR t.actors = \"Child-Mother\") " +
+                            "AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                            "AND (t.fields_populated < %2$s OR t.distance > %1$s) " +
+                            "AND x.PARENTS_YEAR_OF_MARRIAGE = z.MARRIAGE_YEAR " +
+                            "AND y.PARENTS_YEAR_OF_MARRIAGE = z.MARRIAGE_YEAR " +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    threshold, fields
+            );
+        }
+
+        Result result = bridge.getNewSession().run(openSquaresQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        result = bridge.getNewSession().run(openSquaresQuery2);
+        clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long tCount = 0;
+        if (!clusters.isEmpty()) {
+            tCount = clusters.get(0);
+        }
+
+        return (int) count + (int) tCount;
+    }
+
+    /**
+     * Method to count number of open triangles for Birth-Death-Birth Siblings
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 records x,z
+     * @param type2 record y
+     * @param threshold threshold to count at
+     * @param fields number of fields to count at
+     * @param isTotal boolean to check if return total or FNOTs
+     * @return total number of open triangles
+     */
+    public static int countOpenTrianglesBirthDeathSib(NeoDbCypherBridge bridge, String type1, String type2, double threshold, int fields, boolean isTotal) {
+        long count = 0;
+        String openSquaresQuery = "";
+        String openSquaresQuery2 = "";
+
+        if(isTotal){
+            openSquaresQuery = String.format(
+                    "MATCH (x:%1$s)-[:SIBLING]-(y:%1$s)-[r:SIBLING]-(z:%2$s) " +
+                            "WHERE NOT (x)-[:SIBLING]-(z) AND id(x) < id(z) AND r.distance <= %3$s AND r.fields_populated >= %4$s " +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    type1, type2, threshold, fields
+            );
+
+            openSquaresQuery2 = String.format(
+                    "MATCH (x:%1$s)-[:SIBLING]-(y:%1$s)-[r:SIBLING]-(z:%2$s), (x)-[t:SIBLING]-(z)  " +
+                            "WHERE id(x) < id(z) AND r.distance <= %3$s AND r.fields_populated >= %4$s " +
+                            "AND (t.fields_populated < %4$s OR t.distance > %3$s) " +
+                            "RETURN count(DISTINCT [x, z]) as cluster_count",
+                    type1, type2, threshold, fields
+            );
+        }else{
+            openSquaresQuery = String.format("MATCH (b1:Birth)-[:SIBLING]-(b2:Birth), (b1)-[:SIBLING]-(b:Birth), (b2)-[:SIBLING]-(b), (b2)-[r:SIBLING]-(d:Death), (d)-[:ID]-(b), (b)-[:ID]-(m:Marriage), (b1)-[:ID]-(m), (b2)-[:ID]-(m) \n" +
+                    "WHERE id(b1) < id(b2) AND NOT (b1)-[:SIBLING]-(d) AND NOT (d)-[:SIBLING]-(b) AND NOT (b1)-[:ID]-(d) AND b1.BIRTH_YEAR <> right(d.DATE_OF_BIRTH, 4) AND b1.BIRTH_YEAR <> \"----\" \n" +
+                    "AND r.distance <= %1$s AND r.fields_populated >= %2$s\n" +
+                    "return count(DISTINCT [b1, b2]) as cluster_count", threshold, fields);
+
+            openSquaresQuery2 = String.format("MATCH (b1:Birth)-[:SIBLING]-(b2:Birth), (b1)-[:SIBLING]-(b:Birth), (b2)-[:SIBLING]-(b), (b2)-[r:SIBLING]-(d:Death), (d)-[:ID]-(b), (b)-[:ID]-(m:Marriage), (b1)-[:ID]-(m), (b2)-[:ID]-(m), (b1)-[t:SIBLING]-(d)\n" +
+                    "WHERE id(b1) < id(b2) AND NOT (d)-[:SIBLING]-(b) AND b1.BIRTH_YEAR <> right(d.DATE_OF_BIRTH, 4) AND b1.BIRTH_YEAR <> \"----\" \n" +
+                    "AND r.distance <= %1$s AND r.fields_populated >= %2$s\n" +
+                    "AND (t.fields_populated < %2$s OR t.distance > %1$s)\n" +
+                    "return count(DISTINCT [b1, b2]) as cluster_count", threshold, fields);
+        }
+
+        Result result = bridge.getNewSession().run(openSquaresQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        result = bridge.getNewSession().run(openSquaresQuery2);
+        clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long tCount = 0;
+        if (!clusters.isEmpty()) {
+            tCount = clusters.get(0);
+        }
+
+        return (int) count + (int) tCount;
+    }
+
+    /**
+     * Method to count number of open triangles using an isomorphic pattern
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 x,z records
+     * @param type2 y record
+     * @param threshold threshold to count at
+     * @param fields number of fields to count at
+     * @return total number of open triangles
+     */
+    public static int countOpenTrianglesIsomorphicSiblings(NeoDbCypherBridge bridge, String type1, String type2, double threshold, int fields) {
+        long count = 0;
+        String openTriangleQuery = String.format(
+                "MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s)-[:SIBLING]-(b3:%1$s),\n" +
+                        "(d1:%2$s)-[r:SIBLING]-(d2:%2$s)-[s:SIBLING]-(d3:%2$s),\n" +
+                        "(b1)-[:ID]-(d1),\n" +
+                        "(b2)-[:ID]-(d2),\n" +
+                        "(b3)-[:ID]-(d3),\n" +
+                        "(b1)-[:SIBLING]-(b3)\n" +
+                        "WHERE NOT (d1)-[:SIBLING]-(d3) AND b1.BIRTH_YEAR = right(d1.DATE_OF_BIRTH, 4) AND b2.BIRTH_YEAR = right(d2.DATE_OF_BIRTH, 4) AND b3.BIRTH_YEAR = right(d3.DATE_OF_BIRTH, 4)\n" +
+                        "AND id(d1) < id(d3) AND r.distance <= %3$s AND r.fields_populated >= %4$s AND s.distance <= %3$s AND s.fields_populated >= %4$s\n" +
+                        "and not (b1)-[:ID]-(d2) and not (b1)-[:ID]-(d3) and not (b2)-[:ID]-(d1) and not (b2)-[:ID]-(d3) and not (b3)-[:ID]-(d2) and not (b3)-[:ID]-(d1)\n" +
+                        "RETURN count(DISTINCT [d1, d2]) as cluster_count",
+                type1, type2, threshold, fields
+        );
+
+        Result result = bridge.getNewSession().run(openTriangleQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        String openTriangleQuery2 = String.format(
+                "MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s)-[:SIBLING]-(b3:%1$s),\n" +
+                        "(d1:%2$s)-[r:SIBLING]-(d2:%2$s)-[s:SIBLING]-(d3:%2$s),\n" +
+                        "(b1)-[:ID]-(d1),\n" +
+                        "(b2)-[:ID]-(d2),\n" +
+                        "(b3)-[:ID]-(d3),\n" +
+                        "(b1)-[:SIBLING]-(b3),\n" +
+                        "(d1)-[t:SIBLING]-(d3)\n" +
+                        "WHERE b1.BIRTH_YEAR = right(d1.DATE_OF_BIRTH, 4) AND b2.BIRTH_YEAR = right(d2.DATE_OF_BIRTH, 4) AND b3.BIRTH_YEAR = right(d3.DATE_OF_BIRTH, 4)\n" +
+                        "AND id(d1) < id(d3) AND r.distance <= %3$s AND r.fields_populated >= %4$s AND s.distance <= %3$s AND s.fields_populated >= %4$s\n" +
+                        "AND (t.fields_populated < %4$s OR t.distance > %3$s)\n" +
+                        "and not (b1)-[:ID]-(d2) and not (b1)-[:ID]-(d3) and not (b2)-[:ID]-(d1) and not (b2)-[:ID]-(d3) and not (b3)-[:ID]-(d2) and not (b3)-[:ID]-(d1)\n" +
+                        "RETURN count(DISTINCT [d1, d3]) as cluster_count",
+                type1, type2, threshold, fields
+        );
+
+        result = bridge.getNewSession().run(openTriangleQuery2);
+        clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long tCount = 0;
+        if (!clusters.isEmpty()) {
+            tCount = clusters.get(0);
+        }
+
+        return (int) count + (int) tCount;
+    }
+
+    /**
+     * Method to count number of open triangles for ID linkage.
+     *
+     * @param bridge Neo4j bridge
+     * @param type1 x,z records
+     * @param type2 y record
+     * @param threshold threshold to count at
+     * @param fields number of fields to count at
+     * @param isTotal boolean check if need to return total or FNOTs
+     * @param partner check for marriage linkage what partner needs analysing, null if none
+     * @return total number of open triangles
+     */
+    public static int countOpenSquaresCumulativeID(NeoDbCypherBridge bridge, String type1, String type2, double threshold, int fields, boolean isTotal, String partner) {
+        long count = 0;
+        String openSquaresQuery = "";
+        String openSquaresQuery2 = "";
+
+        if (Objects.equals(type1, "Birth") && Objects.equals(type2, "Death")) {
+            if(isTotal){
+                openSquaresQuery = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID]-(d1)\n" +
+                        "WHERE id(b1) < id(b2) AND NOT (b2)-[:ID]-(d2) AND r.distance <= %3$s AND r.fields_populated >= %4$s " +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields);
+                openSquaresQuery2 = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID]-(d1),\n" +
+                        "(b2)-[s:ID]-(d2)\n" +
+                        "WHERE id(b1) < id(b2) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "AND (s.fields_populated < %4$s OR s.distance > %3$s) " +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields);
+            }else{
+                openSquaresQuery = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID]-(d1)\n" +
+                        "WHERE NOT (b2)-[:ID]-(d2) AND NOT (b2)-[:SIBLING]-(d2) AND b2.FORENAME = d2.FORENAME AND b2.SURNAME = d2.SURNAME AND b2.BIRTH_YEAR = right(d2.DATE_OF_BIRTH, 4) " +
+                        "AND b1.FORENAME = d1.FORENAME AND b1.SURNAME = d1.SURNAME AND b1.BIRTH_YEAR = right(d1.DATE_OF_BIRTH, 4) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields);
+
+                openSquaresQuery2 = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID]-(d1),\n" +
+                        "(b2)-[s:ID]-(d2)\n" +
+                        "WHERE NOT (b2)-[:SIBLING]-(d2) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "AND b2.FORENAME = d2.FORENAME AND b2.SURNAME = d2.SURNAME AND b2.BIRTH_YEAR = right(d2.DATE_OF_BIRTH, 4) AND b1.FORENAME = d1.FORENAME AND b1.SURNAME = d1.SURNAME AND b1.BIRTH_YEAR = right(d1.DATE_OF_BIRTH, 4) " +
+                        "AND (s.fields_populated < %4$s OR s.distance > %3$s) " +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields);
+            }
+        }else if(Objects.equals(type1, "Marriage") && Objects.equals(type2, "Death")){
+            openSquaresQuery = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                    "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                    "(b1)-[r:ID]-(d1)\n" +
+                    "WHERE NOT (b2)-[:ID]-(d2) AND NOT (b2)-[:SIBLING]-(d2) AND b2.GROOM_FORENAME = d2.FORENAME AND right(b2.GROOM_AGE_OR_DATE_OF_BIRTH, 4) = right(d2.DATE_OF_BIRTH, 4) " +
+                    "AND b1.GROOM_FORENAME = d1.FORENAME AND right(b1.GROOM_AGE_OR_DATE_OF_BIRTH, 4) = right(d1.DATE_OF_BIRTH, 4) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                    "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields);
+
+            openSquaresQuery2 = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                    "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                    "(b1)-[r:ID]-(d1),\n" +
+                    "(b2)-[s:ID]-(d2)\n" +
+                    "WHERE NOT (b2)-[:SIBLING]-(d2) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                    "AND b2.GROOM_FORENAME = d2.FORENAME AND right(b2.GROOM_AGE_OR_DATE_OF_BIRTH, 4)= right(d2.DATE_OF_BIRTH, 4) AND b1.GROOM_FORENAME = d1.FORENAME AND right(b1.GROOM_AGE_OR_DATE_OF_BIRTH, 4) = right(d1.DATE_OF_BIRTH, 4) " +
+                    "AND (s.fields_populated < %4$s OR s.distance > %3$s) " +
+                    "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields);
+        }else if(Objects.equals(type1, "Birth") && Objects.equals(type2, "Marriage")){
+            if(isTotal){
+                openSquaresQuery = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID {actors: \"Child-%5$s\"}]-(d1)\n" +
+                        "WHERE id(b1) < id(b2) AND NOT (b2)-[:ID]-(d2) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields, partner);
+
+                openSquaresQuery2 = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID {actors: \"Child-%5$s\"}]-(d1),\n" +
+                        "(b2)-[s:ID {actors: \"Child-%5$s\"}]-(d2)\n" +
+                        "WHERE id(b1) < id(b2) AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "AND (s.fields_populated < %4$s OR s.distance > %3$s) " +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields, partner);
+            }else{
+                String partnerCapitalised = partner.toUpperCase();
+                openSquaresQuery = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID {actors: \"Child-%5$s\"}]-(d1)\n" +
+                        "WHERE id(b1) < id(b2) AND NOT (b2)-[:ID]-(d2) AND NOT (b2)-[:SIBLING]-(d2) AND b2.FORENAME = d2.%6$s_FORENAME AND b2.SURNAME = d2.%6$s_SURNAME AND b2.BIRTH_YEAR = right(d2.%6$s_AGE_OR_DATE_OF_BIRTH, 4)\n" +
+                        "AND b1.FORENAME = d1.%6$s_FORENAME AND b1.SURNAME = d1.%6$s_SURNAME AND b1.BIRTH_YEAR = right(d1.%6$s_AGE_OR_DATE_OF_BIRTH, 4)\n" +
+                        "AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields, partner, partnerCapitalised);
+
+                openSquaresQuery2 = String.format("MATCH (b1:%1$s)-[:SIBLING]-(b2:%1$s),\n" +
+                        "(d1:%2$s)-[:SIBLING]-(d2:%2$s),\n" +
+                        "(b1)-[r:ID {actors: \"Child-%5$s\"}]-(d1),\n" +
+                        "(b2)-[s:ID {actors: \"Child-%5$s\"}]-(d2)\n" +
+                        "WHERE id(b1) < id(b2) AND b2.FORENAME = d2.%6$s_FORENAME AND b2.SURNAME = d2.%6$s_SURNAME AND b2.BIRTH_YEAR = right(d2.%6$s_AGE_OR_DATE_OF_BIRTH, 4)\n" +
+                        "AND b1.FORENAME = d1.%6$s_FORENAME AND b1.SURNAME = d1.%6$s_SURNAME AND b1.BIRTH_YEAR = right(d1.%6$s_AGE_OR_DATE_OF_BIRTH, 4)\n" +
+                        "AND r.distance <= %3$s AND r.fields_populated >= %4$s\n" +
+                        "AND (s.fields_populated < %4$s OR s.distance > %3$s)\n" +
+                        "RETURN count(DISTINCT [b1, b2]) as cluster_count", type1, type2, threshold, fields, partner, partnerCapitalised);
+            }
+        }else if(Objects.equals(type1, "Marriage") && Objects.equals(type2, "Marriage")){
+            if(isTotal){
+                openSquaresQuery = String.format("MATCH (m:Marriage)-[r:ID {actors: \"%3$s-Couple\"}]->(m2:Marriage)-[:SIBLING]-(m1:Marriage)\n" +
+                        "WHERE NOT (m1)-[:ID]-(m) AND id(m) < id(m1) " +
+                        "AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                        "RETURN count(DISTINCT [m, m2]) as cluster_count", threshold, fields, partner);
+
+                openSquaresQuery2 = String.format("MATCH (m:Marriage)-[r:ID {actors: \"%3$s-Couple\"}]->(m2:Marriage)-[:SIBLING]-(m1:Marriage),\n" +
+                        "(m1)-[s:ID]-(m) " +
+                        "WHERE id(m) < id(m1) " +
+                        "AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                        "AND (s.fields_populated < %2$s OR s.distance > %1$s)\n" +
+                        "RETURN count(DISTINCT [m, m2]) as cluster_count", threshold, fields, partner);
+            }else{
+                openSquaresQuery = String.format("MATCH (m:Marriage)-[r:ID {actors: \"%3$s-Couple\"}]->(m1:Marriage)-[:ID]-(b1:Birth)-[:SIBLING]-(b2:Birth)-[:ID]-(m2:Marriage)\n" +
+                        "WHERE (m1)-[:SIBLING]-(m2)\n" +
+                        "AND NOT (b1)-[:SIBLING]-(m1) AND NOT (b2)-[:SIBLING]-(m2) AND NOT (b1)-[:ID]-(m2) AND NOT (b2)-[:ID]-(m1)\n" +
+                        "AND (b1)-[:ID]-(m) AND (b2)-[:ID]-(m)\n" +
+                        "AND NOT (m2)-[:ID]-(m)\n" +
+                        "AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                        "AND id(m1) < id(m2)\n" +
+                        "AND b1.PARENTS_YEAR_OF_MARRIAGE = m.MARRIAGE_YEAR AND b2.PARENTS_YEAR_OF_MARRIAGE = m.MARRIAGE_YEAR \n" +
+                        "RETURN count(DISTINCT [m, m2]) as cluster_count", threshold, fields, partner);
+
+                openSquaresQuery2 = String.format("MATCH (m:Marriage)-[r:ID {actors: \"%3$s-Couple\"}]->(m1:Marriage)-[:ID]-(b1:Birth)-[:SIBLING]-(b2:Birth)-[:ID]-(m2:Marriage),\n" +
+                        "(m2)-[t:ID]-(m)\n" +
+                        "WHERE (m1)-[:SIBLING]-(m2)\n" +
+                        "AND NOT (b1)-[:SIBLING]-(m1) AND NOT (b2)-[:SIBLING]-(m2) AND NOT (b1)-[:ID]-(m2) AND NOT (b2)-[:ID]-(m1)\n" +
+                        "AND (b1)-[:ID]-(m) AND (b2)-[:ID]-(m)\n" +
+                        "AND r.distance <= %1$s AND r.fields_populated >= %2$s " +
+                        "AND (t.fields_populated < %2$s OR t.distance > %1$s)\n" +
+                        "AND id(m1) < id(m2)\n" +
+                        "AND b1.PARENTS_YEAR_OF_MARRIAGE = m.MARRIAGE_YEAR AND b2.PARENTS_YEAR_OF_MARRIAGE = m.MARRIAGE_YEAR " +
+                        "RETURN count(DISTINCT [m, m2]) as cluster_count", threshold, fields, partner);
+            }
+        }
+
+
+        Result result = bridge.getNewSession().run(openSquaresQuery);
+        List<Long> clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        if (!clusters.isEmpty()) {
+            count = clusters.get(0);
+        }
+
+        result = bridge.getNewSession().run(openSquaresQuery2);
+        clusters = result.list(r -> r.get("cluster_count").asLong());
+
+        long tCount = 0;
+        if (!clusters.isEmpty()) {
+            tCount = clusters.get(0);
+        }
+
+        return (int) count + (int) tCount;
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/PredicateEfficacy.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/PredicateEfficacy.java
new file mode 100644
index 00000000..f306c8fe
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/PredicateEfficacy.java
@@ -0,0 +1,155 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Result;
+import uk.ac.standrews.cs.neoStorr.impl.Store;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+
+import java.util.List;
+
+public class PredicateEfficacy {
+    //sibling efficacy queries
+    private String CREATED_LINKS_QUERY_TRUE = "MATCH (x:%1$s)-[r:SIBLING]-(y:%2$s) WHERE r.provenance = \"%3$s\" AND (x:%1$s)-[:GT_SIBLING]-(y:%2$s) AND NOT (x)-[:DELETED]-(y) RETURN count(r) as cluster_count";
+    private String DELETED_LINKS_QUERY_TRUE = "MATCH (x:%1$s)-[r:DELETED]-(y:%2$s) WHERE r.provenance = \"%3$s\" AND NOT (x:%1$s)-[:GT_SIBLING]-(y:%2$s) RETURN count(r) as cluster_count";
+    private String LINKS_QUERY_TOTAL_CREATED = "MATCH (x:%s)-[r:SIBLING]-(y:%s) WHERE r.provenance = \"%s\" AND NOT (x)-[:DELETED]-(y) RETURN count(r) as cluster_count";
+    private String LINKS_QUERY_TOTAL_DELETED = "MATCH (x:%s)-[r:DELETED]-(y:%s) WHERE r.provenance = \"%s\" RETURN count(r) as cluster_count";
+
+    //id efficacy queries
+    private String DELETED_LINKS_QUERY_TRUE_ID = "MATCH (x:%1$s)-[r:DELETED]-(y:%2$s) WHERE r.provenance = \"%3$s\" and r.actors = \"%4$s\" AND NOT (x:%1$s)-[:GT_ID {actors: \"%5$s\"}]-(y:%2$s) RETURN count(r) as cluster_count";
+    private String LINKS_QUERY_TOTAL_DELETED_ID = "MATCH (x:%s)-[r:DELETED]-(y:%s) WHERE r.provenance = \"%s\" and r.actors = \"%s\" RETURN count(r) as cluster_count";
+    private String CREATED_LINKS_QUERY_TRUE_ID = "MATCH (x:%1$s)-[r:ID]-(y:%2$s) WHERE r.provenance = \"%3$s\" and r.actors = \"%4$s\" AND (x:%1$s)-[:GT_ID]-(y:%2$s) AND NOT (x)-[:DELETED]-(y) RETURN count(r) as cluster_count";
+    private String LINKS_QUERY_TOTAL_CREATED_ID = "MATCH (x:%s)-[r:ID]-(y:%s) WHERE r.provenance = \"%s\" and r.actors = \"%s\" AND NOT (x)-[:DELETED]-(y) RETURN count(r) as cluster_count";
+
+    NeoDbCypherBridge bridge;
+
+    public PredicateEfficacy(){
+        this.bridge = Store.getInstance().getBridge();
+    }
+
+    /**
+     * Method to calculate efficacy for sibling resolvers
+     *
+     * @param toCreate array of predicate provenances which create links
+     * @param toDelete array of predicate provenances which delete links
+     * @param recordType1 type of record from
+     * @param recordType2 type of record to
+     */
+    public void countSiblingEfficacy(String[] toCreate, String[] toDelete, String recordType1, String recordType2){
+        //loop through created links
+        System.out.println("Created");
+        for (String s : toCreate) {
+            Result result = bridge.getNewSession().run(String.format(CREATED_LINKS_QUERY_TRUE, recordType1, recordType2, s));
+            List<Long> trueMatches = result.list(r -> r.get("cluster_count").asLong()); //get links that are correct
+            result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_CREATED, recordType1, recordType2, s));
+            List<Long> total = result.list(r -> r.get("cluster_count").asLong()); //get all links made
+
+            //print if both arent empty
+            if (!trueMatches.isEmpty() && !total.isEmpty()) {
+                long trueCount = trueMatches.get(0);
+                long totalCount = total.get(0);
+
+                System.out.println(s + " " + trueCount + "/" + totalCount + " " + ((double) trueCount / totalCount));
+            }
+        }
+
+        //loop through deleted links
+        System.out.println("\nDeleted");
+        for (String s : toDelete) {
+            Result result = bridge.getNewSession().run(String.format(DELETED_LINKS_QUERY_TRUE, recordType1, recordType2, s));
+            List<Long> trueMatches = result.list(r -> r.get("cluster_count").asLong()); //get links that are correct
+            result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_DELETED, recordType1, recordType2, s));
+            List<Long> total = result.list(r -> r.get("cluster_count").asLong()); //get all links made
+
+            //print if both arent empty
+            if (!trueMatches.isEmpty() && !total.isEmpty()) {
+                long trueCount = trueMatches.get(0);
+                long totalCount = total.get(0);
+
+                System.out.println(s + " " + trueCount + "/" + totalCount + " " + ((double) trueCount / totalCount));
+            }
+        }
+    }
+
+    /**
+     * Method to calculate efficacy for ID resolvers (only deleted)
+     *
+     * @param toDelete array of predicate provenances which delete links
+     * @param recordType1 type of record from
+     * @param recordType2 type of record to
+     * @param actors actors used in link
+     */
+    public void countIDEfficacyDel(String[] toDelete, String recordType1, String recordType2, String actors){
+        System.out.println("Created");
+        for (String s : toDelete) {
+            List<Long> trueMatches;
+            List<Long> total;
+
+            //get number of correct and total links
+            if(actors.equals("Father-Groom")){ //check if actors are Father-Groom (GT uses different actors so must account for it)
+                Result result = bridge.getNewSession().run(String.format(DELETED_LINKS_QUERY_TRUE_ID, recordType1, recordType2, s, "Child-Father", actors));
+                trueMatches = result.list(r -> r.get("cluster_count").asLong());
+                result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_DELETED_ID, recordType1, recordType2, s, "Child-Father"));
+                total = result.list(r -> r.get("cluster_count").asLong());
+            } else if (actors.equals("Mother-Bride")) { //check if actors are Mother-Groom (GT uses different actors so must account for it)
+                Result result = bridge.getNewSession().run(String.format(DELETED_LINKS_QUERY_TRUE_ID, recordType1, recordType2, s, "Child-Mother", actors));
+                trueMatches = result.list(r -> r.get("cluster_count").asLong());
+                result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_DELETED_ID, recordType1, recordType2, s, "Child-Mother"));
+                total = result.list(r -> r.get("cluster_count").asLong());
+            }else{ //all other actors are treated as normal
+                Result result = bridge.getNewSession().run(String.format(DELETED_LINKS_QUERY_TRUE_ID, recordType1, recordType2, s, actors, actors));
+                trueMatches = result.list(r -> r.get("cluster_count").asLong());
+                result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_DELETED_ID, recordType1, recordType2, s, actors));
+                total = result.list(r -> r.get("cluster_count").asLong());
+            }
+
+            //print if both arent empty
+            if (!trueMatches.isEmpty() && !total.isEmpty()) {
+                long trueCount = trueMatches.get(0);
+                long totalCount = total.get(0);
+
+                System.out.println(s + " " + trueCount + "/" + totalCount + " " + ((double) trueCount / totalCount));
+            }
+        }
+    }
+
+    /**
+     * Method to calculate efficacy for ID resolvers (only created)
+     *
+     * @param toCreate array of predicate provenances which create links
+     * @param recordType1 type of record from
+     * @param recordType2 type of record to
+     * @param actors actors used in link
+     */
+    public void countIDEfficacyCreate(String[] toCreate, String recordType1, String recordType2, String actors){
+        System.out.println("Deleted");
+        for (String s : toCreate) {
+            Result result = bridge.getNewSession().run(String.format(CREATED_LINKS_QUERY_TRUE_ID, recordType1, recordType2, s, actors));
+            List<Long> trueMatches = result.list(r -> r.get("cluster_count").asLong()); //get links that are correct
+            result = bridge.getNewSession().run(String.format(LINKS_QUERY_TOTAL_CREATED_ID, recordType1, recordType2, s, actors));
+            List<Long> total = result.list(r -> r.get("cluster_count").asLong()); //get all links made
+
+            //print if both arent empty
+            if (!trueMatches.isEmpty() && !total.isEmpty()) {
+                long trueCount = trueMatches.get(0);
+                long totalCount = total.get(0);
+
+                System.out.println(s + " " + trueCount + "/" + totalCount + " " + ((double) trueCount / totalCount));
+            }
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/SiblingOpenTriangleResolver.java b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/SiblingOpenTriangleResolver.java
new file mode 100644
index 00000000..28bb4eee
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/SiblingOpenTriangleResolver.java
@@ -0,0 +1,372 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.resolvers;
+
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import uk.ac.standrews.cs.neoStorr.impl.LXP;
+import uk.ac.standrews.cs.neoStorr.impl.Store;
+import uk.ac.standrews.cs.neoStorr.impl.exceptions.BucketException;
+import uk.ac.standrews.cs.neoStorr.interfaces.IBucket;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.LXPMeasure;
+import uk.ac.standrews.cs.population_linkage.compositeMeasures.SumOfFieldDistances;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.msed.Binomials;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.msed.MSED;
+import uk.ac.standrews.cs.population_linkage.resolverExperiments.msed.OrderedList;
+import uk.ac.standrews.cs.population_records.RecordRepository;
+import uk.ac.standrews.cs.population_records.record_types.Birth;
+import uk.ac.standrews.cs.population_records.record_types.Death;
+import uk.ac.standrews.cs.utilities.measures.coreConcepts.StringMeasure;
+
+import java.time.LocalDate;
+import java.util.*;
+
+import static uk.ac.standrews.cs.population_linkage.linkageRecipes.LinkageRecipe.list;
+
+public abstract class SiblingOpenTriangleResolver {
+    protected static NeoDbCypherBridge bridge;
+    protected static RecordRepository record_repository;
+
+    //Various constants for predicates
+    protected static final int MAX_AGE_DIFFERENCE  = 24;
+    protected static final double DATE_THRESHOLD = 0.5;
+    protected static final double NAME_THRESHOLD = 0.5;
+    protected static final int BIRTH_INTERVAL = 270;
+
+    public SiblingOpenTriangleResolver(String sourceRepo) {
+        bridge = Store.getInstance().getBridge();
+        record_repository= new RecordRepository(sourceRepo);
+    }
+
+    /**
+     * Method of adding children to family sets
+     *
+     * @param familySets family sets to add to
+     * @param bs combination of children
+     */
+    protected void addFamilyMSED(List<Set<LXP>> familySets, List<LXP> bs) {
+        if(familySets.isEmpty()) { //if set is empty, add children automatically
+            familySets.add(new HashSet<>(bs));
+        }else{
+            boolean familyFound = false;
+            for(Set<LXP> fSet : familySets) { //if not, loop through sets
+                for (int i = 0; i < bs.size(); i++) {
+                    if (!Collections.disjoint(fSet, bs) && fSet.size() < 24) { //if a child is present in a set, add the rest as well
+                        fSet.addAll(bs);
+                        familyFound = true;
+                        break;
+                    }
+                }
+            }
+            if(!familyFound) { //if not child is found, create a new set
+                familySets.add(new HashSet<>(bs));
+            }
+        }
+    }
+
+    /**
+     * Method to get MSED distance for a combination of nodes
+     *
+     * @param family a set of records in a family
+     * @param k number of records in a combination
+     * @param recipe recipe to get linkage fields to get distance
+     * @return a list of combinations and their distances in order of distance
+     * @throws BucketException
+     */
+    protected OrderedList<List<LXP>,Double> getMSEDForK(Set<LXP> family, int k, LinkageRecipe recipe) throws BucketException {
+        OrderedList<List<LXP>,Double> all_mseds = new OrderedList<>(Integer.MAX_VALUE); // don't want a limit!
+        List<LXP> bs = new ArrayList<>(family);
+
+        List<List<Integer>> indices = Binomials.pickAll(bs.size(), k);
+        for (List<Integer> choices : indices) {
+            List<LXP> births = getRecordsFromChoices(bs, choices);
+            double distance = getMSEDForCluster(births, recipe);
+            all_mseds.add(births,distance);
+        }
+        return all_mseds;
+    }
+
+    /**
+     * Method to calculate the MESD for the cluster represented by the indices choices into bs
+     *
+     * @param choices records to get distance
+     * @param recipe recipe to get linkage fields to get distance
+     * @return MSED distance for cluster
+     */
+    protected double getMSEDForCluster(List<LXP> choices, LinkageRecipe recipe) {
+        List<String> fields_from_choices = new ArrayList<>(); // a list of the concatenated linkage fields from the selected choices.
+        List<Integer> linkage_fields = recipe.getLinkageFields(); // the linkage field indexes to be used
+        for (LXP a_birth : choices) {
+            StringBuilder sb = new StringBuilder();              // make a string of values for this record drawn from the recipe linkage fields
+            for (int field_selector : linkage_fields) {
+                sb.append(a_birth.get(field_selector) + "/");
+            }
+            fields_from_choices.add(sb.toString()); // add the linkage fields for this choice to the list being assessed
+        }
+        return MSED.distance(fields_from_choices);
+    }
+
+    /**
+     * Method to convert string representation of birthdays into LocalDate
+     *
+     * @param child child node
+     * @param isDead check if it is a death certificate
+     * @return birthday as LocalDate
+     */
+    protected LocalDate getBirthdayAsDate(LXP child, boolean isDead){
+        int day = 1;
+
+        if(isDead){
+            //if missing day, set to first of month
+            if(!Objects.equals(child.getString(Death.DATE_OF_BIRTH).substring(0, 2), "--")){
+                day = Integer.parseInt(child.getString(Death.DATE_OF_BIRTH).substring(0, 2));
+            }
+
+            //get date
+            return LocalDate.of(Integer.parseInt(child.getString(Death.DATE_OF_BIRTH).substring(6)), Integer.parseInt(child.getString(Death.DATE_OF_BIRTH).substring(3, 5)), day);
+        }else{
+            //if missing day, set to first of month
+            if(!Objects.equals(child.getString(Birth.BIRTH_DAY), "--")){
+                day = Integer.parseInt(child.getString(Birth.BIRTH_DAY));
+            }
+
+            //get date
+            return LocalDate.of(Integer.parseInt(child.getString(Birth.BIRTH_YEAR)), Integer.parseInt(child.getString(Birth.BIRTH_MONTH)), day);
+        }
+
+    }
+
+    /**
+     * Method to create a link between two records
+     *
+     * @param bridge Neo4j bridge
+     * @param std_id_x standardised id of record x
+     * @param std_id_z standardised id of record z
+     * @param prov provenance of resolver
+     */
+    protected void createLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_z, String prov, String createQuery) {
+        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction()) {
+            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_z, prov);
+            tx.run(createQuery, parameters);
+            tx.commit();
+        }
+    }
+
+    /**
+     * Method to create a delete link between two records, used in testing
+     *
+     * @param bridge Neo4j bridge
+     * @param std_id_x standardised id of record x
+     * @param std_id_y standardised id of record y
+     */
+    protected void deleteLink(NeoDbCypherBridge bridge, String std_id_x, String std_id_y, String prov, String deleteQuery){
+        try (Session session = bridge.getNewSession(); Transaction tx = session.beginTransaction();) {
+            Map<String, Object> parameters = getCreationParameterMap(std_id_x, std_id_y, prov);
+            tx.run(deleteQuery, parameters);
+            tx.commit();
+        }
+    }
+
+    /**
+     * Method to get map of parameters to be used in cypher queries
+     *
+     * @param standard_id_from record ID to link from
+     * @param standard_id_to record ID to link to
+     * @param prov provenance of resolver
+     * @return map of parameters
+     */
+    protected Map<String, Object> getCreationParameterMap(String standard_id_from, String standard_id_to, String prov) {
+        Map<String, Object> parameters = new HashMap<>();
+        parameters.put("standard_id_from", standard_id_from);
+        parameters.put("standard_id_to", standard_id_to);
+        parameters.put("prov", prov);
+        return parameters;
+    }
+
+
+    /**
+     * Get list of records from an array of choices. Used to generated binomial combinations
+     *
+     * @param bs list of records
+     * @param choices list of choices as index
+     * @return combinations of records
+     */
+    protected List<LXP> getRecordsFromChoices(List<LXP> bs, List<Integer> choices) {
+        List<LXP> records = new ArrayList<>();
+        for (int index : choices) {
+            records.add( bs.get(index) );
+        }
+        return records;
+    }
+
+    /**
+     * Method to get composite measure for dates to calculate distance
+     *
+     * @param base_measure base measure to be used
+     * @return composite measure
+     */
+    protected LXPMeasure getCompositeMeasureDate(StringMeasure base_measure) {
+        final List<Integer> LINKAGE_FIELDS = list(
+                Birth.PARENTS_DAY_OF_MARRIAGE,
+                Birth.PARENTS_MONTH_OF_MARRIAGE,
+                Birth.PARENTS_YEAR_OF_MARRIAGE
+        );
+
+        return new SumOfFieldDistances(base_measure, LINKAGE_FIELDS);
+    }
+
+    /**
+     * Method to get distance between two nodes based on their storr ID
+     *
+     * @param id1 ID of record 1
+     * @param id2 ID of record 2
+     * @param composite_measure measure to be used
+     * @param births births bucket
+     * @return distance between two records
+     * @throws BucketException
+     */
+    protected double getDistance(long id1, long id2, LXPMeasure composite_measure, IBucket births) throws BucketException {
+        LXP b1 = (LXP) births.getObjectById(id1);
+        LXP b2 = (LXP) births.getObjectById(id2);
+        return composite_measure.distance(b1, b2);
+    }
+
+    /**
+     * Method to resolve open triangles using MSED
+     *
+     * @param triangleChain chain of open triangles
+     * @param x x node in the cluster
+     * @param recipe recipe for particular linkage
+     * @param dPred predicate number to delete
+     * @throws BucketException
+     */
+    public void resolveTrianglesMSED(List<List<Long>> triangleChain, Long x, LinkageRecipe recipe, String dPred, int standID, String query) throws BucketException {
+        double THRESHOLD = 0.03;
+        double TUPLE_THRESHOLD = 0.01;
+
+        List<Set<LXP>> familySets = new ArrayList<>();
+        List<List<LXP>> toDelete = new ArrayList<>();
+
+        for (List<Long> chain : triangleChain){
+            List<Long> listWithX = new ArrayList<>(Arrays.asList(x));
+            listWithX.addAll(chain);
+            List<LXP> bs = getRecords(listWithX, record_repository);
+
+            cleanStrings(bs);
+
+            //If below threshold, add all children to family
+            double distance = getMSEDForCluster(bs, recipe);
+            double distanceXY = getMSEDForCluster(bs.subList(0, 2), recipe);
+            double distanceZY = getMSEDForCluster(bs.subList(1, 3), recipe);
+
+            if(distance < THRESHOLD) { //if above threshold, delete triangle links
+                addFamilyMSED(familySets, bs);
+            }else if(distance > THRESHOLD){
+                toDelete.add(bs);
+                if(distanceXY < TUPLE_THRESHOLD){ //check if xy are potential siblings
+                    addFamilyMSED(familySets, bs.subList(0, 2));
+                }
+                if (distanceZY < TUPLE_THRESHOLD){ //check if zy are potential siblings
+                    addFamilyMSED(familySets, bs.subList(1, 3));
+                }
+            }
+        }
+
+        List<Set<LXP>> setsToRemove = new ArrayList<>();
+        List<Set<LXP>> setsToAdd = new ArrayList<>();
+
+        //filter families further
+        for (Set<LXP> fSet : familySets) {
+            int k = 3;
+            if (fSet.size() >= k) { //filter only if family set is bigger than 3 siblings
+                OrderedList<List<LXP>,Double> familySetMSED = getMSEDForK(fSet, k, recipe); //get distances for all possible combinations of families
+                List<Double> distances = familySetMSED.getComparators();
+                List<List<LXP>> records = familySetMSED.getList();
+                List<Set<LXP>> newSets = new ArrayList<>();
+
+                newSets.add(new HashSet<>(records.get(0)));
+
+                //loop through each distance
+                for (int i = 1; i < distances.size(); i++) {
+                    //if distance increases dramatically or exceeds 0.01, assume one child is odd one out and dont add to family set
+                    if ((distances.get(i) - distances.get(i - 1)) / distances.get(i - 1) > 0.5 || distances.get(i) > 0.01) {
+                        break;
+                    } else {
+                        boolean familyFound = false;
+                        for (Set<LXP> nSet : newSets) {
+                            if (!Collections.disjoint(nSet, records.get(i))) {
+                                nSet.addAll(records.get(i));
+                                familyFound = true;
+                                break;
+                            }
+                        }
+
+                        if (!familyFound) {
+                            newSets.add(new HashSet<>(records.get(i)));
+                        }
+                    }
+                }
+
+                //add new sets
+                setsToRemove.add(fSet);
+                setsToAdd.addAll(newSets);
+            }
+        }
+
+        //reset current family sets
+        familySets.removeAll(setsToRemove);
+        familySets.addAll(setsToAdd);
+
+        //loop through all triangles to delete
+        for (List<LXP> triangleToDelete : toDelete) {
+            for(Set<LXP> fSet : familySets) {
+                if(fSet.size() > 1){
+                    int kidsFound = 0;
+                    List<Integer> kidsIndex = new ArrayList<>(Arrays.asList(0, 1, 2));
+                    for (int i = 0; i < triangleToDelete.size(); i++) { //identify if any of the family sets contain at least 2 children from triangle to delete
+                        if(fSet.contains(triangleToDelete.get(i))) {
+                            kidsIndex.remove((Integer.valueOf(i)));
+                            kidsFound++;
+                        }
+                    }
+
+                    //if the children were located, delete the odd one out
+                    if(kidsFound == 2 && kidsIndex.size() == 1) {
+                        if(kidsIndex.get(0) == 0){
+                            deleteLink(bridge, triangleToDelete.get(0).getString(standID), triangleToDelete.get(1).getString(Birth.STANDARDISED_ID), dPred, query);
+                            break;
+                        } else if (kidsIndex.get(0) == 2) {
+                            deleteLink(bridge, triangleToDelete.get(2).getString(standID), triangleToDelete.get(1).getString(Birth.STANDARDISED_ID), dPred, query);
+                            break;
+                        }
+                    }
+                }
+            }
+        }
+    }
+    protected abstract boolean mostCommonBirthPlacePredicate(OpenTriangleCluster cluster, boolean hasChanged, LXP[] tempKids, int predNumber);
+
+    protected abstract boolean minBirthIntervalPredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber);
+
+    protected abstract boolean maxRangePredicate(OpenTriangleCluster cluster, LXP[] tempKids, boolean hasChanged, int predNumber);
+
+    protected abstract void cleanStrings(List<LXP> bs);
+
+    protected abstract List<LXP> getRecords(List<Long> sibling_ids, RecordRepository record_repository) throws BucketException;
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/run_resolvers.sh b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/run_resolvers.sh
new file mode 100755
index 00000000..61c51412
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/resolvers/run_resolvers.sh
@@ -0,0 +1,40 @@
+#!/usr/bin/env bash
+#
+# Copyright 2022 Systems Research Group, University of St Andrews:
+# <https://github.com/stacs-srg>
+#
+# This file is part of the module population-linkage.
+#
+# population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+# License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+# version.
+#
+# population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+# warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+# <http://www.gnu.org/licenses/>.
+#
+
+echo "in dir $PWD"
+
+echo "1. Running Birth-Birth Sibling Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.BirthBirthOpenTriangleResolver" -Dexec.args="umea EVERYTHING"
+
+echo "2. Running Birth-Death Sibling Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.BirthDeathOpenTriangleResolver" -Dexec.args="umea EVERYTHING"
+
+echo "3. Running Death-Death Sibling Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.DeathDeathOpenTriangleResolver" -Dexec.args="umea EVERYTHING"
+
+echo "4. Running Birth-Death ID Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.BirthDeathIDGraphOpenTriangleResolver" -Dexec.args="umea"
+
+echo "5. Running Birth-Marriage ID Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.BirthMarriageIDOpenTriangleResolver" -Dexec.args="umea"
+
+echo "6. Running Birth-Marriage Parents ID Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.BirthParentsMarriageIDOpenTriangleResolver" -Dexec.args="umea"
+
+echo "7. Running Marriage-Marriage Parents ID Open Triangle Resolver"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.resolvers.MarriageParentsMarriageIDOpenTriangleResolver" -Dexec.args="umea"
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysis.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysis.java
new file mode 100644
index 00000000..87f1805a
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysis.java
@@ -0,0 +1,64 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import org.neo4j.driver.Result;
+import org.neo4j.driver.Session;
+import org.neo4j.driver.Transaction;
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public abstract class ThresholdTrianglesAnalysis {
+
+    /**
+     * Method to query the database for quality measurements
+     *
+     * @param query_string Cypher query
+     * @param threshold current threshold being analysed
+     * @param fields current field being analysed
+     * @param bridge Neo4j bridge
+     * @return results of query
+     */
+    protected static long doQuery(String query_string, double threshold, int fields, NeoDbCypherBridge bridge) {
+        Map<String, Object> parameters = new HashMap<>();
+        parameters.put("threshold", threshold);
+        parameters.put("field", fields);
+        Result result = bridge.getNewSession().run(query_string, parameters);
+        return (long) result.list(r -> r.get("count(r)").asInt()).get(0);
+    }
+
+    /**
+     * Method to delete links created when maximising threshold
+     *
+     * @param query_string Cypher query
+     * @param threshold current threshold being analysed
+     * @param fields current field being analysed
+     * @param bridge Neo4j bridge
+     */
+    protected static void doQueryDel(String query_string, double threshold, int fields, NeoDbCypherBridge bridge) {
+        Map<String, Object> parameters = new HashMap<>();
+        parameters.put("threshold", threshold);
+        parameters.put("field", fields);
+
+        Session session = bridge.getNewSession();
+        Transaction tx = session.beginTransaction();
+        tx.run(query_string, parameters);
+        tx.commit();
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthBirthSib.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthBirthSib.java
new file mode 100644
index 00000000..54f12eae
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthBirthSib.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthSiblingBundleBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthSiblingLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBirthBirthSib extends ThresholdTrianglesAnalysis {
+    private static final String BIRTH_BIRTH_SIBLING_TPC = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE (b1)-[:GT_SIBLING {actors: \"Child-Child\"}]-(b2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_BIRTH_SIBLING_FPC = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:GT_SIBLING {actors: \"Child-Child\"}]-(b2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_BIRTH_SIBLING_FNC = "MATCH (b1:Birth)-[r:GT_SIBLING { actors: \"Child-Child\"}]->(b2:Birth) WHERE NOT (b1)-[:SIBLING {actors: \"Child-Child\"}]-(b2) return count(r)";
+    private static final String BIRTH_BIRTH_SIBLING_FNC_T = "MATCH (b1:Birth)-[r:GT_SIBLING { actors: \"Child-Child\"}]->(b2:Birth), (b1)-[s:SIBLING]-(b2) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        BirthSiblingLinkageRecipe recipe = new BirthSiblingLinkageRecipe("umea", "EVERYTHING", BirthSiblingBundleBuilder.class.getName()) ;
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 8;
+        final int MIN_FIELD = 3; //1 below target
+        final double MAX_THRESHOLD = 2.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        recipe.setMaxThreshold(2);
+        BirthSiblingBundleBuilder.runBuilder(recipe, 0);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("birthbirth" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BIRTH_BIRTH_SIBLING_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BIRTH_BIRTH_SIBLING_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BIRTH_BIRTH_SIBLING_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BIRTH_BIRTH_SIBLING_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenTrianglesCumulative(bridge, "Birth", "Birth", i, currentField),
+                                    PatternsCounter.countOpenTrianglesSibFNOT(bridge, "Birth", "Birth", i, currentField));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(24, TimeUnit.HOURS);
+
+        resetThreshold(bridge, recipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BirthSiblingLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (b1:Birth)-[r:SIBLING {actors: \"Child-Child\"}]->(b2:Birth) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthBrideID.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthBrideID.java
new file mode 100644
index 00000000..e35a2f36
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthBrideID.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthBrideOwnMarriageBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthBrideIdentityLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBirthBrideID extends ThresholdTrianglesAnalysis {
+    private static final String BIRTH_BRIDE_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE (b)-[:GT_ID {actors: \"Child-Bride\"}]-(m) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_BRIDE_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE NOT (b)-[:GT_ID {actors: \"Child-Bride\"}]-(m) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_BRIDE_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Bride\"}]->(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Bride\"}]-(m) return count(r)";
+    private static final String BIRTH_BRIDE_ID_FNC_T = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Bride\"}]->(m:Marriage), (b)-[s:ID {actors: \"Child-Bride\"}]-(m) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        BirthBrideIdentityLinkageRecipe linkageRecipe = new BirthBrideIdentityLinkageRecipe("umea", "EVERYTHING", BirthBrideOwnMarriageBuilder.class.getName(), null);
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 6;
+        final int MIN_FIELD = 2; //1 below target
+        final double MAX_THRESHOLD = 2.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        linkageRecipe.setMaxThreshold(2);
+        BirthBrideOwnMarriageBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("birthbrideID" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BIRTH_BRIDE_ID_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BIRTH_BRIDE_ID_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BIRTH_BRIDE_ID_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BIRTH_BRIDE_ID_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Birth", "Marriage", i, currentField, true, "Bride"),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Birth", "Marriage", i, currentField, false, "Bride"));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BirthBrideIdentityLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (b:Birth)-[r:ID {actors: \"Child-Bride\"}]-(m:Marriage) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthDeathID.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthDeathID.java
new file mode 100644
index 00000000..4b27d132
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthDeathID.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthOwnDeathBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthDeathIdentityLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBirthDeathID extends ThresholdTrianglesAnalysis {
+    private static final String BIRTH_DEATH_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE (b)-[:GT_ID {actors: \"Child-Deceased\"}]-(d) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_DEATH_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE NOT (b)-[:GT_ID {actors: \"Child-Deceased\"}]-(d) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_DEATH_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Deceased\"}]->(d:Death) WHERE NOT (b)-[:ID {actors: \"Child-Deceased\"}]-(d) return count(r)";
+    private static final String BIRTH_DEATH_ID_FNC_T = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Deceased\"}]->(d:Death), (b)-[s:ID]-(d) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        BirthDeathIdentityLinkageRecipe linkageRecipe = new BirthDeathIdentityLinkageRecipe("umea", "EVERYTHING", BirthOwnDeathBuilder.class.getName());
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 6;
+        final int MIN_FIELD = 2; //1 below target
+        final double MAX_THRESHOLD = 2.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        linkageRecipe.setMaxThreshold(2);
+        BirthOwnDeathBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("birthdeathID" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BIRTH_DEATH_ID_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BIRTH_DEATH_ID_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BIRTH_DEATH_ID_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BIRTH_DEATH_ID_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Birth", "Death", i, currentField, true, null),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Birth", "Death", i, currentField, false, null));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BirthDeathIdentityLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (b:Birth)-[r:ID {actors: \"Child-Deceased\"}]-(d:Death) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthDeathSib.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthDeathSib.java
new file mode 100644
index 00000000..0f880096
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthDeathSib.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthDeathSiblingBundleBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthDeathSiblingLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBirthDeathSib extends ThresholdTrianglesAnalysis {
+    private static final String BIRTH_DEATH_SIBLING_TPC = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE (b)-[:GT_SIBLING {actors: \"Child-Deceased\"}]-(d) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_DEATH_SIBLING_FPC = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE NOT (b)-[:GT_SIBLING {actors: \"Child-Deceased\"}]-(d) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_DEATH_SIBLING_FNC = "MATCH (b:Birth)-[r:GT_SIBLING {actors: \"Child-Deceased\"}]-(d:Death) WHERE NOT (b)-[:SIBLING {actors: \"Deceased-Child\"}]-(d) return count(r)";
+    private static final String BIRTH_DEATH_SIBLING_FNC_T = "MATCH (b:Birth)-[r:GT_SIBLING {actors: \"Child-Deceased\"}]-(d:Death), (b)-[s:SIBLING]-(d) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        BirthDeathSiblingLinkageRecipe linkageRecipe = new BirthDeathSiblingLinkageRecipe("umea", "EVERYTHING", BirthDeathSiblingBundleBuilder.class.getName(), null);
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 4;
+        final int MIN_FIELD = 1; //1 below target
+        final double MAX_THRESHOLD = 1.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.0;
+
+        linkageRecipe.setMaxThreshold(1);
+        BirthDeathSiblingBundleBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("birthdeathsib" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BIRTH_DEATH_SIBLING_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BIRTH_DEATH_SIBLING_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BIRTH_DEATH_SIBLING_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BIRTH_DEATH_SIBLING_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenTrianglesBirthDeathSib(bridge, "Birth", "Death", i, currentField, true),
+                                    PatternsCounter.countOpenTrianglesBirthDeathSib(bridge, "Birth", "Death", i, currentField, false));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BirthDeathSiblingLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (b:Birth)-[r:SIBLING {actors: \"Deceased-Child\"}]-(d:Death) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthGroomID.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthGroomID.java
new file mode 100644
index 00000000..72322d02
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthGroomID.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthGroomOwnMarriageBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthGroomIdentityLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBirthGroomID extends ThresholdTrianglesAnalysis {
+    private static final String BIRTH_GROOM_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE (b)-[:GT_ID {actors: \"Child-Groom\"}]-(m) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_GROOM_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE NOT (b)-[:GT_ID {actors: \"Child-Groom\"}]-(m) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BIRTH_GROOM_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Groom\"}]->(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Groom\"}]-(m) return count(r)";
+    private static final String BIRTH_GROOM_ID_FNC_T = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Groom\"}]->(m:Marriage), (b)-[s:ID {actors: \"Child-Groom\"}]-(m) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        BirthGroomIdentityLinkageRecipe linkageRecipe = new BirthGroomIdentityLinkageRecipe("umea", "EVERYTHING", BirthGroomOwnMarriageBuilder.class.getName(), null);
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 6;
+        final int MIN_FIELD = 2; //1 below target
+        final double MAX_THRESHOLD = 2.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        linkageRecipe.setMaxThreshold(2);
+        BirthGroomOwnMarriageBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("birthgroomID" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BIRTH_GROOM_ID_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BIRTH_GROOM_ID_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BIRTH_GROOM_ID_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BIRTH_GROOM_ID_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Birth", "Marriage", i, currentField, true, "Groom"),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Birth", "Marriage", i, currentField, false, "Groom"));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BirthGroomIdentityLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (b:Birth)-[r:ID {actors: \"Child-Groom\"}]-(m:Marriage) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthParentsMarriage.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthParentsMarriage.java
new file mode 100644
index 00000000..630921ec
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBirthParentsMarriage.java
@@ -0,0 +1,117 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BirthParentsMarriageBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BirthParentsMarriageIdentityLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBirthParentsMarriage extends ThresholdTrianglesAnalysis {
+    private static final String BIRTH_MARRIAGE_ID_TPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Mother\"}]-(m:Marriage), (b)-[s:ID {actors: \"Child-Father\"}]-(m) WHERE (b)-[:GT_ID {actors: \"Child-Couple\"}]-(m) AND r.distance <= $threshold AND r.fields_populated >= $field AND s.distance <= $threshold AND s.fields_populated >= $field return count(r)";
+    private static final String BIRTH_MARRIAGE_ID_FPC = "MATCH (b:Birth)-[r:ID {actors: \"Child-Mother\"}]-(m:Marriage), (b)-[s:ID {actors: \"Child-Father\"}]-(m) WHERE NOT (b)-[:GT_ID {actors: \"Child-Couple\"}]-(m) AND r.distance <= $threshold AND r.fields_populated >= $field AND s.distance <= $threshold AND s.fields_populated >= $field return count(r)";
+    private static final String BIRTH_MARRIAGE_ID_FNC = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Couple\"}]-(m:Marriage) WHERE NOT (b)-[:ID {actors: \"Child-Mother\"}]-(m) and NOT (b)-[:ID {actors: \"Child-Father\"}]-(m) return count(r)";
+    private static final String BIRTH_MARRIAGE_ID_FNC_T = "MATCH (b:Birth)-[r:GT_ID {actors: \"Child-Couple\"}]-(m:Marriage), (b)-[s:ID {actors: \"Child-Mother\"}]-(m), (b)-[t:ID {actors: \"Child-Father\"}]-(m) WHERE (s.distance > $threshold OR s.fields_populated < $field) AND (t.distance > $threshold OR t.fields_populated < $field) return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        BirthParentsMarriageIdentityLinkageRecipe linkageRecipe = new BirthParentsMarriageIdentityLinkageRecipe("umea", "EVERYTHING", BirthParentsMarriageBuilder.class.getName());
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 8;
+        final int MIN_FIELD = 3; //1 below target
+        final double MAX_THRESHOLD = 2.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        linkageRecipe.setMaxThreshold(2);
+        BirthParentsMarriageBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("birthparentsIDS" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BIRTH_MARRIAGE_ID_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BIRTH_MARRIAGE_ID_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BIRTH_MARRIAGE_ID_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BIRTH_MARRIAGE_ID_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenTrianglesParentsMarriage(bridge, i, currentField, true),
+                                    PatternsCounter.countOpenTrianglesParentsMarriage(bridge, i, currentField, false));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BirthParentsMarriageIdentityLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (b:Birth)-[r:ID]-(m:Marriage) WHERE r.distance > $threshold AND r.fields_populated = $field " +
+                "AND (r.actors = \"Child-Mother\" OR r.actors = \"Child-Father\") DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBrideMarriageParentsMarriage.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBrideMarriageParentsMarriage.java
new file mode 100644
index 00000000..a1116d06
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisBrideMarriageParentsMarriage.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.BrideMarriageParentsMarriageBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.BrideMarriageParentsMarriageIdentityLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisBrideMarriageParentsMarriage extends ThresholdTrianglesAnalysis {
+    private static final String BRIDE_PARENTS_MARRIAGE_TPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE (m1)-[:GT_ID {actors: \"Bride-Couple\"}]-(m2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BRIDE_PARENTS_MARRIAGE_FPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:GT_ID {actors: \"Bride-Couple\"}]-(m2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String BRIDE_PARENTS_MARRIAGE_FNC = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:ID {actors: \"Bride-Couple\"}]-(m2) return count(r)";
+    private static final String BRIDE_PARENTS_MARRIAGE_FNC_T = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Bride-Couple\"}]->(m2:Marriage), (m1)-[s:ID {actors: \"Bride-Couple\"}]-(m2) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+    
+    public static void main(String[] args) throws Exception {
+        BrideMarriageParentsMarriageIdentityLinkageRecipe linkageRecipe = new BrideMarriageParentsMarriageIdentityLinkageRecipe("umea", "EVERYTHING", BrideMarriageParentsMarriageBuilder.class.getName());
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 4;
+        final int MIN_FIELD = 1; //1 below target
+        final double MAX_THRESHOLD = 1.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        linkageRecipe.setMaxThreshold(1);
+        BrideMarriageParentsMarriageBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("brideMarriageParents" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(BRIDE_PARENTS_MARRIAGE_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(BRIDE_PARENTS_MARRIAGE_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(BRIDE_PARENTS_MARRIAGE_FNC, threshold, currentField, localBridge)
+                                    + doQuery(BRIDE_PARENTS_MARRIAGE_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Marriage", "Marriage", i, currentField, true, "Bride"),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Marriage", "Marriage", i, currentField, false, "Bride"));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, BrideMarriageParentsMarriageIdentityLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (m1:Marriage)-[r:ID {actors: \"Bride-Couple\"}]->(m2:Marriage) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisDeathDeathSib.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisDeathDeathSib.java
new file mode 100644
index 00000000..3c74fd91
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisDeathDeathSib.java
@@ -0,0 +1,115 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.DeathSiblingBundleBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.DeathSiblingLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisDeathDeathSib extends ThresholdTrianglesAnalysis {
+    private static final String DEATH_DEATH_SIBLING_TPC = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE (d1)-[:GT_SIBLING {actors: \"Deceased-Deceased\"}]-(d2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String DEATH_DEATH_SIBLING_FPC = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE NOT (d1)-[:GT_SIBLING {actors: \"Deceased-Deceased\"}]-(d2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String DEATH_DEATH_SIBLING_FNC = "MATCH (d1:Death)-[r:GT_SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death) WHERE NOT (d1)-[:SIBLING {actors: \"Deceased-Deceased\"}]-(d2) return count(r)";
+    private static final String DEATH_DEATH_SIBLING_FNC_T = "MATCH (d1:Death)-[r:GT_SIBLING {actors: \"Deceased-Deceased\"}]->(d2:Death), (d1)-[s:SIBLING]-(d2) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        DeathSiblingLinkageRecipe linkageRecipe = new DeathSiblingLinkageRecipe("umea", "EVERYTHING", DeathSiblingBundleBuilder.class.getName());
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 4;
+        final int MIN_FIELD = 1; //1 below target
+        final double MAX_THRESHOLD = 1.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.0;
+
+        linkageRecipe.setMaxThreshold(1);
+        DeathSiblingBundleBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("deathdeath" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            long fpc = doQuery(DEATH_DEATH_SIBLING_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(DEATH_DEATH_SIBLING_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(DEATH_DEATH_SIBLING_FNC, threshold, currentField, localBridge)
+                                    + doQuery(DEATH_DEATH_SIBLING_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenTrianglesCumulative(bridge, "Death", "Death", i, currentField),
+                                    PatternsCounter.countOpenTrianglesIsomorphicSiblings(bridge, "Birth", "Death", i, currentField));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(24, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, DeathSiblingLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (d1:Death)-[r:SIBLING {actors: \"Deceased-Deceased\"}]-(d2:Death) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisGroomMarriageParentsMarriage.java b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisGroomMarriageParentsMarriage.java
new file mode 100644
index 00000000..8e9369dd
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/ThresholdTrianglesAnalysisGroomMarriageParentsMarriage.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright 2022 Systems Research Group, University of St Andrews:
+ * <https://github.com/stacs-srg>
+ *
+ * This file is part of the module population-linkage.
+ *
+ * population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+ * License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+ * version.
+ *
+ * population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+ * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+ * <http://www.gnu.org/licenses/>.
+ */
+package uk.ac.standrews.cs.population_linkage.thresholdAnalysers;
+
+import uk.ac.standrews.cs.neoStorr.util.NeoDbCypherBridge;
+import uk.ac.standrews.cs.population_linkage.resolvers.PatternsCounter;
+import uk.ac.standrews.cs.population_linkage.endToEnd.builders.GroomMarriageParentsMarriageBuilder;
+import uk.ac.standrews.cs.population_linkage.linkageRecipes.GroomMarriageParentsMarriageIdentityLinkageRecipe;
+import uk.ac.standrews.cs.utilities.ClassificationMetrics;
+
+import java.io.FileWriter;
+import java.io.IOException;
+import java.io.PrintWriter;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+public class ThresholdTrianglesAnalysisGroomMarriageParentsMarriage extends ThresholdTrianglesAnalysis {
+    private static final String GROOM_PARENTS_MARRIAGE_TPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE (m1)-[:GT_ID {actors: \"Groom-Couple\"}]-(m2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String GROOM_PARENTS_MARRIAGE_FPC = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:GT_ID {actors: \"Groom-Couple\"}]-(m2) AND r.distance <= $threshold AND r.fields_populated >= $field return count(r)";
+    private static final String GROOM_PARENTS_MARRIAGE_FNC = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE NOT (m1)-[:ID {actors: \"Groom-Couple\"}]-(m2) return count(r)";
+    private static final String GROOM_PARENTS_MARRIAGE_FNC_T = "MATCH (m1:Marriage)-[r:GT_ID {actors: \"Groom-Couple\"}]->(m2:Marriage), (m1)-[s:ID {actors: \"Groom-Couple\"}]-(m2) WHERE s.distance > $threshold OR s.fields_populated < $field return count(r)";
+
+    public static void main(String[] args) throws Exception {
+        GroomMarriageParentsMarriageIdentityLinkageRecipe linkageRecipe = new GroomMarriageParentsMarriageIdentityLinkageRecipe("umea", "EVERYTHING", GroomMarriageParentsMarriageBuilder.class.getName());
+        NeoDbCypherBridge bridge = new NeoDbCypherBridge();
+        final int MAX_FIELD = 4;
+        final int MIN_FIELD = 1; //1 below target
+        final double MAX_THRESHOLD = 1.01; //0.01 above target
+        final double MIN_THRESHOLD = 0.00;
+
+        linkageRecipe.setMaxThreshold(1);
+        GroomMarriageParentsMarriageBuilder.runBuilder(linkageRecipe);
+
+        ExecutorService executorService = Executors.newFixedThreadPool(MAX_FIELD - MIN_FIELD);
+
+        System.out.println("Analysing thresholds...");
+        //loop through each linkage field options
+        for (int fields = MAX_FIELD; fields > MIN_FIELD; fields--) {
+            final int currentField = fields;
+
+            executorService.submit(() -> {
+                try (FileWriter fileWriter = new FileWriter("groomMarriageParents" + currentField + ".csv");
+                     PrintWriter printWriter = new PrintWriter(fileWriter)) {
+
+                    //write headers
+                    printWriter.println("threshold,precision,recall,fmeasure,total,fnots");
+
+                    try (NeoDbCypherBridge localBridge = new NeoDbCypherBridge()) {
+                        for (double i = MIN_THRESHOLD; i < MAX_THRESHOLD; i += 0.01) {
+                            double threshold = Math.round(i * 100.0) / 100.0;
+
+                            //get quality measurements
+                            long fpc = doQuery(GROOM_PARENTS_MARRIAGE_FPC, threshold, currentField, localBridge);
+                            long tpc = doQuery(GROOM_PARENTS_MARRIAGE_TPC, threshold, currentField, localBridge);
+                            long fnc = doQuery(GROOM_PARENTS_MARRIAGE_FNC, threshold, currentField, localBridge)
+                                    + doQuery(GROOM_PARENTS_MARRIAGE_FNC_T, i, currentField, localBridge);
+
+                            //print to csv
+                            printWriter.printf("%.2f,%.5f,%.5f,%.5f,%d,%d%n",
+                                    threshold,
+                                    ClassificationMetrics.precision(tpc, fpc),
+                                    ClassificationMetrics.recall(tpc, fnc),
+                                    ClassificationMetrics.F1(tpc, fpc, fnc),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Marriage", "Marriage", i, currentField, true, "Groom"),
+                                    PatternsCounter.countOpenSquaresCumulativeID(bridge, "Marriage", "Marriage", i, currentField, false, "Groom"));
+                        }
+                    } catch (Exception e) {
+                        e.printStackTrace();
+                    }
+                } catch (IOException e) {
+                    e.printStackTrace();
+                }
+            });
+        }
+
+        executorService.shutdown();
+        executorService.awaitTermination(12, TimeUnit.HOURS);
+
+        resetThreshold(bridge, linkageRecipe);
+    }
+
+    /**
+     * Method to reset thresholds after maximising them for analysis
+     *
+     * @param bridge Neo4j bridge
+     * @param recipe linkage recipe used
+     */
+    private static void resetThreshold(NeoDbCypherBridge bridge, GroomMarriageParentsMarriageIdentityLinkageRecipe recipe) {
+        recipe.setMaxThreshold(0);
+        String resetString = "MATCH (m1:Marriage)-[r:ID {actors: \"Groom-Couple\"}]->(m2:Marriage) WHERE r.distance > $threshold AND r.fields_populated = $field DELETE r";
+
+        int linkage_fields = recipe.ALL_LINKAGE_FIELDS;
+        int half_fields = linkage_fields - (linkage_fields / 2 );
+
+        while (linkage_fields >= half_fields) {
+            recipe.setNumberLinkageFieldsRequired(linkage_fields);
+            doQueryDel(resetString, recipe.getThreshold(), linkage_fields, bridge);
+            linkage_fields--;
+        }
+    }
+}
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/run_threshold_analysis.sh b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/run_threshold_analysis.sh
new file mode 100644
index 00000000..5b8634a5
--- /dev/null
+++ b/src/main/java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/run_threshold_analysis.sh
@@ -0,0 +1,46 @@
+#!/usr/bin/env bash
+#
+# Copyright 2022 Systems Research Group, University of St Andrews:
+# <https://github.com/stacs-srg>
+#
+# This file is part of the module population-linkage.
+#
+# population-linkage is free software: you can redistribute it and/or modify it under the terms of the GNU General Public
+# License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later
+# version.
+#
+# population-linkage is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied
+# warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License along with population-linkage. If not, see
+# <http://www.gnu.org/licenses/>.
+#
+
+echo "in dir $PWD"
+
+echo "1. Running Birth-Birth Sibling Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBirthBirthSib"
+
+echo "2. Running Birth-Death ID Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBirthDeathID"
+
+echo "3. Running Death-Death Sibling Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisDeathDeathSib"
+
+echo "4. Running Birth-Marriage Groom ID Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBirthGroomID"
+
+echo "5. Running Birth-Marriage Bride ID Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBirthBrideID"
+
+echo "6. Running Marriage-Marriage Groom Parents ID Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisGroomMarriageParentsMarriage"
+
+echo "7. Running Marriage-Marriage Bride Parents ID Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBrideMarriageParentsMarriage"
+
+echo "8. Running Birth-Marriage Parents ID Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBirthParentsMarriage"
+
+echo "9. Running Birth-Death Sibling Threshold Analysis"
+mvn exec:java -q -Dexec.cleanupDaemonThreads=false -Dexec.mainClass="uk.ac.standrews.cs.population_linkage.thresholdAnalysers.ThresholdTrianglesAnalysisBirthDeathSib"
diff --git a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/threshold.py b/src/main/scripts/endtoend/runall.sh
similarity index 51%
rename from src/main/java/uk/ac/standrews/cs/population_linkage/aleks/threshold.py
rename to src/main/scripts/endtoend/runall.sh
index df83b7b3..34ba1cf7 100644
--- a/src/main/java/uk/ac/standrews/cs/population_linkage/aleks/threshold.py
+++ b/src/main/scripts/endtoend/runall.sh
@@ -15,32 +15,6 @@
 # <http://www.gnu.org/licenses/>.
 #
 
-import pandas as pd
-import matplotlib.pyplot as plt
-
-data = pd.read_csv('../../../../../../../../../birthbirthhalfplus.csv')
-
-fig, ax1 = plt.subplots(figsize=(10, 6))
-
-ax1.plot(data['threshold'], data['recall'], label='Recall', color='b')
-ax1.plot(data['threshold'], data['precision'], label='Precision', color='g')
-#ax1.plot(data['threshold'], data['fmeasure'], label='F1 Score', color='r')
-
-ax1.set_xlabel('Threshold')
-ax1.set_ylabel('Metrics', color='black')
-ax1.set_ylim(0, 1.1)
-
-ax1.legend(loc='upper left')
-
-ax2 = ax1.twinx()
-
-ax2.plot(data['threshold'], data['triangles'], label='Triangles', color='orange')
-
-ax2.set_ylabel('Triangles')
-
-ax2.legend(loc='upper right')
-
-plt.title('Threshold Analysis Birth-Birth Sibling +1')
-plt.grid(True)
-
-plt.show()
\ No newline at end of file
+. "$(dirname $0)"/../../java/uk/ac/standrews/cs/population_linkage/thresholdAnalysers/run_threshold_analysis.sh
+. "$(dirname $0)"/dolinkage_template.sh EVERYTHING
+. "$(dirname $0)"/../../java/uk/ac/standrews/cs/population_linkage/resolvers/run_resolvers.sh
\ No newline at end of file
diff --git a/src/main/scripts/install/setup_umea_in_storr.sh b/src/main/scripts/install/setup_umea_in_storr.sh
index 4399bb1e..6a1c0ced 100755
--- a/src/main/scripts/install/setup_umea_in_storr.sh
+++ b/src/main/scripts/install/setup_umea_in_storr.sh
@@ -19,7 +19,7 @@
 export MAVEN_OPTS="-Xmx16G"
 
 echo "Creating indices"
-java -cp ~/Documents/GitHub/data-umea-1.0-SNAPSHOT-jar-with-dependencies.jar uk.ac.standrews.cs.data.umea.store.CreateIndices
+java -cp ~/data-umea-1.0-SNAPSHOT-jar-with-dependencies.jar uk.ac.standrews.cs.data.umea.store.CreateIndices
 
 echo "Loading event records"
-java -cp ~/Documents/GitHub/data-umea-1.0-SNAPSHOT-jar-with-dependencies.jar uk.ac.standrews.cs.data.umea.store.ImportUmeaRecordsToStore
+java -cp ~/data-umea-1.0-SNAPSHOT-jar-with-dependencies.jar uk.ac.standrews.cs.data.umea.store.ImportUmeaRecordsToStore