blob: b1233215b3cb87c9c8853178b5c1bd95628e8dad [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
satok30088252010-12-01 21:22:15 +090023namespace latinime {
24
25class Dictionary;
26class BigramDictionary {
Ken Wakasae12e9b52012-01-06 12:24:38 +090027 public:
Jean Chalard5b0761e2012-04-06 17:52:18 +090028 BigramDictionary(const unsigned char *dict, int maxWordLength, Dictionary *parentDictionary);
Jean Chalard522a04e2012-04-23 15:37:07 +090029 int getBigrams(const int32_t *word, int length, int *codes, int codesSize,
satok6ba8de22012-03-28 18:21:04 +090030 unsigned short *outWords, int *frequencies, int maxWordLength, int maxBigrams);
Jean Chalard351864b2012-04-24 18:06:51 +090031 int getBigramListPositionForWord(const int32_t *prevWord, const int prevWordLength);
Jean Chalard1ff8dc42012-05-02 16:00:24 +090032 void fillBigramAddressToFrequencyMap(const int32_t *prevWord, const int prevWordLength,
33 std::map<int, int> *map);
satok30088252010-12-01 21:22:15 +090034 ~BigramDictionary();
Ken Wakasae12e9b52012-01-06 12:24:38 +090035 private:
satok18c28f42010-12-02 18:11:54 +090036 bool addWordBigram(unsigned short *word, int length, int frequency);
37 int getBigramAddress(int *pos, bool advance);
38 int getBigramFreq(int *pos);
39 void searchForTerminalNode(int addressLookingFor, int frequency);
40 bool getFirstBitOfByte(int *pos) { return (DICT[*pos] & 0x80) > 0; }
41 bool getSecondBitOfByte(int *pos) { return (DICT[*pos] & 0x40) > 0; }
42 bool checkFirstCharacter(unsigned short *word);
43
44 const unsigned char *DICT;
45 const int MAX_WORD_LENGTH;
satok6ba8de22012-03-28 18:21:04 +090046 // TODO: Re-implement proximity correction for bigram correction
47 static const int MAX_ALTERNATIVES = 1;
satok18c28f42010-12-02 18:11:54 +090048
49 Dictionary *mParentDictionary;
50 int *mBigramFreq;
51 int mMaxBigrams;
52 unsigned short *mBigramChars;
53 int *mInputCodes;
54 int mInputLength;
satok30088252010-12-01 21:22:15 +090055};
Ken Wakasace9e52a2011-06-18 13:09:55 +090056
57} // namespace latinime
58
satok30088252010-12-01 21:22:15 +090059#endif // LATINIME_BIGRAM_DICTIONARY_H