2017-03-08 142 views
1

如果一个字符串接近表中的字符串,它会用表中的字符串取代吗?如何在lua中创建一个字符串字典函数?

像一个拼写检查函数,它搜索一个表,如果输入接近于表中的一个,它将修复它,所以表中的一个和字符串是相同的?

+0

对不起,我是一个缓慢的学习者,关于处理字符串。 –

+0

您应该使用[Edit distance](https://en.wikipedia.org/wiki/Edit_distance) –

+0

将字符串与字典中的所有字符串进行比较在实践中,[Jaro-Winkler distance](https://en.wikipedia。 org/wiki/Jaro%E2%80%93Winkler_distance)通常会提供更逼真的结果。 –

回答

1

您可以使用此代码:)参考代码是从这里:https://github.com/badarsh2/Algorithm-Implementations/blob/master/Levenshtein_distance/Lua/Yonaba/levenshtein.lua

local function min(a, b, c) 
    return math.min(math.min(a, b), c) 
end 

local function matrix(row,col) 
    local m = {} 
    for i = 1,row do m[i] = {} 
    for j = 1,col do m[i][j] = 0 end 
    end 
    return m 
end 

local function lev(strA,strB) 
    local M = matrix(#strA+1,#strB+1) 
    local i, j, cost 
    local row, col = #M, #M[1] 
    for i = 1, row do M[i][1] = i - 1 end 
    for j = 1, col do M[1][j] = j - 1 end 
    for i = 2, row do 
    for j = 2, col do 
     if (strA:sub(i - 1, i - 1) == strB:sub(j - 1, j - 1)) then cost = 0 
     else cost = 1 
     end 
    M[i][j] = min(M[i-1][j] + 1,M[i][j - 1] + 1,M[i - 1][j - 1] + cost) 
    end 
    end 
    return M[row][col] 
end 

local refTable = {"hell", "screen"} 

local function getClosestWord(pInput, pTable, threesold) 
    cDist = -1 
    cWord = "" 
    for key, val in pairs(pTable) do 
    local levRes = lev(pInput, val) 
    if levRes < cDist or cDist == -1 then 
     cDist = levRes 
     cWord = val 
    end 
    end 
    print(cDist) 
    if cDist <= threesold then 
    return cWord 
    else 
    return pInput 
    end 
end 

a = getClosestWord("hello", refTable, 3) 
b = getClosestWord("screw", refTable, 3) 
print(a, b) 

第三个参数是threesold,如果最小距离大于threesold高,字不被替换。

+0

谢谢,这将有助于我的luabot发展很多! –

+0

祝你机器人好运:) – Sygmei