Index: graphspell-js/char_player.js ================================================================== --- graphspell-js/char_player.js +++ graphspell-js/char_player.js @@ -322,12 +322,12 @@ // End of word dFinal1: new Map([ ["a", ["as", "at", "ant", "ah"]], ["A", ["AS", "AT", "ANT", "AH"]], - ["c", ["ch",]], - ["C", ["CH",]], + ["c", ["ch", "que"]], + ["C", ["CH", "QUE"]], ["e", ["et", "er", "ets", "ée", "ez", "ai", "ais", "ait", "ent", "eh"]], ["E", ["ET", "ER", "ETS", "ÉE", "EZ", "AI", "AIS", "AIT", "ENT", "EH"]], ["é", ["et", "er", "ets", "ée", "ez", "ai", "ais", "ait"]], ["É", ["ET", "ER", "ETS", "ÉE", "EZ", "AI", "AIS", "AIT"]], ["è", ["et", "er", "ets", "ée", "ez", "ai", "ais", "ait"]], @@ -338,10 +338,12 @@ ["Ë", ["ET", "ER", "ETS", "ÉE", "EZ", "AI", "AIS", "AIT"]], ["g", ["gh",]], ["G", ["GH",]], ["i", ["is", "it", "ie", "in"]], ["I", ["IS", "IT", "IE", "IN"]], + ["k", ["que"]], + ["K", ["QUE"]], ["n", ["nt", "nd", "ns", "nh"]], ["N", ["NT", "ND", "NS", "NH"]], ["o", ["aut", "ot", "os"]], ["O", ["AUT", "OT", "OS"]], ["ô", ["aut", "ot", "os"]], Index: graphspell-js/ibdawg.js ================================================================== --- graphspell-js/ibdawg.js +++ graphspell-js/ibdawg.js @@ -355,11 +355,11 @@ let nMaxSwitch = Math.max(Math.floor(sWord.length / 3), 1); let nMaxDel = Math.floor(sWord.length / 5); let nMaxHardRepl = Math.max(Math.floor((sWord.length - 5) / 4), 1); let nMaxJump = Math.max(Math.floor(sWord.length / 4), 1); let oSuggResult = new SuggResult(sWord, nSuggLimit); - let sWord = str_transform.cleanWord(sWord); + sWord = str_transform.cleanWord(sWord); if (bSplitTrailingNumbers) { this._splitTrailingNumbers(oSuggResult, sWord); } this._splitSuggest(oSuggResult, sWord); this._suggest(oSuggResult, sWord, nMaxSwitch, nMaxDel, nMaxHardRepl, nMaxJump); Index: graphspell-js/str_transform.js ================================================================== --- graphspell-js/str_transform.js +++ graphspell-js/str_transform.js @@ -71,14 +71,10 @@ // word clean for the user who make commun and preditive error help suggest // remove letters repeated more than 2 times if (sWord.match(/(.)(\1){2,}/igm)){ sWord = sWord.replace(/(.*)(.)(.\2)/igm,'$1$2').replace(/(.)(\1)+/igm,'$1$1'); } - // words ending with -ik -> replace with -ique - if (sWord.match(/ik$/ig)){ - sWord = sWord.replace(/(.*)ik$/ig,'$1ique'); - } return sWord; }, _xTransNumbersToExponent: new Map([ ["0", "⁰"], ["1", "¹"], ["2", "²"], ["3", "³"], ["4", "⁴"], ["5", "⁵"], ["6", "⁶"], ["7", "⁷"], ["8", "⁸"], ["9", "⁹"]