-
Notifications
You must be signed in to change notification settings - Fork 0
/
libspell.h
85 lines (74 loc) · 2.76 KB
/
libspell.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*-
* Copyright (c) 2017 Abhinav Upadhyay <[email protected]>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef LIBSPELL_H
#define LIBSPELL_H
#include <sys/rbtree.h>
#include "trie.h"
/* Number of possible arrangements of a word of length ``n'' at edit distance 1 */
#define COMBINATIONS(n) n + n - 1 + 26 * n + 26 * (n + 1)
typedef struct word_count {
char *word;
size_t count;
rb_node_t rbtree;
} word_count;
typedef struct wlist {
unsigned char *front;
unsigned char *back;
size_t len;
} wlist;
typedef struct word_list {
struct word_list *next;
char *word;
float weight;
rb_node_t rbtree;
} word_list;
typedef struct spell_t {
trie_t *dictionary;
rb_tree_t *ngrams_tree;
rb_tree_t *soundex_tree;
} spell_t;
void free_list(char **);
spell_t *spell_init(const char *, const char *);
spell_t *spell_init2(word_list *, word_list *);
int spell_is_known_word(spell_t *, const char *, int);
word_list *spell_get_suggestions_slow(spell_t *, char *, size_t);
word_list *spell_get_suggestions_fast(spell_t *, char *, size_t);
char *soundex(const char *);
char *double_metaphone(const char *);
void spell_destroy(spell_t *);
int compare_words(void *, const void *, const void *);
char *lower(char *);
char * sanitize_string(char *);
char *look(u_char *, u_char *, u_char *);
long get_count(char *, char);
void free_word_list(word_list *);
word_list *metaphone_spell_check(spell_t *, char *);
int load_bigrams(spell_t *, const char *);
char **get_completions(spell_t *, const char *);
#endif