在firestore中对两个物品进行颤动搜索

function levenshteinDistance(a, b) {
  const matrix = [];

  for (let i = 0; i <= b.length; i++) {
    matrix[i] = [i];
  }

  for (let j = 0; j <= a.length; j++) {
    matrix[0][j] = j;
  }

  for (let i = 1; i <= b.length; i++) {
    for (let j = 1; j <= a.length; j++) {
      let deletionCost = matrix[i - 1][j] + 1;
      let insertionCost = matrix[i][j - 1] + 1;
      let substitutionCost =
        matrix[i - 1][j - 1] + (a.charAt(j - 1) !== b.charAt(i - 1) ? 1 : 0);

      matrix[i][j] = Math.min(deletionCost, insertionCost, substitutionCost);
    }
  }

  return matrix[b.length][a.length];
}

async function fuzzySearch(query, collection) {
  const results = [];
  const threshold = 2; // 允许的最大编辑距离

  const snapshot = await collection.get();
  snapshot.forEach((doc) => {
    const data = doc.data();
    const distance = levenshteinDistance(query, data.name);
    if (distance <= threshold) {
      results.push({ id: doc.id, ...data });
    }
  });

  return results;
}

const db = firebase.firestore();
const collection = db.collection('items');

function fuzzyMatch(query) {
  const regex = new RegExp(query.split('').join('.*'), 'i');
  return collection.where('name', 'regex', regex).get();
}