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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* libthai - Thai Language Support Library
* Copyright (C) 2001 Theppitak Karoonboonyanan <thep@linux.thai.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
* thbrk.c - Thai word break routine
* Created: 2006-08-20
* Author: Theppitak Karoonboonyanan <thep@linux.thai.net>
*/
#include <string.h>
#include <stdlib.h>
#include <stdint.h>
#include <thai/tis.h>
#include <thai/thctype.h>
#include <thai/thbrk.h>
#include "thbrk-private.h"
#include "brk-ctype.h"
#include "brk-maximal.h"
#define MAX_ACRONYM_FRAG_LEN 3
void
thbrk_on_unload ()
{
brk_maximal_on_unload ();
}
/**
* @brief Insert word delimitors in given string
*
* @param in : the input string to be processed
* @param out : the output buffer
* @param n : the size of @a out
* @param delim : the word delimitor to insert
*
* @return the actual size of the processed string
*
* Analyzes the input string and store the string in output buffer
* with the given word delimitor inserted at every word boundary.
*/
int
th_brk_line (const thchar_t *in, thchar_t *out, size_t n, const char *delim)
{
int *brk_pos;
size_t n_brk_pos, i, j;
int delim_len;
thchar_t *p_out;
n_brk_pos = strlen ((const char *) in);
if (n_brk_pos > SIZE_MAX / sizeof (int))
return 0;
brk_pos = (int *) malloc (n_brk_pos * sizeof (int));
if (!brk_pos)
return 0;
n_brk_pos = th_brk (in, brk_pos, n_brk_pos);
delim_len = strlen (delim);
for (i = j = 0, p_out = out; n > 1 && i < n_brk_pos; i++) {
while (n > 1 && j < brk_pos[i]) {
*p_out++ = in [j++];
--n;
}
if (n > delim_len + 1) {
strcpy ((char *) p_out, delim);
p_out += delim_len;
n -= delim_len;
}
}
while (n > 1 && in [j]) {
*p_out++ = in [j++];
--n;
}
*p_out = '\0';
free (brk_pos);
return p_out - out;
}
/**
* @brief Find word break positions in Thai string
*
* @param s : the input string to be processed
* @param pos : array to keep breaking positions
* @param n : size of @a pos[]
*
* @return the actual number of breaking positions occurred
*
* Finds word break positions in Thai string @a s and stores at most @a n
* breaking positions in @a pos[], from left to right.
*/
int
th_brk (const thchar_t *s, int pos[], size_t n)
{
brk_class_t prev_class, effective_class;
const thchar_t *thai_chunk, *acronym_end, *p;
int cur_pos;
if (!*s)
return 0;
brk_maximal_init ();
p = thai_chunk = acronym_end = s;
prev_class = effective_class = brk_class (*p);
cur_pos = 0;
while (*++p && cur_pos < n) {
brk_class_t new_class;
brk_op_t op;
new_class = brk_class (*p);
op = brk_op (effective_class, new_class);
if (BRK_CLASS_THAI == prev_class) {
/* handle acronyms */
if ('.' == *p && p - acronym_end <= MAX_ACRONYM_FRAG_LEN) {
/* the fullstop after Thai is part of Thai acronym */
new_class = BRK_CLASS_THAI;
acronym_end = p + 1;
} else if (acronym_end > thai_chunk) {
/* an acronym was marked */
if (BRK_CLASS_THAI != new_class
|| p - acronym_end > MAX_ACRONYM_FRAG_LEN)
{
/* end of Thai chunk or entered non-acronym Thai word,
* jump back to the acronym end */
prev_class = effective_class = brk_class ('.');
p = thai_chunk = acronym_end;
new_class = brk_class (*p);
op = brk_op (effective_class, new_class);
}
}
/* break chunk if leaving Thai chunk */
if (BRK_CLASS_THAI != new_class && p > thai_chunk) {
int n_brk, i;
n_brk = brk_maximal_do (thai_chunk, p - thai_chunk,
pos + cur_pos, n - cur_pos);
for (i = 0; i < n_brk; i++)
pos [cur_pos + i] += thai_chunk - s;
cur_pos += n_brk;
/* remove last break if at string end
* note that even if it's allowed, the table-lookup
* operation below will take care of it anyway
*/
if (pos[cur_pos - 1] == p - s)
--cur_pos;
if (cur_pos >= n)
break;
}
} else {
/* set chunk if entering Thai chunk */
if (BRK_CLASS_THAI == new_class)
thai_chunk = acronym_end = p;
}
switch (op) {
case BRK_OP_ALLOWED:
if ('\n' == *p && '\r' == *(p - 1))
break;
pos [cur_pos++] = p - s;
break;
case BRK_OP_INDIRECT:
/* assert (BRK_CLASS_SPACE != new_class); */
if (BRK_CLASS_SPACE == prev_class)
pos [cur_pos++] = p - s;
break;
default:
break;
}
prev_class = new_class;
if (BRK_OP_ALLOWED == op || BRK_CLASS_SPACE != new_class)
effective_class = new_class;
}
/* break last Thai non-acronym chunk */
if (BRK_CLASS_THAI == prev_class && acronym_end <= thai_chunk
&& cur_pos < n)
{
int n_brk, i;
n_brk = brk_maximal_do (thai_chunk, p - thai_chunk,
pos + cur_pos, n - cur_pos);
for (i = 0; i < n_brk; i++)
pos [cur_pos + i] += thai_chunk - s;
cur_pos += n_brk;
/* remove last break if at string end */
if (pos[cur_pos - 1] == p - s)
--cur_pos;
}
brk_maximal_quit ();
return cur_pos;
}
/*
vi:ts=4:ai:expandtab
*/
|
