57 lines
2.2 KiB
C++
57 lines
2.2 KiB
C++
/*
|
|
* Copyright (C) 2010 The Android Open Source Project
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef LATINIME_BIGRAM_DICTIONARY_H
|
|
#define LATINIME_BIGRAM_DICTIONARY_H
|
|
|
|
#include <map>
|
|
#include <stdint.h>
|
|
|
|
#include "defines.h"
|
|
|
|
namespace latinime {
|
|
|
|
class Dictionary;
|
|
class BigramDictionary {
|
|
public:
|
|
BigramDictionary(const unsigned char *dict, int maxWordLength);
|
|
int getBigrams(const int32_t *word, int length, int *inputCodes, int codesSize,
|
|
unsigned short *outWords, int *frequencies, int maxWordLength, int maxBigrams) const;
|
|
int getBigramListPositionForWord(const int32_t *prevWord, const int prevWordLength) const;
|
|
void fillBigramAddressToFrequencyMapAndFilter(const int32_t *prevWord, const int prevWordLength,
|
|
std::map<int, int> *map, uint8_t *filter) const;
|
|
bool isValidBigram(const int32_t *word1, int length1, const int32_t *word2, int length2) const;
|
|
~BigramDictionary();
|
|
private:
|
|
DISALLOW_IMPLICIT_CONSTRUCTORS(BigramDictionary);
|
|
bool addWordBigram(unsigned short *word, int length, int frequency, const int maxBigrams,
|
|
int *bigramFreq, unsigned short *bigramChars) const;
|
|
int getBigramAddress(int *pos, bool advance);
|
|
int getBigramFreq(int *pos);
|
|
void searchForTerminalNode(int addressLookingFor, int frequency);
|
|
bool getFirstBitOfByte(int *pos) { return (DICT[*pos] & 0x80) > 0; }
|
|
bool getSecondBitOfByte(int *pos) { return (DICT[*pos] & 0x40) > 0; }
|
|
bool checkFirstCharacter(unsigned short *word, int *inputCodes) const;
|
|
|
|
const unsigned char *DICT;
|
|
const int MAX_WORD_LENGTH;
|
|
// TODO: Re-implement proximity correction for bigram correction
|
|
static const int MAX_ALTERNATIVES = 1;
|
|
};
|
|
|
|
} // namespace latinime
|
|
|
|
#endif // LATINIME_BIGRAM_DICTIONARY_H
|