为mysql /模糊搜索实现Levenshtein距离？

ALTER TABLE table_name ADD FULLTEXT(column_name);

SELECT * FROM table_name WHERE MATCH(column_name) AGAINST('text_to_search');

#include<stdio.h>
#include <stdlib.h>
#include<string.h>

int levenshtein(char *s, char *t) {
    int len_s = strlen(s);
    int len_t = strlen(t);
    int matrix[len_s+1][len_t+1];
    int i, j;

    for (i = 0; i <= len_s; i++) {
        matrix[i][0] = i;
    }
    for (j = 0; j <= len_t; j++) {
        matrix[0][j] = j;
    }

    for (i = 1; i <= len_s; i++) {
        for (j = 1; j <= len_t; j++) {
            if (s[i-1] == t[j-1]) {
                matrix[i][j] = matrix[i-1][j-1];
            } else {
                matrix[i][j] = 1 + min(matrix[i-1][j], matrix[i][j-1], matrix[i-1][j-1]);
            }
        }
    }

    return matrix[len_s][len_t];
}

SELECT * FROM table_name WHERE levenshtein(column_name, 'text_to_compare')< threshold_value;