blob: b8763a515eb77741ca1f3e7a06421041d917bd1c [file] [log] [blame]
satok30088252010-12-01 21:22:15 +09001/*
2 * Copyright (C) 2010 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#ifndef LATINIME_BIGRAM_DICTIONARY_H
18#define LATINIME_BIGRAM_DICTIONARY_H
19
Jean Chalard1ff8dc42012-05-02 16:00:24 +090020#include <map>
Jean Chalard9c2a96a2012-04-17 11:38:44 +090021#include <stdint.h>
22
Jean Chalardf1634c82012-05-02 19:05:27 +090023#include "defines.h"
24
satok30088252010-12-01 21:22:15 +090025namespace latinime {
26
27class Dictionary;
28class BigramDictionary {
Ken Wakasae12e9b52012-01-06 12:24:38 +090029 public:
Jean Chalard5b0761e2012-04-06 17:52:18 +090030 BigramDictionary(const unsigned char *dict, int maxWordLength, Dictionary *parentDictionary);
Jean Chalard522a04e2012-04-23 15:37:07 +090031 int getBigrams(const int32_t *word, int length, int *codes, int codesSize,
satok6ba8de22012-03-28 18:21:04 +090032 unsigned short *outWords, int *frequencies, int maxWordLength, int maxBigrams);
Jean Chalard351864b2012-04-24 18:06:51 +090033 int getBigramListPositionForWord(const int32_t *prevWord, const int prevWordLength);
Jean Chalardf1634c82012-05-02 19:05:27 +090034 void fillBigramAddressToFrequencyMapAndFilter(const int32_t *prevWord, const int prevWordLength,
35 std::map<int, int> *map, uint8_t *filter);
Tom Ouyang4d289d32012-04-26 23:50:21 -070036 bool isValidBigram(const int32_t *word1, int length1, const int32_t *word2, int length2);
satok30088252010-12-01 21:22:15 +090037 ~BigramDictionary();
Ken Wakasae12e9b52012-01-06 12:24:38 +090038 private:
satok18c28f42010-12-02 18:11:54 +090039 bool addWordBigram(unsigned short *word, int length, int frequency);
40 int getBigramAddress(int *pos, bool advance);
41 int getBigramFreq(int *pos);
42 void searchForTerminalNode(int addressLookingFor, int frequency);
43 bool getFirstBitOfByte(int *pos) { return (DICT[*pos] & 0x80) > 0; }
44 bool getSecondBitOfByte(int *pos) { return (DICT[*pos] & 0x40) > 0; }
45 bool checkFirstCharacter(unsigned short *word);
46
47 const unsigned char *DICT;
48 const int MAX_WORD_LENGTH;
satok6ba8de22012-03-28 18:21:04 +090049 // TODO: Re-implement proximity correction for bigram correction
50 static const int MAX_ALTERNATIVES = 1;
satok18c28f42010-12-02 18:11:54 +090051
52 Dictionary *mParentDictionary;
53 int *mBigramFreq;
54 int mMaxBigrams;
55 unsigned short *mBigramChars;
56 int *mInputCodes;
57 int mInputLength;
satok30088252010-12-01 21:22:15 +090058};
Ken Wakasace9e52a2011-06-18 13:09:55 +090059
60} // namespace latinime
61
satok30088252010-12-01 21:22:15 +090062#endif // LATINIME_BIGRAM_DICTIONARY_H