You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
61 lines
1.6 KiB
61 lines
1.6 KiB
#ifndef _RULES_H_
|
|
#define _RULES_H_
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
|
|
#include "chunk.h"
|
|
|
|
namespace rmmseg {
|
|
template <typename Cmp>
|
|
void take_highest(std::vector<Chunk> &chunks, const Cmp &cmp) {
|
|
unsigned int i = 1, j;
|
|
|
|
for (j = 1; j < chunks.size(); ++j) {
|
|
int rlt = cmp(chunks[j], chunks[0]);
|
|
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()(const Chunk &a, const Chunk &b) const {
|
|
return a.total_length() - b.total_length();
|
|
}
|
|
} MMCmp;
|
|
void mm_filter(std::vector<Chunk> &chunks) { take_highest(chunks, MMCmp); }
|
|
|
|
struct LAWLCmp_t {
|
|
int operator()(const Chunk &a, const Chunk &b) const {
|
|
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()(const Chunk &a, const Chunk &b) const {
|
|
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()(const Chunk &a, const Chunk &b) const {
|
|
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_ */
|