Sha256: 710d89d750b7bca1e1c572b021cf1885d069720e2170d7c2fcae3be3e20dfba9
Contents?: true
Size: 1.88 KB
Versions: 7
Compression:
Stored size: 1.88 KB
Contents
#ifndef _RULES_H_ #define _RULES_H_ #include <vector> #include <algorithm> #include "chunk.h" namespace rmmseg { template <typename Cmp> void take_highest(std::vector<Chunk> &chunks, Cmp &cmp) { int i = 1, j; Chunk& max = chunks[0]; for (j = 1; j < chunks.size(); ++j) { int rlt = cmp(chunks[j], max); if (rlt > 0) i = 0; if (rlt >= 0) std::swap(chunks[i++], chunks[j]); } chunks.erase(chunks.begin()+i, chunks.end()); } struct MMCmp_t { int operator()(Chunk &a, Chunk &b) { return a.total_length() - b.total_length(); } } MMCmp; void mm_filter(std::vector<Chunk> &chunks) { take_highest(chunks, MMCmp); } struct LAWLCmp_t { int operator()(Chunk &a, Chunk &b) { double rlt = a.average_length() - b.average_length(); if (rlt == 0) return 0; if (rlt > 0) return 1; return -1; } } LAWLCmp; void lawl_filter(std::vector<Chunk> &chunks) { take_highest(chunks, LAWLCmp); } struct SVWLCmp_t { int operator()(Chunk &a, Chunk& b) { double rlt = a.variance() - b.variance(); if (rlt == 0) return 0; if (rlt < 0) return 1; return -1; } } SVWLCmp; void svwl_filter(std::vector<Chunk> &chunks) { take_highest(chunks, SVWLCmp); } struct LSDMFOCWCmp_t { int operator()(Chunk &a, Chunk& b) { return a.degree_of_morphemic_freedom() - b.degree_of_morphemic_freedom(); } } LSDMFOCWCmp; void lsdmfocw_filter(std::vector<Chunk> &chunks) { take_highest(chunks, LSDMFOCWCmp); } } #endif /* _RULES_H_ */
Version data entries
7 entries across 7 versions & 2 rubygems