echogarden 0.0.1 → 0.1.0

package/dist/alignment/DTWMfccSequenceAlignment.d.ts

@@ -0,0 +1,2 @@
+export declare function alignMFCC_DTW(mfccFrames1: number[][], mfccFrames2: number[][], windowLength: number, distanceFunction?: "eucledian" | "cosine"): Promise<import("./SpeechAlignment.js").AlignmentPath>;
+export declare function getCostMatrixMemorySizeMiB(sequence1Length: number, sequence2Length: number, windowLength: number): number;

package/dist/alignment/DTWMfccSequenceAlignment.js

@@ -0,0 +1,26 @@
+import { cosineDistancePrecomputedMagnitudes, createVectorForIntegerRange, eucledianDistance, magnitude } from "../math/VectorMath.js";
+import { logToStderr } from "../utilities/Utilities.js";
+import { alignDTWWindowed } from "./DTWSequenceAlignmentWindowed.js";
+const log = logToStderr;
+export async function alignMFCC_DTW(mfccFrames1, mfccFrames2, windowLength, distanceFunction = "eucledian") {
+    if (distanceFunction == "eucledian") {
+        const { path } = await alignDTWWindowed(mfccFrames1, mfccFrames2, eucledianDistance, windowLength);
+        return path;
+    }
+    else if (distanceFunction == "cosine") {
+        const indexes1 = createVectorForIntegerRange(0, mfccFrames1.length);
+        const indexes2 = createVectorForIntegerRange(0, mfccFrames2.length);
+        const magnitudes1 = mfccFrames1.map(magnitude);
+        const magnitudes2 = mfccFrames2.map(magnitude);
+        const { path } = await alignDTWWindowed(indexes1, indexes2, (i, j) => cosineDistancePrecomputedMagnitudes(mfccFrames1[i], mfccFrames2[j], magnitudes1[i], magnitudes2[j]), windowLength);
+        return path;
+    }
+    else {
+        throw new Error("Invalid distance function");
+    }
+}
+export function getCostMatrixMemorySizeMiB(sequence1Length, sequence2Length, windowLength) {
+    const costMatrixMemorySizeMiB = sequence1Length * Math.min(sequence2Length, windowLength) * 4 / 1000000;
+    return costMatrixMemorySizeMiB;
+}
+//# sourceMappingURL=DTWMfccSequenceAlignment.js.map

package/dist/alignment/DTWMfccSequenceAlignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DTWMfccSequenceAlignment.js","sourceRoot":"","sources":["../../src/alignment/DTWMfccSequenceAlignment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mCAAmC,EAAE,2BAA2B,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAA;AACtI,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAA;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAA;AAEpE,MAAM,GAAG,GAAG,WAAW,CAAA;AAEvB,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,WAAuB,EAAE,WAAuB,EAAE,YAAoB,EAAE,mBAA2C,WAAW;IACjK,IAAI,gBAAgB,IAAI,WAAW,EAAE;QACpC,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,gBAAgB,CACtC,WAAW,EACX,WAAW,EACX,iBAAiB,EACjB,YAAY,CACZ,CAAA;QAED,OAAO,IAAI,CAAA;KACX;SAAM,IAAI,gBAAgB,IAAI,QAAQ,EAAE;QACxC,MAAM,QAAQ,GAAG,2BAA2B,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;QACnE,MAAM,QAAQ,GAAG,2BAA2B,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;QAEnE,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;QAC9C,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;QAE9C,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,gBAAgB,CACtC,QAAQ,EACR,QAAQ,EACR,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mCAAmC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,EAC7G,YAAY,CACZ,CAAA;QAED,OAAO,IAAI,CAAA;KACX;SAAM;QACN,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;KAC5C;AACF,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,eAAuB,EAAE,eAAuB,EAAE,YAAoB;IAChH,MAAM,uBAAuB,GAAG,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,YAAY,CAAC,GAAG,CAAC,GAAG,OAAO,CAAA;IACvG,OAAO,uBAAuB,CAAA;AAC/B,CAAC"}

package/dist/alignment/DTWSequenceAlignment.d.ts

@@ -0,0 +1,5 @@
+import { AlignmentPath } from "./SpeechAlignment.js";
+export declare function alignDTW<T, U>(sequence1: T[], sequence2: U[], costFunction: (a: T, b: U) => number, deletionEnabled?: boolean): {
+    path: AlignmentPath;
+    pathCost: number;
+};

package/dist/alignment/DTWSequenceAlignment.js

@@ -0,0 +1,99 @@
+import { logToStderr } from "../utilities/Utilities.js";
+const log = logToStderr;
+export function alignDTW(sequence1, sequence2, costFunction, deletionEnabled = true) {
+    if (sequence1.length == 0 || sequence2.length == 0) {
+        return { path: [], pathCost: 0 };
+    }
+    const rowCount = sequence2.length;
+    const columnCount = sequence1.length;
+    // Compute accumulated cost matrix
+    const accumulatedCostMatrix = computeAccumulatedCostMatrix(sequence1, sequence2, costFunction, deletionEnabled);
+    // Find best path for the computed matrix
+    const path = computeBestPath(accumulatedCostMatrix, deletionEnabled);
+    // Best path cost is the bottom right element of the matrix
+    const pathCost = accumulatedCostMatrix[rowCount - 1][columnCount - 1];
+    return { path, pathCost };
+}
+function computeAccumulatedCostMatrix(sequence1, sequence2, costFunction, deletionEnabled = true) {
+    const rowCount = sequence2.length;
+    const columnCount = sequence1.length;
+    const accumulatedCostMatrix = new Array(rowCount);
+    // Initialize matrix
+    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {
+        accumulatedCostMatrix[rowIndex] = new Float32Array(columnCount);
+    }
+    for (let i = 1; i < columnCount; i++) {
+        accumulatedCostMatrix[0][i] = Infinity;
+    }
+    for (let i = 1; i < rowCount; i++) {
+        accumulatedCostMatrix[i][0] = Infinity;
+    }
+    // Fill out the matrix, go row by row
+    for (let rowIndex = 1; rowIndex < rowCount; rowIndex++) {
+        const previousRow = accumulatedCostMatrix[rowIndex - 1];
+        const currentRow = accumulatedCostMatrix[rowIndex];
+        for (let columnIndex = 1; columnIndex < columnCount; columnIndex++) {
+            const cost = costFunction(sequence1[columnIndex], sequence2[rowIndex]);
+            const up = previousRow[columnIndex]; // insertion
+            const left = currentRow[columnIndex - 1]; // deletion
+            const upAndLeft = previousRow[columnIndex - 1]; // match
+            currentRow[columnIndex] = cost + minimumOf3(up, deletionEnabled ? left : Infinity, upAndLeft);
+        }
+    }
+    return accumulatedCostMatrix;
+}
+function computeBestPath(costMatrix, deletionEnabled = true) {
+    const rowCount = costMatrix.length;
+    const columnCount = costMatrix[0].length;
+    const bestPath = [];
+    let rowIndex = rowCount - 1;
+    let columnIndex = columnCount - 1;
+    bestPath.push({
+        source: columnIndex,
+        dest: rowIndex
+    });
+    while (rowIndex > 0 || columnIndex > 0) {
+        const up = costMatrix[rowIndex - 1][columnIndex];
+        const left = costMatrix[rowIndex][columnIndex - 1];
+        const upAndLeft = costMatrix[rowIndex - 1][columnIndex - 1];
+        const smallestCostDirection = argIndexOfMinimumOf3(up, deletionEnabled ? left : Infinity, upAndLeft);
+        if (smallestCostDirection == 1) {
+            rowIndex -= 1;
+        }
+        else if (smallestCostDirection == 2) {
+            columnIndex -= 1;
+        }
+        else {
+            rowIndex -= 1;
+            columnIndex -= 1;
+        }
+        bestPath.push({
+            source: columnIndex,
+            dest: rowIndex
+        });
+    }
+    return bestPath.reverse();
+}
+function minimumOf3(x1, x2, x3) {
+    if (x1 <= x2 && x1 <= x3) {
+        return x1;
+    }
+    else if (x2 <= x3) {
+        return x2;
+    }
+    else {
+        return x3;
+    }
+}
+function argIndexOfMinimumOf3(x1, x2, x3) {
+    if (x1 <= x2 && x1 <= x3) {
+        return 1;
+    }
+    else if (x2 <= x3) {
+        return 2;
+    }
+    else {
+        return 3;
+    }
+}
+//# sourceMappingURL=DTWSequenceAlignment.js.map

package/dist/alignment/DTWSequenceAlignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DTWSequenceAlignment.js","sourceRoot":"","sources":["../../src/alignment/DTWSequenceAlignment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAA;AAGvD,MAAM,GAAG,GAAG,WAAW,CAAA;AAEvB,MAAM,UAAU,QAAQ,CAAO,SAAc,EAAE,SAAc,EAAE,YAAoC,EAAE,eAAe,GAAG,IAAI;IAC1H,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;QACnD,OAAO,EAAE,IAAI,EAAE,EAAmB,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;KACjD;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAA;IACjC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAA;IAEpC,kCAAkC;IAClC,MAAM,qBAAqB,GAAG,4BAA4B,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,eAAe,CAAC,CAAA;IAE/G,yCAAyC;IACzC,MAAM,IAAI,GAAG,eAAe,CAAC,qBAAqB,EAAE,eAAe,CAAC,CAAA;IAEpE,2DAA2D;IAC3D,MAAM,QAAQ,GAAG,qBAAqB,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;IAErE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;AAC1B,CAAC;AAED,SAAS,4BAA4B,CAAO,SAAc,EAAE,SAAc,EAAE,YAAoC,EAAE,eAAe,GAAG,IAAI;IACvI,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAA;IACjC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAA;IAEpC,MAAM,qBAAqB,GAAmB,IAAI,KAAK,CAAe,QAAQ,CAAC,CAAA;IAE/E,oBAAoB;IACpB,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,QAAQ,EAAE,EAAE;QACvD,qBAAqB,CAAC,QAAQ,CAAC,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAA;KAC/D;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;QACrC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAA;KACtC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QAClC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAA;KACtC;IAED,qCAAqC;IACrC,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,QAAQ,EAAE,EAAE;QACvD,MAAM,WAAW,GAAG,qBAAqB,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;QACvD,MAAM,UAAU,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAA;QAElD,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,WAAW,EAAE,WAAW,EAAE,EAAE;YACnE,MAAM,IAAI,GAAG,YAAY,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAA;YAEtE,MAAM,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,CAAA,CAAC,YAAY;YAChD,MAAM,IAAI,GAAG,UAAU,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA,CAAC,WAAW;YACpD,MAAM,SAAS,GAAG,WAAW,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA,CAAC,QAAQ;YAEvD,UAAU,CAAC,WAAW,CAAC,GAAG,IAAI,GAAG,UAAU,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;SAC7F;KACD;IAED,OAAO,qBAAqB,CAAA;AAC7B,CAAC;AAED,SAAS,eAAe,CAAC,UAA0B,EAAE,eAAe,GAAG,IAAI;IAC1E,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAA;IAClC,MAAM,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAExC,MAAM,QAAQ,GAAkB,EAAE,CAAA;IAElC,IAAI,QAAQ,GAAG,QAAQ,GAAG,CAAC,CAAA;IAC3B,IAAI,WAAW,GAAG,WAAW,GAAG,CAAC,CAAA;IAEjC,QAAQ,CAAC,IAAI,CAAC;QACb,MAAM,EAAE,WAAW;QACnB,IAAI,EAAE,QAAQ;KACd,CAAC,CAAA;IAEF,OAAO,QAAQ,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;QAChD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;QAClD,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;QAE3D,MAAM,qBAAqB,GAAG,oBAAoB,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;QAEpG,IAAI,qBAAqB,IAAI,CAAC,EAAE;YAC/B,QAAQ,IAAI,CAAC,CAAA;SACb;aAAM,IAAI,qBAAqB,IAAI,CAAC,EAAE;YACtC,WAAW,IAAI,CAAC,CAAA;SAChB;aAAM;YACN,QAAQ,IAAI,CAAC,CAAA;YACb,WAAW,IAAI,CAAC,CAAA;SAChB;QAED,QAAQ,CAAC,IAAI,CAAC;YACb,MAAM,EAAE,WAAW;YACnB,IAAI,EAAE,QAAQ;SACd,CAAC,CAAA;KACF;IAED,OAAO,QAAQ,CAAC,OAAO,EAAmB,CAAA;AAC3C,CAAC;AAED,SAAS,UAAU,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;IACrD,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;QACzB,OAAO,EAAE,CAAA;KACT;SAAM,IAAI,EAAE,IAAI,EAAE,EAAE;QACpB,OAAO,EAAE,CAAA;KACT;SAAM;QACN,OAAO,EAAE,CAAA;KACT;AACF,CAAC;AAED,SAAS,oBAAoB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;IAC/D,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;QACzB,OAAO,CAAC,CAAA;KACR;SAAM,IAAI,EAAE,IAAI,EAAE,EAAE;QACpB,OAAO,CAAC,CAAA;KACR;SAAM;QACN,OAAO,CAAC,CAAA;KACR;AACF,CAAC"}

package/dist/alignment/DTWSequenceAlignmentWindowed.d.ts

@@ -0,0 +1,5 @@
+import { AlignmentPath } from "./SpeechAlignment.js";
+export declare function alignDTWWindowed<T, U>(sequence1: T[], sequence2: U[], costFunction: (a: T, b: U) => number, windowMaxLength: number): {
+    path: AlignmentPath;
+    pathCost: number;
+};

package/dist/alignment/DTWSequenceAlignmentWindowed.js

@@ -0,0 +1,161 @@
+import { logToStderr } from "../utilities/Utilities.js";
+const log = logToStderr;
+export function alignDTWWindowed(sequence1, sequence2, costFunction, windowMaxLength) {
+    if (windowMaxLength < 2) {
+        throw new Error("Window length must be greater or equal to 2");
+    }
+    if (sequence1.length == 0 || sequence2.length == 0) {
+        return { path: [], pathCost: 0 };
+    }
+    // Compute accumulated cost matrix (transposed)
+    const { accumulatedCostMatrixTransposed, windowStartOffsets } = computeAccumulatedCostMatrixTransposed(sequence1, sequence2, costFunction, windowMaxLength);
+    // Find best path for the computed matrix
+    const path = computeBestPathTransposed(accumulatedCostMatrixTransposed, windowStartOffsets);
+    // Best path cost is the bottom right element of the matrix
+    const columnCount = accumulatedCostMatrixTransposed.length;
+    const rowCount = accumulatedCostMatrixTransposed[0].length;
+    const pathCost = accumulatedCostMatrixTransposed[columnCount - 1][rowCount - 1];
+    // Return
+    return { path, pathCost };
+}
+function computeAccumulatedCostMatrixTransposed(sequence1, sequence2, costFunction, windowMaxLength) {
+    const halfWindowMaxLength = Math.floor(windowMaxLength / 2);
+    const columnCount = sequence1.length;
+    const rowCount = Math.min(windowMaxLength, sequence2.length);
+    const accumulatedCostMatrixTransposed = new Array(columnCount);
+    // Initialize window start offsets array
+    const windowStartOffsets = new Int32Array(columnCount);
+    // Compute matrix column by column
+    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {
+        // Create new column and add it to the matrix
+        const currentColumn = new Float32Array(rowCount);
+        accumulatedCostMatrixTransposed[columnIndex] = currentColumn;
+        // Compute window center
+        const windowCenter = Math.floor((columnIndex / columnCount) * sequence2.length);
+        // Compute window start and end offsets
+        let windowStartOffset = Math.max(windowCenter - halfWindowMaxLength, 0);
+        let windowEndOffset = windowStartOffset + rowCount;
+        if (windowEndOffset > sequence2.length) {
+            windowEndOffset = sequence2.length;
+            windowStartOffset = windowEndOffset - rowCount;
+        }
+        // Store the start offset in the array
+        windowStartOffsets[columnIndex] = windowStartOffset;
+        // Get target sequence1 value
+        const targetSequence1Value = sequence1[columnIndex];
+        // If first column, fill it only using the 'up' neighbor
+        if (columnIndex == 0) {
+            for (let rowIndex = 1; rowIndex < rowCount; rowIndex++) {
+                const cost = costFunction(targetSequence1Value, sequence2[windowStartOffset + rowIndex]);
+                const upCost = currentColumn[rowIndex - 1];
+                currentColumn[rowIndex] = cost + upCost;
+            }
+            continue;
+        }
+        // If not first column
+        const leftColumn = accumulatedCostMatrixTransposed[columnIndex - 1];
+        // Compute the delta between the current window offset and previous column's window offset
+        const windowOffsetDelta = windowStartOffset - windowStartOffsets[columnIndex - 1];
+        for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {
+            // Compute the cost for current cell
+            const cost = costFunction(targetSequence1Value, sequence2[windowStartOffset + rowIndex]);
+            // Retrieve the cost for the 'up' (insertion) neighbor
+            let upCost = Infinity;
+            if (rowIndex > 0) {
+                upCost = currentColumn[rowIndex - 1];
+            }
+            // Retrieve the cost for the 'left' (deletion) neighbor
+            let leftCost = Infinity;
+            const leftRowIndex = rowIndex + windowOffsetDelta;
+            if (leftRowIndex < rowCount) {
+                leftCost = leftColumn[leftRowIndex];
+            }
+            // Retrieve the cost for the 'up and left' (match) neighbor
+            let upAndLeftCost = Infinity;
+            const upAndLeftRowIndex = leftRowIndex - 1;
+            if (upAndLeftRowIndex >= 0 && upAndLeftRowIndex < rowCount) {
+                upAndLeftCost = leftColumn[upAndLeftRowIndex];
+            }
+            // Write cost + minimum neighbor cost to the current column
+            currentColumn[rowIndex] = cost + minimumOf3(upCost, leftCost, upAndLeftCost);
+        }
+    }
+    return { accumulatedCostMatrixTransposed, windowStartOffsets };
+}
+function computeBestPathTransposed(accumulatedCostMatrixTransposed, windowStartOffsets) {
+    const columnCount = accumulatedCostMatrixTransposed.length;
+    const rowCount = accumulatedCostMatrixTransposed[0].length;
+    const bestPath = [];
+    let columnIndex = columnCount - 1;
+    let rowIndex = rowCount - 1;
+    while (columnIndex > 0 || rowIndex > 0) {
+        const windowStartIndex = windowStartOffsets[columnIndex];
+        const windowStartDelta = columnIndex > 0 ? windowStartIndex - windowStartOffsets[columnIndex - 1] : 0;
+        bestPath.push({
+            source: columnIndex,
+            dest: windowStartIndex + rowIndex
+        });
+        const upRowIndex = rowIndex - 1;
+        const upColumnIndex = columnIndex;
+        let upCost = Infinity;
+        if (upRowIndex >= 0) {
+            upCost = accumulatedCostMatrixTransposed[upColumnIndex][upRowIndex]; // insertion
+        }
+        const leftRowIndex = rowIndex + windowStartDelta;
+        const leftColumnIndex = columnIndex - 1;
+        let leftCost = Infinity;
+        if (leftColumnIndex >= 0 && leftRowIndex < rowCount) {
+            leftCost = accumulatedCostMatrixTransposed[leftColumnIndex][leftRowIndex]; // deletion
+        }
+        const upAndLeftRowIndex = rowIndex - 1 + windowStartDelta;
+        const upAndLeftColumnIndex = columnIndex - 1;
+        let upAndLeftCost = Infinity;
+        if (upAndLeftColumnIndex >= 0 && upAndLeftRowIndex >= 0 && upAndLeftRowIndex < rowCount) {
+            upAndLeftCost = accumulatedCostMatrixTransposed[upAndLeftColumnIndex][upAndLeftRowIndex]; // match
+        }
+        if (upCost == Infinity && leftCost == Infinity && upAndLeftCost == Infinity) {
+            log(`computeBestPath: Unexpected - all cost directions are equal to infinity (${columnIndex}, ${rowIndex}).`);
+        }
+        const smallestCostDirection = argIndexOfMinimumOf3(upCost, leftCost, upAndLeftCost);
+        if (smallestCostDirection == 1) {
+            rowIndex = upRowIndex;
+            columnIndex = upColumnIndex;
+        }
+        else if (smallestCostDirection == 2) {
+            rowIndex = leftRowIndex;
+            columnIndex = leftColumnIndex;
+        }
+        else {
+            rowIndex = upAndLeftRowIndex;
+            columnIndex = upAndLeftColumnIndex;
+        }
+    }
+    bestPath.push({
+        source: 0,
+        dest: 0
+    });
+    return bestPath.reverse();
+}
+function minimumOf3(x1, x2, x3) {
+    if (x1 <= x2 && x1 <= x3) {
+        return x1;
+    }
+    else if (x2 <= x3) {
+        return x2;
+    }
+    else {
+        return x3;
+    }
+}
+function argIndexOfMinimumOf3(x1, x2, x3) {
+    if (x1 <= x2 && x1 <= x3) {
+        return 1;
+    }
+    else if (x2 <= x3) {
+        return 2;
+    }
+    else {
+        return 3;
+    }
+}
+//# sourceMappingURL=DTWSequenceAlignmentWindowed.js.map

package/dist/alignment/DTWSequenceAlignmentWindowed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DTWSequenceAlignmentWindowed.js","sourceRoot":"","sources":["../../src/alignment/DTWSequenceAlignmentWindowed.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAA;AAGvD,MAAM,GAAG,GAAG,WAAW,CAAA;AAEvB,MAAM,UAAU,gBAAgB,CAAO,SAAc,EAAE,SAAc,EAAE,YAAoC,EAAE,eAAuB;IACnI,IAAI,eAAe,GAAG,CAAC,EAAE;QACxB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAA;KAC9D;IAED,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;QACnD,OAAO,EAAE,IAAI,EAAE,EAAmB,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;KACjD;IAED,+CAA+C;IAC/C,MAAM,EAAE,+BAA+B,EAAE,kBAAkB,EAAE,GAAG,sCAAsC,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,eAAe,CAAC,CAAA;IAE3J,yCAAyC;IACzC,MAAM,IAAI,GAAG,yBAAyB,CAAC,+BAA+B,EAAE,kBAAkB,CAAC,CAAA;IAE3F,2DAA2D;IAC3D,MAAM,WAAW,GAAG,+BAA+B,CAAC,MAAM,CAAA;IAC1D,MAAM,QAAQ,GAAG,+BAA+B,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAE1D,MAAM,QAAQ,GAAG,+BAA+B,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;IAE/E,SAAS;IACT,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;AAC1B,CAAC;AAED,SAAS,sCAAsC,CAAO,SAAc,EAAE,SAAc,EAAE,YAAoC,EAAE,eAAuB;IAClJ,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAA;IAE3D,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAA;IACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,SAAS,CAAC,MAAM,CAAC,CAAA;IAE5D,MAAM,+BAA+B,GAAmB,IAAI,KAAK,CAAe,WAAW,CAAC,CAAA;IAE5F,wCAAwC;IACxC,MAAM,kBAAkB,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAA;IAEtD,kCAAkC;IAClC,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,WAAW,EAAE,WAAW,EAAE,EAAE;QACnE,6CAA6C;QAC7C,MAAM,aAAa,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAA;QAChD,+BAA+B,CAAC,WAAW,CAAC,GAAG,aAAa,CAAA;QAE5D,wBAAwB;QACxB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;QAE/E,uCAAuC;QACvC,IAAI,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,mBAAmB,EAAE,CAAC,CAAC,CAAA;QACvE,IAAI,eAAe,GAAG,iBAAiB,GAAG,QAAQ,CAAA;QAElD,IAAI,eAAe,GAAG,SAAS,CAAC,MAAM,EAAE;YACvC,eAAe,GAAG,SAAS,CAAC,MAAM,CAAA;YAClC,iBAAiB,GAAG,eAAe,GAAG,QAAQ,CAAA;SAC9C;QAED,sCAAsC;QACtC,kBAAkB,CAAC,WAAW,CAAC,GAAG,iBAAiB,CAAA;QAEnD,6BAA6B;QAC7B,MAAM,oBAAoB,GAAG,SAAS,CAAC,WAAW,CAAC,CAAA;QAEnD,wDAAwD;QACxD,IAAI,WAAW,IAAI,CAAC,EAAE;YACrB,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,QAAQ,EAAE,EAAE;gBACvD,MAAM,IAAI,GAAG,YAAY,CAAC,oBAAoB,EAAE,SAAS,CAAC,iBAAiB,GAAG,QAAQ,CAAC,CAAC,CAAA;gBACxF,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;gBAE1C,aAAa,CAAC,QAAQ,CAAC,GAAG,IAAI,GAAG,MAAM,CAAA;aACvC;YAED,SAAQ;SACR;QAED,sBAAsB;QACtB,MAAM,UAAU,GAAG,+BAA+B,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;QAEnE,0FAA0F;QAC1F,MAAM,iBAAiB,GAAG,iBAAiB,GAAG,kBAAkB,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;QAEjF,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACvD,oCAAoC;YACpC,MAAM,IAAI,GAAG,YAAY,CAAC,oBAAoB,EAAE,SAAS,CAAC,iBAAiB,GAAG,QAAQ,CAAC,CAAC,CAAA;YAExF,sDAAsD;YACtD,IAAI,MAAM,GAAG,QAAQ,CAAA;YACrB,IAAI,QAAQ,GAAG,CAAC,EAAE;gBACjB,MAAM,GAAG,aAAa,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;aACpC;YAED,uDAAuD;YACvD,IAAI,QAAQ,GAAG,QAAQ,CAAA;YACvB,MAAM,YAAY,GAAG,QAAQ,GAAG,iBAAiB,CAAA;YAEjD,IAAI,YAAY,GAAG,QAAQ,EAAE;gBAC5B,QAAQ,GAAG,UAAU,CAAC,YAAY,CAAC,CAAA;aACnC;YAED,2DAA2D;YAC3D,IAAI,aAAa,GAAG,QAAQ,CAAA;YAC5B,MAAM,iBAAiB,GAAG,YAAY,GAAG,CAAC,CAAA;YAE1C,IAAI,iBAAiB,IAAI,CAAC,IAAI,iBAAiB,GAAG,QAAQ,EAAE;gBAC3D,aAAa,GAAG,UAAU,CAAC,iBAAiB,CAAC,CAAA;aAC7C;YAED,2DAA2D;YAC3D,aAAa,CAAC,QAAQ,CAAC,GAAG,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAA;SAC5E;KACD;IAED,OAAO,EAAE,+BAA+B,EAAE,kBAAkB,EAAE,CAAA;AAC/D,CAAC;AAED,SAAS,yBAAyB,CAAC,+BAA+C,EAAE,kBAA8B;IACjH,MAAM,WAAW,GAAG,+BAA+B,CAAC,MAAM,CAAA;IAC1D,MAAM,QAAQ,GAAG,+BAA+B,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;IAE1D,MAAM,QAAQ,GAAkB,EAAE,CAAA;IAElC,IAAI,WAAW,GAAG,WAAW,GAAG,CAAC,CAAA;IACjC,IAAI,QAAQ,GAAG,QAAQ,GAAG,CAAC,CAAA;IAE3B,OAAO,WAAW,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE;QACvC,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAA;QACxD,MAAM,gBAAgB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,kBAAkB,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAErG,QAAQ,CAAC,IAAI,CAAC;YACb,MAAM,EAAE,WAAW;YACnB,IAAI,EAAE,gBAAgB,GAAG,QAAQ;SACjC,CAAC,CAAA;QAEF,MAAM,UAAU,GAAG,QAAQ,GAAG,CAAC,CAAA;QAC/B,MAAM,aAAa,GAAG,WAAW,CAAA;QACjC,IAAI,MAAM,GAAG,QAAQ,CAAA;QAErB,IAAI,UAAU,IAAI,CAAC,EAAE;YACpB,MAAM,GAAG,+BAA+B,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC,CAAA,CAAC,YAAY;SAChF;QAED,MAAM,YAAY,GAAG,QAAQ,GAAG,gBAAgB,CAAA;QAChD,MAAM,eAAe,GAAG,WAAW,GAAG,CAAC,CAAA;QACvC,IAAI,QAAQ,GAAG,QAAQ,CAAA;QAEvB,IAAI,eAAe,IAAI,CAAC,IAAI,YAAY,GAAG,QAAQ,EAAE;YACpD,QAAQ,GAAG,+BAA+B,CAAC,eAAe,CAAC,CAAC,YAAY,CAAC,CAAA,CAAC,WAAW;SACrF;QAED,MAAM,iBAAiB,GAAG,QAAQ,GAAG,CAAC,GAAG,gBAAgB,CAAA;QACzD,MAAM,oBAAoB,GAAG,WAAW,GAAG,CAAC,CAAA;QAC5C,IAAI,aAAa,GAAG,QAAQ,CAAA;QAE5B,IAAI,oBAAoB,IAAI,CAAC,IAAI,iBAAiB,IAAI,CAAC,IAAI,iBAAiB,GAAG,QAAQ,EAAE;YACxF,aAAa,GAAG,+BAA+B,CAAC,oBAAoB,CAAC,CAAC,iBAAiB,CAAC,CAAA,CAAC,QAAQ;SACjG;QAED,IAAI,MAAM,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,aAAa,IAAI,QAAQ,EAAE;YAC5E,GAAG,CAAC,4EAA4E,WAAW,KAAK,QAAQ,IAAI,CAAC,CAAA;SAC7G;QAED,MAAM,qBAAqB,GAAG,oBAAoB,CAAC,MAAM,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAA;QAEnF,IAAI,qBAAqB,IAAI,CAAC,EAAE;YAC/B,QAAQ,GAAG,UAAU,CAAA;YACrB,WAAW,GAAG,aAAa,CAAA;SAC3B;aAAM,IAAI,qBAAqB,IAAI,CAAC,EAAE;YACtC,QAAQ,GAAG,YAAY,CAAA;YACvB,WAAW,GAAG,eAAe,CAAA;SAC7B;aAAM;YACN,QAAQ,GAAG,iBAAiB,CAAA;YAC5B,WAAW,GAAG,oBAAoB,CAAA;SAClC;KACD;IAED,QAAQ,CAAC,IAAI,CAAC;QACb,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC;KACP,CAAC,CAAA;IAEF,OAAO,QAAQ,CAAC,OAAO,EAAmB,CAAA;AAC3C,CAAC;AAED,SAAS,UAAU,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;IACrD,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;QACzB,OAAO,EAAE,CAAA;KACT;SAAM,IAAI,EAAE,IAAI,EAAE,EAAE;QACpB,OAAO,EAAE,CAAA;KACT;SAAM;QACN,OAAO,EAAE,CAAA;KACT;AACF,CAAC;AAED,SAAS,oBAAoB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;IAC/D,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;QACzB,OAAO,CAAC,CAAA;KACR;SAAM,IAAI,EAAE,IAAI,EAAE,EAAE;QACpB,OAAO,CAAC,CAAA;KACR;SAAM;QACN,OAAO,CAAC,CAAA;KACR;AACF,CAAC"}

package/dist/alignment/LevenshteinSequenceAlignment.d.ts

@@ -0,0 +1,5 @@
+import { AlignmentPath } from "./SpeechAlignment.js";
+export declare function alignLevenshtein<T, U>(sequence1: T[], sequence2: U[], getSubstitutionCost: (a: T, b: U) => number): {
+    path: AlignmentPath;
+    pathCost: number;
+};

package/dist/alignment/LevenshteinSequenceAlignment.js

@@ -0,0 +1,102 @@
+import { logToStderr } from "../utilities/Utilities.js";
+const log = logToStderr;
+export function alignLevenshtein(sequence1, sequence2, getSubstitutionCost) {
+    const rowCount = sequence2.length + 1;
+    const columnCount = sequence1.length + 1;
+    // Compute accumulated cost matrix
+    const accumulatedCostMatrix = computeAccumulatedCostMatrix(sequence1, sequence2, getSubstitutionCost);
+    // Find best path for the computed matrix
+    const path = computeBestPath(accumulatedCostMatrix);
+    // Best path cost is the bottom right element of the matrix
+    const pathCost = accumulatedCostMatrix[rowCount - 1][columnCount - 1];
+    return { path, pathCost };
+}
+function computeAccumulatedCostMatrix(sequence1, sequence2, getSubstitutionCost) {
+    const rowCount = sequence2.length + 1;
+    const columnCount = sequence1.length + 1;
+    const accumulatedCostMatrix = new Array(rowCount);
+    // Allocate rows and initialize first column
+    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {
+        const newRow = new Float32Array(columnCount);
+        newRow[0] = rowIndex;
+        accumulatedCostMatrix[rowIndex] = newRow;
+    }
+    // Initialize first row
+    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {
+        accumulatedCostMatrix[0][columnIndex] = columnIndex;
+    }
+    // Fill out the rest of the matrix, go row by row
+    for (let rowIndex = 1; rowIndex < rowCount; rowIndex++) {
+        const previousRow = accumulatedCostMatrix[rowIndex - 1];
+        const currentRow = accumulatedCostMatrix[rowIndex];
+        for (let columnIndex = 1; columnIndex < columnCount; columnIndex++) {
+            const upAndLeft = previousRow[columnIndex - 1];
+            const up = previousRow[columnIndex];
+            const left = currentRow[columnIndex - 1];
+            const smallestCostDirection = argIndexOfSmallestOf3(upAndLeft, up, left);
+            let computedCostForCurrentElement;
+            if (smallestCostDirection == 1) {
+                const subtitutionCost = getSubstitutionCost(sequence1[columnIndex - 1], sequence2[rowIndex - 1]);
+                computedCostForCurrentElement = upAndLeft + subtitutionCost;
+            }
+            else if (smallestCostDirection == 2) {
+                computedCostForCurrentElement = up + 1;
+            }
+            else {
+                computedCostForCurrentElement = left + 1;
+            }
+            currentRow[columnIndex] = computedCostForCurrentElement;
+        }
+    }
+    return accumulatedCostMatrix;
+}
+function computeBestPath(costMatrix) {
+    const bestPath = [];
+    let rowIndex = costMatrix.length - 1;
+    let columnIndex = costMatrix[0].length - 1;
+    while (rowIndex > 1 || columnIndex > 1) {
+        bestPath.push({
+            source: columnIndex - 1,
+            dest: rowIndex - 1
+        });
+        if (rowIndex == 1) {
+            columnIndex -= 1;
+            continue;
+        }
+        if (columnIndex == 1) {
+            rowIndex -= 1;
+            continue;
+        }
+        const upAndLeft = costMatrix[rowIndex - 1][columnIndex - 1];
+        const up = costMatrix[rowIndex - 1][columnIndex];
+        const left = costMatrix[rowIndex][columnIndex - 1];
+        const smallestCostDirection = argIndexOfSmallestOf3(upAndLeft, up, left);
+        if (smallestCostDirection == 1) {
+            rowIndex -= 1;
+            columnIndex -= 1;
+        }
+        else if (smallestCostDirection == 2) {
+            rowIndex -= 1;
+        }
+        else {
+            columnIndex -= 1;
+        }
+    }
+    bestPath.push({
+        source: 0,
+        dest: 0
+    });
+    return bestPath.reverse();
+}
+function argIndexOfSmallestOf3(x1, x2, x3) {
+    if (x1 <= x2 && x1 <= x3) {
+        return 1;
+    }
+    else if (x2 <= x3) {
+        return 2;
+    }
+    else {
+        return 3;
+    }
+}
+//# sourceMappingURL=LevenshteinSequenceAlignment.js.map

package/dist/alignment/LevenshteinSequenceAlignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LevenshteinSequenceAlignment.js","sourceRoot":"","sources":["../../src/alignment/LevenshteinSequenceAlignment.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAA;AAGvD,MAAM,GAAG,GAAG,WAAW,CAAA;AAEvB,MAAM,UAAU,gBAAgB,CAAO,SAAc,EAAE,SAAc,EAAE,mBAA2C;IACjH,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IACrC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IAExC,kCAAkC;IAClC,MAAM,qBAAqB,GAAG,4BAA4B,CAAC,SAAS,EAAE,SAAS,EAAE,mBAAmB,CAAC,CAAA;IAErG,yCAAyC;IACzC,MAAM,IAAI,GAAG,eAAe,CAAC,qBAAqB,CAAC,CAAA;IAEnD,2DAA2D;IAC3D,MAAM,QAAQ,GAAG,qBAAqB,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;IAErE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;AAC1B,CAAC;AAED,SAAS,4BAA4B,CAAO,SAAc,EAAE,SAAc,EAAE,mBAA2C;IACtH,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IACrC,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;IAExC,MAAM,qBAAqB,GAAmB,IAAI,KAAK,CAAe,QAAQ,CAAC,CAAA;IAE/E,4CAA4C;IAC5C,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,QAAQ,EAAE,EAAE;QACvD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAA;QAE5C,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAA;QACpB,qBAAqB,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAA;KACxC;IAED,uBAAuB;IACvB,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,WAAW,EAAE,WAAW,EAAE,EAAE;QACnE,qBAAqB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,WAAW,CAAA;KACnD;IAED,iDAAiD;IACjD,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,QAAQ,EAAE,EAAE;QACvD,MAAM,WAAW,GAAG,qBAAqB,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAA;QACvD,MAAM,UAAU,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAA;QAElD,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,WAAW,EAAE,WAAW,EAAE,EAAE;YACnE,MAAM,SAAS,GAAG,WAAW,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;YAC9C,MAAM,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,CAAA;YACnC,MAAM,IAAI,GAAG,UAAU,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;YAExC,MAAM,qBAAqB,GAAG,qBAAqB,CAAC,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;YAExE,IAAI,6BAAqC,CAAA;YAEzC,IAAI,qBAAqB,IAAI,CAAC,EAAE;gBAC/B,MAAM,eAAe,GAAG,mBAAmB,CAAC,SAAS,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAA;gBAEhG,6BAA6B,GAAG,SAAS,GAAG,eAAe,CAAA;aAC3D;iBAAM,IAAI,qBAAqB,IAAI,CAAC,EAAE;gBACtC,6BAA6B,GAAG,EAAE,GAAG,CAAC,CAAA;aACtC;iBAAM;gBACN,6BAA6B,GAAG,IAAI,GAAG,CAAC,CAAA;aACxC;YAED,UAAU,CAAC,WAAW,CAAC,GAAG,6BAA6B,CAAA;SACvD;KACD;IAED,OAAO,qBAAqB,CAAA;AAC7B,CAAC;AAED,SAAS,eAAe,CAAC,UAA0B;IAClD,MAAM,QAAQ,GAAkB,EAAE,CAAA;IAElC,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAA;IACpC,IAAI,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAA;IAE1C,OAAO,QAAQ,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE;QACvC,QAAQ,CAAC,IAAI,CAAC;YACb,MAAM,EAAE,WAAW,GAAG,CAAC;YACvB,IAAI,EAAE,QAAQ,GAAG,CAAC;SAClB,CAAC,CAAA;QAEF,IAAI,QAAQ,IAAI,CAAC,EAAE;YAClB,WAAW,IAAI,CAAC,CAAA;YAChB,SAAQ;SACR;QAED,IAAI,WAAW,IAAI,CAAC,EAAE;YACrB,QAAQ,IAAI,CAAC,CAAA;YACb,SAAQ;SACR;QAED,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;QAC3D,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAA;QAChD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAA;QAElD,MAAM,qBAAqB,GAAG,qBAAqB,CAAC,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;QAExE,IAAI,qBAAqB,IAAI,CAAC,EAAE;YAC/B,QAAQ,IAAI,CAAC,CAAA;YACb,WAAW,IAAI,CAAC,CAAA;SAChB;aAAM,IAAI,qBAAqB,IAAI,CAAC,EAAE;YACtC,QAAQ,IAAI,CAAC,CAAA;SACb;aAAM;YACN,WAAW,IAAI,CAAC,CAAA;SAChB;KACD;IAED,QAAQ,CAAC,IAAI,CAAC;QACb,MAAM,EAAE,CAAC;QACT,IAAI,EAAE,CAAC;KACP,CAAC,CAAA;IAEF,OAAO,QAAQ,CAAC,OAAO,EAAmB,CAAA;AAC3C,CAAC;AAED,SAAS,qBAAqB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;IAChE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;QACzB,OAAO,CAAC,CAAA;KACR;SAAM,IAAI,EAAE,IAAI,EAAE,EAAE;QACpB,OAAO,CAAC,CAAA;KACR;SAAM;QACN,OAAO,CAAC,CAAA;KACR;AACF,CAAC"}

package/dist/alignment/SpeechAlignment.d.ts

@@ -0,0 +1,27 @@
+import * as API from "../api/API.js";
+import { Timeline, TimelineEntry } from "../utilities/Timeline.js";
+import { RawAudio } from "../audio/AudioUtilities.js";
+export declare function alignUsingDtw(sourceRawAudio: RawAudio, referenceRawAudio: RawAudio, referenceTimeline: Timeline, windowDuration?: number): Promise<TimelineEntry[]>;
+export declare function alignUsingDtwWithRecognition(sourceRawAudio: RawAudio, referenceRawAudio: RawAudio, referenceTimeline: Timeline, recognitionTimeline: Timeline, espeakVoice?: string, phoneAlignmentMethod?: API.PhoneAlignmentMethod, windowDuration?: number): Promise<Timeline>;
+export declare function interpolatePhoneTimelines(sourceTimeline: Timeline, referenceTimeline: Timeline): Promise<Timeline>;
+export declare function alignPhoneTimelines(sourceRawAudio: RawAudio, sourceWordTimeline: Timeline, referenceRawAudio: RawAudio, referenceTimeline: Timeline): Promise<Timeline>;
+export declare function createAlignmentReferenceUsingEspeak(text: string, language: string, voice: string, insertSeparators?: boolean, rate?: number, pitch?: number, pitchRange?: number): Promise<{
+    rawAudio: RawAudio;
+    timeline: Timeline;
+    events: import("../synthesis/EspeakTTS.js").EspeakEvent[];
+}>;
+export declare function createAlignmentReferenceUsingEspeakForFragments(fragments: string[], voice: string, insertSeparators?: boolean, rate?: number, pitch?: number, pitchRange?: number): Promise<{
+    rawAudio: RawAudio;
+    timeline: Timeline;
+    events: import("../synthesis/EspeakTTS.js").EspeakEvent[];
+}>;
+export type AlignmentPath = AlignmentPathEntry[];
+export type AlignmentPathEntry = {
+    source: number;
+    dest: number;
+};
+export type CompactedPath = CompactedPathEntry[];
+export type CompactedPathEntry = {
+    first: number;
+    last: number;
+};