@natlibfi/melinda-record-matching 2.2.1-alpha.1 → 2.2.1-alpha.2

package/dist/match-detection/features/bib/other-standard-identifier.js

@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _standardIdentifierFactory = _interopRequireDefault(require("./standard-identifier-factory"));
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js 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 Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+var _default = () => {
+  const {
+    extract,
+    compare
+  } = (0, _standardIdentifierFactory.default)({
+    pattern: /^024$/u,
+    subfieldCodes: ['a', 'z']
+  });
+  return {
+    extract,
+    compare,
+    name: 'Other standard identifier'
+  };
+};
+
+exports.default = _default;
+//# sourceMappingURL=other-standard-identifier.js.map

package/dist/match-detection/features/bib/other-standard-identifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"other-standard-identifier.js","names":["extract","compare","createInterface","pattern","subfieldCodes","name"],"sources":["../../../../src/match-detection/features/bib/other-standard-identifier.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createInterface from './standard-identifier-factory';\n\nexport default () => {\n  const {extract, compare} = createInterface({pattern: /^024$/u, subfieldCodes: ['a', 'z']});\n  return {extract, compare, name: 'Other standard identifier'};\n};\n"],"mappings":";;;;;;;AA4BA;;;;AA5BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAIe,MAAM;EACnB,MAAM;IAACA,OAAD;IAAUC;EAAV,IAAqB,IAAAC,kCAAA,EAAgB;IAACC,OAAO,EAAE,QAAV;IAAoBC,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN;EAAnC,CAAhB,CAA3B;EACA,OAAO;IAACJ,OAAD;IAAUC,OAAV;IAAmBI,IAAI,EAAE;EAAzB,CAAP;AACD,C"}

package/dist/match-detection/features/bib/publication-time.js

@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _matchingUtils = require("../../../matching-utils");
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js 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 Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+// We should also get copyright time and copyright/publication times from 26x
+// We could also enable matching of records which have consequent publication years
+var _default = () => ({
+  name: 'Publication time',
+  extract: record => {
+    var _record$get, _record$get$;
+
+    const value = ((_record$get = record.get(/^008$/u)) === null || _record$get === void 0 ? void 0 : (_record$get$ = _record$get[0]) === null || _record$get$ === void 0 ? void 0 : _record$get$.value) || undefined;
+    return (0, _matchingUtils.testStringOrNumber)(value) ? [String(value).slice(7, 11)] : [];
+  },
+  compare: (a, b) => a[0] === b[0] ? 0.1 : -1.0
+});
+
+exports.default = _default;
+//# sourceMappingURL=publication-time.js.map

package/dist/match-detection/features/bib/publication-time.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"publication-time.js","names":["name","extract","record","value","get","undefined","testStringOrNumber","String","slice","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/publication-time.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport {testStringOrNumber} from '../../../matching-utils';\n\n// We should also get copyright time and copyright/publication times from 26x\n// We could also enable matching of records which have consequent publication years\n\nexport default () => ({\n  name: 'Publication time',\n  extract: record => {\n    const value = record.get(/^008$/u)?.[0]?.value || undefined;\n    return testStringOrNumber(value) ? [String(value).slice(7, 11)] : [];\n  },\n  compare: (a, b) => a[0] === b[0] ? 0.1 : -1.0\n});\n"],"mappings":";;;;;;;AA4BA;;AA5BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAIA;AACA;eAEe,OAAO;EACpBA,IAAI,EAAE,kBADc;EAEpBC,OAAO,EAAEC,MAAM,IAAI;IAAA;;IACjB,MAAMC,KAAK,GAAG,gBAAAD,MAAM,CAACE,GAAP,CAAW,QAAX,6EAAuB,CAAvB,+DAA2BD,KAA3B,KAAoCE,SAAlD;IACA,OAAO,IAAAC,iCAAA,EAAmBH,KAAnB,IAA4B,CAACI,MAAM,CAACJ,KAAD,CAAN,CAAcK,KAAd,CAAoB,CAApB,EAAuB,EAAvB,CAAD,CAA5B,GAA2D,EAAlE;EACD,CALmB;EAMpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AANtB,CAAP,C"}

package/dist/match-detection/features/bib/record-type.js

@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js 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 Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+// we could handle the case of books/notes
+var _default = () => ({
+  name: 'Record type',
+  extract: r => r.leader[6] ? [r.leader[6]] : [],
+  compare: (a, b) => a[0] === b[0] ? 0.1 : -0.5
+});
+
+exports.default = _default;
+//# sourceMappingURL=record-type.js.map

package/dist/match-detection/features/bib/record-type.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"record-type.js","names":["name","extract","r","leader","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/record-type.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\n// we could handle the case of books/notes\n\nexport default () => ({\n  name: 'Record type',\n  extract: r => r.leader[6] ? [r.leader[6]] : [],\n  compare: (a, b) => a[0] === b[0] ? 0.1 : -0.5\n});\n"],"mappings":";;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;eAEe,OAAO;EACpBA,IAAI,EAAE,aADc;EAEpBC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAF,CAAS,CAAT,IAAc,CAACD,CAAC,CAACC,MAAF,CAAS,CAAT,CAAD,CAAd,GAA8B,EAFxB;EAGpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C"}

package/dist/match-detection/features/bib/standard-identifier-factory.js

@@ -0,0 +1,127 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _debug = _interopRequireDefault(require("debug"));
+
+var _matchingUtils = require("../../../matching-utils");
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js 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 Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:match-detection:features:standard-identifiers');
+const debugData = debug.extend('data');
+
+var _default = ({
+  pattern,
+  subfieldCodes
+}) => {
+  return {
+    extract,
+    compare
+  };
+
+  function extract(record) {
+    const [field] = record.get(pattern);
+
+    if (field) {
+      return field.subfields.filter(({
+        code
+      }) => subfieldCodes.includes(code)).map(({
+        code,
+        value
+      }) => ({
+        code,
+        value: (0, _matchingUtils.testStringOrNumber)(value) ? String(value).replace(/-/ug, '') : ''
+      })).filter(value => value);
+    }
+
+    return [];
+  }
+
+  function compare(a, b) {
+    if (a.length === 0 || b.length === 0) {
+      debugData(`No standardidentifiers to compare`);
+      return 0;
+    }
+
+    if (bothHaveValidIdentifiers()) {
+      const {
+        maxValues,
+        matchingValues
+      } = getValueCount(true);
+      return matchingValues / maxValues * 0.75;
+    }
+
+    const {
+      maxValues,
+      matchingValues
+    } = getValueCount();
+    return matchingValues / maxValues * 0.2;
+
+    function bothHaveValidIdentifiers() {
+      const aValues = a.filter(({
+        code
+      }) => code === 'a');
+      const bValues = a.filter(({
+        code
+      }) => code === 'a');
+      return aValues.length > 0 && bValues.length > 0;
+    }
+
+    function getValueCount(validOnly = false) {
+      const aValues = getIdentifiers(a);
+      const bValues = getIdentifiers(b);
+      return {
+        maxValues: aValues.length > bValues.length ? aValues.length : bValues.length,
+        matchingValues: aValues.filter(aValue => bValues.some(bValue => aValue === bValue)).length
+      };
+
+      function getIdentifiers(values) {
+        if (validOnly) {
+          return values.filter(({
+            code
+          }) => code === 'a').map(({
+            value
+          }) => value);
+        }
+
+        return values.map(({
+          value
+        }) => value);
+      }
+    }
+  }
+};
+
+exports.default = _default;
+//# sourceMappingURL=standard-identifier-factory.js.map

package/dist/match-detection/features/bib/standard-identifier-factory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"standard-identifier-factory.js","names":["debug","createDebugLogger","debugData","extend","pattern","subfieldCodes","extract","compare","record","field","get","subfields","filter","code","includes","map","value","testStringOrNumber","String","replace","a","b","length","bothHaveValidIdentifiers","maxValues","matchingValues","getValueCount","aValues","bValues","validOnly","getIdentifiers","aValue","some","bValue","values"],"sources":["../../../../src/match-detection/features/bib/standard-identifier-factory.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport {testStringOrNumber} from '../../../matching-utils';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:standard-identifiers');\nconst debugData = debug.extend('data');\n\nexport default ({pattern, subfieldCodes}) => {\n  return {extract, compare};\n\n  function extract(record) {\n    const [field] = record.get(pattern);\n\n    if (field) {\n      return field.subfields\n        .filter(({code}) => subfieldCodes.includes(code))\n        .map(({code, value}) => ({code, value: testStringOrNumber(value) ? String(value).replace(/-/ug, '') : ''}))\n        .filter(value => value);\n    }\n\n    return [];\n  }\n\n  function compare(a, b) {\n    if (a.length === 0 || b.length === 0) {\n      debugData(`No standardidentifiers to compare`);\n      return 0;\n    }\n\n    if (bothHaveValidIdentifiers()) {\n      const {maxValues, matchingValues} = getValueCount(true);\n      return matchingValues / maxValues * 0.75;\n    }\n\n    const {maxValues, matchingValues} = getValueCount();\n    return matchingValues / maxValues * 0.2;\n\n    function bothHaveValidIdentifiers() {\n      const aValues = a.filter(({code}) => code === 'a');\n      const bValues = a.filter(({code}) => code === 'a');\n      return aValues.length > 0 && bValues.length > 0;\n    }\n\n    function getValueCount(validOnly = false) {\n      const aValues = getIdentifiers(a);\n      const bValues = getIdentifiers(b);\n\n      return {\n        maxValues: aValues.length > bValues.length ? aValues.length : bValues.length,\n        matchingValues: aValues.filter(aValue => bValues.some(bValue => aValue === bValue)).length\n      };\n\n      function getIdentifiers(values) {\n        if (validOnly) {\n          return values\n            .filter(({code}) => code === 'a')\n            .map(({value}) => value);\n        }\n\n        return values.map(({value}) => value);\n      }\n    }\n  }\n};\n"],"mappings":";;;;;;;AA4BA;;AACA;;;;AA7BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,iFAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;;eAEe,CAAC;EAACC,OAAD;EAAUC;AAAV,CAAD,KAA8B;EAC3C,OAAO;IAACC,OAAD;IAAUC;EAAV,CAAP;;EAEA,SAASD,OAAT,CAAiBE,MAAjB,EAAyB;IACvB,MAAM,CAACC,KAAD,IAAUD,MAAM,CAACE,GAAP,CAAWN,OAAX,CAAhB;;IAEA,IAAIK,KAAJ,EAAW;MACT,OAAOA,KAAK,CAACE,SAAN,CACJC,MADI,CACG,CAAC;QAACC;MAAD,CAAD,KAAYR,aAAa,CAACS,QAAd,CAAuBD,IAAvB,CADf,EAEJE,GAFI,CAEA,CAAC;QAACF,IAAD;QAAOG;MAAP,CAAD,MAAoB;QAACH,IAAD;QAAOG,KAAK,EAAE,IAAAC,iCAAA,EAAmBD,KAAnB,IAA4BE,MAAM,CAACF,KAAD,CAAN,CAAcG,OAAd,CAAsB,KAAtB,EAA6B,EAA7B,CAA5B,GAA+D;MAA7E,CAApB,CAFA,EAGJP,MAHI,CAGGI,KAAK,IAAIA,KAHZ,CAAP;IAID;;IAED,OAAO,EAAP;EACD;;EAED,SAAST,OAAT,CAAiBa,CAAjB,EAAoBC,CAApB,EAAuB;IACrB,IAAID,CAAC,CAACE,MAAF,KAAa,CAAb,IAAkBD,CAAC,CAACC,MAAF,KAAa,CAAnC,EAAsC;MACpCpB,SAAS,CAAE,mCAAF,CAAT;MACA,OAAO,CAAP;IACD;;IAED,IAAIqB,wBAAwB,EAA5B,EAAgC;MAC9B,MAAM;QAACC,SAAD;QAAYC;MAAZ,IAA8BC,aAAa,CAAC,IAAD,CAAjD;MACA,OAAOD,cAAc,GAAGD,SAAjB,GAA6B,IAApC;IACD;;IAED,MAAM;MAACA,SAAD;MAAYC;IAAZ,IAA8BC,aAAa,EAAjD;IACA,OAAOD,cAAc,GAAGD,SAAjB,GAA6B,GAApC;;IAEA,SAASD,wBAAT,GAAoC;MAClC,MAAMI,OAAO,GAAGP,CAAC,CAACR,MAAF,CAAS,CAAC;QAACC;MAAD,CAAD,KAAYA,IAAI,KAAK,GAA9B,CAAhB;MACA,MAAMe,OAAO,GAAGR,CAAC,CAACR,MAAF,CAAS,CAAC;QAACC;MAAD,CAAD,KAAYA,IAAI,KAAK,GAA9B,CAAhB;MACA,OAAOc,OAAO,CAACL,MAAR,GAAiB,CAAjB,IAAsBM,OAAO,CAACN,MAAR,GAAiB,CAA9C;IACD;;IAED,SAASI,aAAT,CAAuBG,SAAS,GAAG,KAAnC,EAA0C;MACxC,MAAMF,OAAO,GAAGG,cAAc,CAACV,CAAD,CAA9B;MACA,MAAMQ,OAAO,GAAGE,cAAc,CAACT,CAAD,CAA9B;MAEA,OAAO;QACLG,SAAS,EAAEG,OAAO,CAACL,MAAR,GAAiBM,OAAO,CAACN,MAAzB,GAAkCK,OAAO,CAACL,MAA1C,GAAmDM,OAAO,CAACN,MADjE;QAELG,cAAc,EAAEE,OAAO,CAACf,MAAR,CAAemB,MAAM,IAAIH,OAAO,CAACI,IAAR,CAAaC,MAAM,IAAIF,MAAM,KAAKE,MAAlC,CAAzB,EAAoEX;MAF/E,CAAP;;MAKA,SAASQ,cAAT,CAAwBI,MAAxB,EAAgC;QAC9B,IAAIL,SAAJ,EAAe;UACb,OAAOK,MAAM,CACVtB,MADI,CACG,CAAC;YAACC;UAAD,CAAD,KAAYA,IAAI,KAAK,GADxB,EAEJE,GAFI,CAEA,CAAC;YAACC;UAAD,CAAD,KAAaA,KAFb,CAAP;QAGD;;QAED,OAAOkB,MAAM,CAACnB,GAAP,CAAW,CAAC;UAACC;QAAD,CAAD,KAAaA,KAAxB,CAAP;MACD;IACF;EACF;AACF,C"}

package/dist/match-detection/features/bib/title.js

@@ -0,0 +1,95 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+var _debug = _interopRequireDefault(require("debug"));
+
+var _natural = require("natural");
+
+var _matchingUtils = require("../../../matching-utils");
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js 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 Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+var _default = ({
+  treshold = 10
+} = {}) => ({
+  name: 'Title',
+  extract: record => {
+    const title = getTitle();
+
+    if ((0, _matchingUtils.testStringOrNumber)(title)) {
+      return [String(title).replace(/[^\p{Letter}\p{Number}]/gu, '').toLowerCase()];
+    }
+
+    return [];
+
+    function getTitle() {
+      const [field] = record.get(/^245$/u);
+
+      if (field) {
+        return field.subfields.filter(({
+          code
+        }) => ['a', 'b'].includes(code)).map(({
+          value
+        }) => (0, _matchingUtils.testStringOrNumber)(value) ? String(value) : '').join('');
+      }
+
+      return false;
+    }
+  },
+  compare: (a, b) => {
+    const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:match-detection:features/bib/title');
+    const distance = (0, _natural.LevenshteinDistance)(a[0], b[0]);
+
+    if (distance === 0) {
+      return 0.5;
+    }
+
+    const maxLength = getMaxLength();
+    const percentage = distance / maxLength * 100;
+    debug(`'${a}' vs '${b}': Max length = ${maxLength}, distance = ${distance}, percentage = ${percentage}`);
+
+    if (percentage <= treshold) {
+      return 0.3;
+    }
+
+    return -0.5;
+
+    function getMaxLength() {
+      return a[0].length > b[0].length ? a[0].length : b[0].length;
+    }
+  }
+});
+
+exports.default = _default;
+//# sourceMappingURL=title.js.map

package/dist/match-detection/features/bib/title.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"title.js","names":["treshold","name","extract","record","title","getTitle","testStringOrNumber","String","replace","toLowerCase","field","get","subfields","filter","code","includes","map","value","join","compare","a","b","debug","createDebugLogger","distance","leven","maxLength","getMaxLength","percentage","length"],"sources":["../../../../src/match-detection/features/bib/title.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport {LevenshteinDistance as leven} from 'natural';\nimport {testStringOrNumber} from '../../../matching-utils';\n\nexport default ({treshold = 10} = {}) => ({\n  name: 'Title',\n  extract: record => {\n    const title = getTitle();\n\n    if (testStringOrNumber(title)) {\n      return [String(title).replace(/[^\\p{Letter}\\p{Number}]/gu, '').toLowerCase()];\n    }\n\n    return [];\n\n    function getTitle() {\n      const [field] = record.get(/^245$/u);\n\n      if (field) {\n        return field.subfields\n          .filter(({code}) => ['a', 'b'].includes(code))\n          .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n          .join('');\n      }\n      return false;\n    }\n  },\n  compare: (a, b) => {\n    const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features/bib/title');\n    const distance = leven(a[0], b[0]);\n\n    if (distance === 0) {\n      return 0.5;\n    }\n\n    const maxLength = getMaxLength();\n    const percentage = distance / maxLength * 100;\n\n    debug(`'${a}' vs '${b}': Max length = ${maxLength}, distance = ${distance}, percentage = ${percentage}`);\n\n    if (percentage <= treshold) {\n      return 0.3;\n    }\n\n    return -0.5;\n\n    function getMaxLength() {\n      return a[0].length > b[0].length ? a[0].length : b[0].length;\n    }\n\n  }\n});\n"],"mappings":";;;;;;;AA4BA;;AACA;;AACA;;;;AA9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAMe,CAAC;EAACA,QAAQ,GAAG;AAAZ,IAAkB,EAAnB,MAA2B;EACxCC,IAAI,EAAE,OADkC;EAExCC,OAAO,EAAEC,MAAM,IAAI;IACjB,MAAMC,KAAK,GAAGC,QAAQ,EAAtB;;IAEA,IAAI,IAAAC,iCAAA,EAAmBF,KAAnB,CAAJ,EAA+B;MAC7B,OAAO,CAACG,MAAM,CAACH,KAAD,CAAN,CAAcI,OAAd,CAAsB,2BAAtB,EAAmD,EAAnD,EAAuDC,WAAvD,EAAD,CAAP;IACD;;IAED,OAAO,EAAP;;IAEA,SAASJ,QAAT,GAAoB;MAClB,MAAM,CAACK,KAAD,IAAUP,MAAM,CAACQ,GAAP,CAAW,QAAX,CAAhB;;MAEA,IAAID,KAAJ,EAAW;QACT,OAAOA,KAAK,CAACE,SAAN,CACJC,MADI,CACG,CAAC;UAACC;QAAD,CAAD,KAAY,CAAC,GAAD,EAAM,GAAN,EAAWC,QAAX,CAAoBD,IAApB,CADf,EAEJE,GAFI,CAEA,CAAC;UAACC;QAAD,CAAD,KAAa,IAAAX,iCAAA,EAAmBW,KAAnB,IAA4BV,MAAM,CAACU,KAAD,CAAlC,GAA4C,EAFzD,EAGJC,IAHI,CAGC,EAHD,CAAP;MAID;;MACD,OAAO,KAAP;IACD;EACF,CAtBuC;EAuBxCC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IACjB,MAAMC,KAAK,GAAG,IAAAC,cAAA,EAAkB,sEAAlB,CAAd;IACA,MAAMC,QAAQ,GAAG,IAAAC,4BAAA,EAAML,CAAC,CAAC,CAAD,CAAP,EAAYC,CAAC,CAAC,CAAD,CAAb,CAAjB;;IAEA,IAAIG,QAAQ,KAAK,CAAjB,EAAoB;MAClB,OAAO,GAAP;IACD;;IAED,MAAME,SAAS,GAAGC,YAAY,EAA9B;IACA,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAX,GAAuB,GAA1C;IAEAJ,KAAK,CAAE,IAAGF,CAAE,SAAQC,CAAE,mBAAkBK,SAAU,gBAAeF,QAAS,kBAAiBI,UAAW,EAAjG,CAAL;;IAEA,IAAIA,UAAU,IAAI5B,QAAlB,EAA4B;MAC1B,OAAO,GAAP;IACD;;IAED,OAAO,CAAC,GAAR;;IAEA,SAAS2B,YAAT,GAAwB;MACtB,OAAOP,CAAC,CAAC,CAAD,CAAD,CAAKS,MAAL,GAAcR,CAAC,CAAC,CAAD,CAAD,CAAKQ,MAAnB,GAA4BT,CAAC,CAAC,CAAD,CAAD,CAAKS,MAAjC,GAA0CR,CAAC,CAAC,CAAD,CAAD,CAAKQ,MAAtD;IACD;EAEF;AA9CuC,CAA3B,C"}

package/dist/match-detection/features/index.js

@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bib = void 0;
+
+var bib = _interopRequireWildcard(require("./bib"));
+
+exports.bib = bib;
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+//# sourceMappingURL=index.js.map

package/dist/match-detection/features/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../src/match-detection/features/index.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport * as bib from './bib';\nexport {bib};\n"],"mappings":";;;;;;;AA4BA"}

package/dist/match-detection/index.js

@@ -0,0 +1,184 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.features = exports.default = void 0;
+
+var _debug = _interopRequireDefault(require("debug"));
+
+var features = _interopRequireWildcard(require("./features"));
+
+exports.features = features;
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/* eslint-disable no-console */
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js 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 Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+var _default = ({
+  strategy,
+  treshold = 0.9
+}, returnStrategy = false) => (recordA, recordB) => {
+  const minProbabilityQuantifier = 0.5;
+  const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:match-detection');
+  const debugData = debug.extend('data');
+  debugData(`Strategy: ${JSON.stringify(strategy)}`);
+  debugData(`Treshold: ${JSON.stringify(treshold)}`);
+  debugData(`ReturnStrategy: ${JSON.stringify(returnStrategy)}`);
+  const featuresA = extractFeatures(recordA);
+  debug(`We got an array of records: ${Array.isArray(recordB)}`);
+  const recordsB = Array.isArray(recordB) ? recordB : [recordB];
+  const detectionResults = recordsB.map(record => actualDetection(featuresA, record));
+  return Array.isArray(recordB) ? detectionResults : detectionResults[0];
+
+  function actualDetection(featuresA, record) {
+    const featuresB = extractFeatures(record);
+    debugData(`Features (a): ${JSON.stringify(featuresA)}`);
+    debugData(`Features (b): ${JSON.stringify(featuresB)}`);
+    const featurePairs = generateFeaturePairs(featuresA, featuresB);
+    const similarityVector = generateSimilarityVector(featurePairs);
+
+    if (similarityVector.some(v => v >= minProbabilityQuantifier)) {
+      const probability = calculateprobability(similarityVector);
+      debug(`probability: ${probability} (Treshold: ${treshold})`);
+      return returnResult({
+        match: probability >= treshold,
+        probability
+      });
+    }
+
+    debugData(`No feature yielded minimum probability amount of points (${minProbabilityQuantifier})`);
+    return returnResult({
+      match: false,
+      probability: 0.0
+    });
+  }
+
+  function extractFeatures(record) {
+    return strategy.reduce((acc, {
+      name,
+      extract
+    }) => acc.concat({
+      name,
+      value: extract(record)
+    }), []);
+  }
+
+  function returnResult(result) {
+    if (returnStrategy) {
+      debug(`Returning detection strategy with the result`);
+      const resultWithStrategy = {
+        match: result.match,
+        probability: result.probability,
+        strategy: formatStrategy(strategy),
+        treshold
+      };
+      debugData(`${JSON.stringify(resultWithStrategy)}`);
+      return resultWithStrategy;
+    }
+
+    return result;
+  }
+
+  function formatStrategy(strategy) {
+    const strategyNames = strategy.map(element => element.name);
+    return strategyNames || [];
+  }
+
+  function calculateprobability(similarityVector) {
+    const probability = similarityVector.reduce((acc, v) => acc + v, 0.0);
+    return probability > 1.0 ? 1.0 : probability;
+  }
+
+  function generateSimilarityVector(featurePairs) {
+    const compared = featurePairs.map(({
+      name,
+      a,
+      b
+    }) => {
+      const {
+        compare
+      } = strategy.find(({
+        name: featureName
+      }) => name === featureName);
+      const points = compare(a, b);
+      return {
+        name,
+        points
+      };
+    });
+    debugData(`Points: ${JSON.stringify(compared)}`);
+    return compared.map(({
+      points
+    }) => points);
+  }
+
+  function generateFeaturePairs(featuresA, featuresB) {
+    const pairs = generatePairs();
+    const missingFeatures = findMissing();
+    debug(`Not comparing the following features because one, or both records are missing features: ${JSON.stringify(missingFeatures)}`);
+    return pairs;
+
+    function generatePairs() {
+      return featuresA.reduce((acc, {
+        name,
+        value
+      }, index) => acc.concat({
+        name,
+        a: value,
+        b: featuresB[index].value
+      }), []).filter(({
+        a,
+        b
+      }) => {
+        if (a.length === 0 || b.length === 0) {
+          return false;
+        }
+
+        return true;
+      });
+    }
+
+    function findMissing() {
+      return featuresA.map(({
+        name
+      }) => name).filter(v => pairs.some(({
+        name
+      }) => name === v) === false);
+    }
+  }
+};
+
+exports.default = _default;
+//# sourceMappingURL=index.js.map

package/dist/match-detection/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["strategy","treshold","returnStrategy","recordA","recordB","minProbabilityQuantifier","debug","createDebugLogger","debugData","extend","JSON","stringify","featuresA","extractFeatures","Array","isArray","recordsB","detectionResults","map","record","actualDetection","featuresB","featurePairs","generateFeaturePairs","similarityVector","generateSimilarityVector","some","v","probability","calculateprobability","returnResult","match","reduce","acc","name","extract","concat","value","result","resultWithStrategy","formatStrategy","strategyNames","element","compared","a","b","compare","find","featureName","points","pairs","generatePairs","missingFeatures","findMissing","index","filter","length"],"sources":["../../src/match-detection/index.js"],"sourcesContent":["/* eslint-disable no-console */\n/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport * as features from './features';\n\nexport {features};\n\nexport default ({strategy, treshold = 0.9}, returnStrategy = false) => (recordA, recordB) => {\n  const minProbabilityQuantifier = 0.5;\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection');\n  const debugData = debug.extend('data');\n\n  debugData(`Strategy: ${JSON.stringify(strategy)}`);\n  debugData(`Treshold: ${JSON.stringify(treshold)}`);\n  debugData(`ReturnStrategy: ${JSON.stringify(returnStrategy)}`);\n\n  const featuresA = extractFeatures(recordA);\n\n  debug(`We got an array of records: ${Array.isArray(recordB)}`);\n  const recordsB = Array.isArray(recordB) ? recordB : [recordB];\n  const detectionResults = recordsB.map(record => actualDetection(featuresA, record));\n\n  return Array.isArray(recordB) ? detectionResults : detectionResults[0];\n\n  function actualDetection(featuresA, record) {\n\n    const featuresB = extractFeatures(record);\n\n    debugData(`Features (a): ${JSON.stringify(featuresA)}`);\n    debugData(`Features (b): ${JSON.stringify(featuresB)}`);\n\n    const featurePairs = generateFeaturePairs(featuresA, featuresB);\n    const similarityVector = generateSimilarityVector(featurePairs);\n\n    if (similarityVector.some(v => v >= minProbabilityQuantifier)) {\n      const probability = calculateprobability(similarityVector);\n      debug(`probability: ${probability} (Treshold: ${treshold})`);\n      return returnResult({match: probability >= treshold, probability});\n    }\n\n    debugData(`No feature yielded minimum probability amount of points (${minProbabilityQuantifier})`);\n    return returnResult({match: false, probability: 0.0});\n  }\n\n  function extractFeatures(record) {\n    return strategy.reduce((acc, {name, extract}) => acc.concat({name, value: extract(record)}), []);\n  }\n\n  function returnResult(result) {\n    if (returnStrategy) {\n      debug(`Returning detection strategy with the result`);\n      const resultWithStrategy = {match: result.match, probability: result.probability, strategy: formatStrategy(strategy), treshold};\n      debugData(`${JSON.stringify(resultWithStrategy)}`);\n      return resultWithStrategy;\n    }\n    return result;\n  }\n\n  function formatStrategy(strategy) {\n    const strategyNames = strategy.map(element => element.name);\n    return strategyNames || [];\n  }\n\n  function calculateprobability(similarityVector) {\n    const probability = similarityVector.reduce((acc, v) => acc + v, 0.0);\n    return probability > 1.0 ? 1.0 : probability;\n  }\n\n  function generateSimilarityVector(featurePairs) {\n    const compared = featurePairs.map(({name, a, b}) => {\n      const {compare} = strategy.find(({name: featureName}) => name === featureName);\n      const points = compare(a, b);\n      return {name, points};\n    });\n\n    debugData(`Points: ${JSON.stringify(compared)}`);\n    return compared.map(({points}) => points);\n  }\n\n  function generateFeaturePairs(featuresA, featuresB) {\n    const pairs = generatePairs();\n    const missingFeatures = findMissing();\n\n    debug(`Not comparing the following features because one, or both records are missing features: ${JSON.stringify(missingFeatures)}`);\n    return pairs;\n\n    function generatePairs() {\n      return featuresA\n        .reduce((acc, {name, value}, index) => acc.concat({\n          name,\n          a: value,\n          b: featuresB[index].value\n        }), [])\n        .filter(({a, b}) => {\n          if (a.length === 0 || b.length === 0) {\n            return false;\n          }\n\n          return true;\n        });\n    }\n\n    function findMissing() {\n      return featuresA\n        .map(({name}) => name)\n        .filter(v => pairs.some(({name}) => name === v) === false);\n    }\n  }\n\n};\n"],"mappings":";;;;;;;AA6BA;;AACA;;;;;;;;;;AA9BA;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAOe,CAAC;EAACA,QAAD;EAAWC,QAAQ,GAAG;AAAtB,CAAD,EAA6BC,cAAc,GAAG,KAA9C,KAAwD,CAACC,OAAD,EAAUC,OAAV,KAAsB;EAC3F,MAAMC,wBAAwB,GAAG,GAAjC;EAEA,MAAMC,KAAK,GAAG,IAAAC,cAAA,EAAkB,mDAAlB,CAAd;EACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;EAEAD,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAeX,QAAf,CAAyB,EAAvC,CAAT;EACAQ,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAeV,QAAf,CAAyB,EAAvC,CAAT;EACAO,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAL,CAAeT,cAAf,CAA+B,EAAnD,CAAT;EAEA,MAAMU,SAAS,GAAGC,eAAe,CAACV,OAAD,CAAjC;EAEAG,KAAK,CAAE,+BAA8BQ,KAAK,CAACC,OAAN,CAAcX,OAAd,CAAuB,EAAvD,CAAL;EACA,MAAMY,QAAQ,GAAGF,KAAK,CAACC,OAAN,CAAcX,OAAd,IAAyBA,OAAzB,GAAmC,CAACA,OAAD,CAApD;EACA,MAAMa,gBAAgB,GAAGD,QAAQ,CAACE,GAAT,CAAaC,MAAM,IAAIC,eAAe,CAACR,SAAD,EAAYO,MAAZ,CAAtC,CAAzB;EAEA,OAAOL,KAAK,CAACC,OAAN,CAAcX,OAAd,IAAyBa,gBAAzB,GAA4CA,gBAAgB,CAAC,CAAD,CAAnE;;EAEA,SAASG,eAAT,CAAyBR,SAAzB,EAAoCO,MAApC,EAA4C;IAE1C,MAAME,SAAS,GAAGR,eAAe,CAACM,MAAD,CAAjC;IAEAX,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAL,CAAeC,SAAf,CAA0B,EAA5C,CAAT;IACAJ,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAL,CAAeU,SAAf,CAA0B,EAA5C,CAAT;IAEA,MAAMC,YAAY,GAAGC,oBAAoB,CAACX,SAAD,EAAYS,SAAZ,CAAzC;IACA,MAAMG,gBAAgB,GAAGC,wBAAwB,CAACH,YAAD,CAAjD;;IAEA,IAAIE,gBAAgB,CAACE,IAAjB,CAAsBC,CAAC,IAAIA,CAAC,IAAItB,wBAAhC,CAAJ,EAA+D;MAC7D,MAAMuB,WAAW,GAAGC,oBAAoB,CAACL,gBAAD,CAAxC;MACAlB,KAAK,CAAE,gBAAesB,WAAY,eAAc3B,QAAS,GAApD,CAAL;MACA,OAAO6B,YAAY,CAAC;QAACC,KAAK,EAAEH,WAAW,IAAI3B,QAAvB;QAAiC2B;MAAjC,CAAD,CAAnB;IACD;;IAEDpB,SAAS,CAAE,4DAA2DH,wBAAyB,GAAtF,CAAT;IACA,OAAOyB,YAAY,CAAC;MAACC,KAAK,EAAE,KAAR;MAAeH,WAAW,EAAE;IAA5B,CAAD,CAAnB;EACD;;EAED,SAASf,eAAT,CAAyBM,MAAzB,EAAiC;IAC/B,OAAOnB,QAAQ,CAACgC,MAAT,CAAgB,CAACC,GAAD,EAAM;MAACC,IAAD;MAAOC;IAAP,CAAN,KAA0BF,GAAG,CAACG,MAAJ,CAAW;MAACF,IAAD;MAAOG,KAAK,EAAEF,OAAO,CAAChB,MAAD;IAArB,CAAX,CAA1C,EAAsF,EAAtF,CAAP;EACD;;EAED,SAASW,YAAT,CAAsBQ,MAAtB,EAA8B;IAC5B,IAAIpC,cAAJ,EAAoB;MAClBI,KAAK,CAAE,8CAAF,CAAL;MACA,MAAMiC,kBAAkB,GAAG;QAACR,KAAK,EAAEO,MAAM,CAACP,KAAf;QAAsBH,WAAW,EAAEU,MAAM,CAACV,WAA1C;QAAuD5B,QAAQ,EAAEwC,cAAc,CAACxC,QAAD,CAA/E;QAA2FC;MAA3F,CAA3B;MACAO,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAe4B,kBAAf,CAAmC,EAAvC,CAAT;MACA,OAAOA,kBAAP;IACD;;IACD,OAAOD,MAAP;EACD;;EAED,SAASE,cAAT,CAAwBxC,QAAxB,EAAkC;IAChC,MAAMyC,aAAa,GAAGzC,QAAQ,CAACkB,GAAT,CAAawB,OAAO,IAAIA,OAAO,CAACR,IAAhC,CAAtB;IACA,OAAOO,aAAa,IAAI,EAAxB;EACD;;EAED,SAASZ,oBAAT,CAA8BL,gBAA9B,EAAgD;IAC9C,MAAMI,WAAW,GAAGJ,gBAAgB,CAACQ,MAAjB,CAAwB,CAACC,GAAD,EAAMN,CAAN,KAAYM,GAAG,GAAGN,CAA1C,EAA6C,GAA7C,CAApB;IACA,OAAOC,WAAW,GAAG,GAAd,GAAoB,GAApB,GAA0BA,WAAjC;EACD;;EAED,SAASH,wBAAT,CAAkCH,YAAlC,EAAgD;IAC9C,MAAMqB,QAAQ,GAAGrB,YAAY,CAACJ,GAAb,CAAiB,CAAC;MAACgB,IAAD;MAAOU,CAAP;MAAUC;IAAV,CAAD,KAAkB;MAClD,MAAM;QAACC;MAAD,IAAY9C,QAAQ,CAAC+C,IAAT,CAAc,CAAC;QAACb,IAAI,EAAEc;MAAP,CAAD,KAAyBd,IAAI,KAAKc,WAAhD,CAAlB;MACA,MAAMC,MAAM,GAAGH,OAAO,CAACF,CAAD,EAAIC,CAAJ,CAAtB;MACA,OAAO;QAACX,IAAD;QAAOe;MAAP,CAAP;IACD,CAJgB,CAAjB;IAMAzC,SAAS,CAAE,WAAUE,IAAI,CAACC,SAAL,CAAegC,QAAf,CAAyB,EAArC,CAAT;IACA,OAAOA,QAAQ,CAACzB,GAAT,CAAa,CAAC;MAAC+B;IAAD,CAAD,KAAcA,MAA3B,CAAP;EACD;;EAED,SAAS1B,oBAAT,CAA8BX,SAA9B,EAAyCS,SAAzC,EAAoD;IAClD,MAAM6B,KAAK,GAAGC,aAAa,EAA3B;IACA,MAAMC,eAAe,GAAGC,WAAW,EAAnC;IAEA/C,KAAK,CAAE,2FAA0FI,IAAI,CAACC,SAAL,CAAeyC,eAAf,CAAgC,EAA5H,CAAL;IACA,OAAOF,KAAP;;IAEA,SAASC,aAAT,GAAyB;MACvB,OAAOvC,SAAS,CACboB,MADI,CACG,CAACC,GAAD,EAAM;QAACC,IAAD;QAAOG;MAAP,CAAN,EAAqBiB,KAArB,KAA+BrB,GAAG,CAACG,MAAJ,CAAW;QAChDF,IADgD;QAEhDU,CAAC,EAAEP,KAF6C;QAGhDQ,CAAC,EAAExB,SAAS,CAACiC,KAAD,CAAT,CAAiBjB;MAH4B,CAAX,CADlC,EAKD,EALC,EAMJkB,MANI,CAMG,CAAC;QAACX,CAAD;QAAIC;MAAJ,CAAD,KAAY;QAClB,IAAID,CAAC,CAACY,MAAF,KAAa,CAAb,IAAkBX,CAAC,CAACW,MAAF,KAAa,CAAnC,EAAsC;UACpC,OAAO,KAAP;QACD;;QAED,OAAO,IAAP;MACD,CAZI,CAAP;IAaD;;IAED,SAASH,WAAT,GAAuB;MACrB,OAAOzC,SAAS,CACbM,GADI,CACA,CAAC;QAACgB;MAAD,CAAD,KAAYA,IADZ,EAEJqB,MAFI,CAEG5B,CAAC,IAAIuB,KAAK,CAACxB,IAAN,CAAW,CAAC;QAACQ;MAAD,CAAD,KAAYA,IAAI,KAAKP,CAAhC,MAAuC,KAF/C,CAAP;IAGD;EACF;AAEF,C"}