Overview
Comment: | [graphspell][bug] fix affixes occurrences calculation |
---|---|
Downloads: | Tarball | ZIP archive | SQL archive |
Timelines: | family | ancestors | descendants | both | trunk | graphspell |
Files: | files | file ages | folders |
SHA3-256: |
f2d827114593b38c534c3a1907d045e2 |
User & Date: | olr on 2018-05-16 11:58:53 |
Other Links: | manifest | tags |
Context
2018-05-16
| ||
16:22 | [fr] pt: descente aux enfers/flambeaux check-in: b5310203be user: olr tags: trunk, fr | |
16:14 | [build][core] rules graph: first draft check-in: 061252f41e user: olr tags: core, build, rg | |
11:58 | [graphspell][bug] fix affixes occurrences calculation check-in: f2d8271145 user: olr tags: trunk, graphspell | |
2018-05-15
| ||
12:51 | [fr] test contre faux positif check-in: f8bf9c3922 user: olr tags: trunk, fr | |
Changes
Modified graphspell-js/dawg.js from [3711bc314d] to [711ba29b0e].
︙ | ︙ | |||
63 64 65 66 67 68 69 | // affixes to find stem from flexion let sAff = funcStemmingGen(sFlex, sStem); if (!dAff.get(sAff)) { dAff.set(sAff, nAff); lAff.push(sAff); nAff += 1; } | | | 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 | // affixes to find stem from flexion let sAff = funcStemmingGen(sFlex, sStem); if (!dAff.get(sAff)) { dAff.set(sAff, nAff); lAff.push(sAff); nAff += 1; } dAffOccur.set(sAff, dAffOccur.gl_get(sAff, 0) + 1); // tags if (!dTag.get(sTag)) { dTag.set(sTag, nTag); lTag.push(sTag); nTag += 1; } dTagOccur.set(sTag, dTagOccur.gl_get(sTag, 0) + 1); |
︙ | ︙ |
Modified graphspell/dawg.py from [eb988983d4] to [8afc042909].
︙ | ︙ | |||
85 86 87 88 89 90 91 | dCharOccur[c] = dCharOccur.get(c, 0) + 1 # affixes to find stem from flexion sAff = funcStemmingGen(sFlex, sStem) if sAff not in dAff: dAff[sAff] = nAff lAff.append(sAff) nAff += 1 | | | 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 | dCharOccur[c] = dCharOccur.get(c, 0) + 1 # affixes to find stem from flexion sAff = funcStemmingGen(sFlex, sStem) if sAff not in dAff: dAff[sAff] = nAff lAff.append(sAff) nAff += 1 dAffOccur[sAff] = dAffOccur.get(sAff, 0) + 1 # tags if sTag not in dTag: dTag[sTag] = nTag lTag.append(sTag) nTag += 1 dTagOccur[sTag] = dTagOccur.get(sTag, 0) + 1 aEntry.add((sFlex, dAff[sAff], dTag[sTag])) |
︙ | ︙ |