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
|
;;; skkdic-utl.el --- Utility functions for handling SKK dictionary
;; Copyright (C) 1995 Electrotechnical Laboratory, JAPAN.
;; Licensed to the Free Software Foundation.
;; Keywords: mule, multilingual, Japanese, SKK
;; This file is part of GNU Emacs.
;; GNU Emacs is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;; GNU Emacs 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 General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with GNU Emacs; see the file COPYING. If not, write to the
;; Free Software Foundation, Inc., 59 Temple Place - Suite 330,
;; Boston, MA 02111-1307, USA.
;;; Commentary:
;; SKK is a free Japanese input method running on Mule created by
;; Masahiko Sato <masahiko@sato.riec.tohoku.ac.jp>. The Emacs Lisp
;; library kkc.el provides a facility to convert a Japanese kana
;; string to a kanji-kana-mixed string by using a SKK dictionary.
;;
;; This file provides a generic function to look up a SKK dictionary.
;;
;; The original SKK dictionary SKK-JISYO.L is converted to skkdic.el.
;; We get entries of the dictionary in four variables (listed below)
;; by loadig this file (or byte-compiled version skkdic.elc).
;;; Code:
;; The following four variables are set by loading skkdic.el[c].
(defvar skkdic-okuri-ari nil
"Nested alist for OKURI-ARI entries of SKK dictionary.")
(defvar skkdic-postfix nil
"Nested alist for SETSUBIJI (postfix) entries of SKK dictionary.")
(defvar skkdic-prefix nil
"Nested alist SETTOUJI (prefix) entries of SKK dictionary.")
(defvar skkdic-okuri-nasi nil
"Nested alist for OKURI-NASI entries of SKK dictionary.")
(defconst skkdic-okurigana-table
'((?$B$!(B . ?a) (?$B$"(B . ?a) (?$B$#(B . ?i) (?$B$$(B . ?i) (?$B$%(B . ?u)
(?$B$&(B . ?u) (?$B$'(B . ?e) (?$B$((B . ?e) (?$B$)(B . ?o) (?$B$*(B . ?o)
(?$B$+(B . ?k) (?$B$,(B . ?g) (?$B$-(B . ?k) (?$B$.(B . ?g) (?$B$/(B . ?k)
(?$B$0(B . ?g) (?$B$1(B . ?k) (?$B$2(B . ?g) (?$B$3(B . ?k) (?$B$4(B . ?g)
(?$B$5(B . ?s) (?$B$6(B . ?z) (?$B$7(B . ?s) (?$B$8(B . ?j) (?$B$9(B . ?s)
(?$B$:(B . ?z) (?$B$;(B . ?s) (?$B$<(B . ?z) (?$B$=(B . ?s) (?$B$>(B . ?z)
(?$B$?(B . ?t) (?$B$@(B . ?d) (?$B$A(B . ?t) (?$B$B(B . ?d) (?$B$C(B . ?t)
(?$B$D(B . ?t) (?$B$E(B . ?d) (?$B$F(B . ?t) (?$B$G(B . ?d) (?$B$H(B . ?t) (?$B$I(B . ?d)
(?$B$J(B . ?n) (?$B$K(B . ?n) (?$B$L(B . ?n) (?$B$M(B . ?n) (?$B$N(B . ?n)
(?$B$O(B . ?h) (?$B$P(B . ?b) (?$B$Q(B . ?p) (?$B$R(B . ?h) (?$B$S(B . ?b)
(?$B$T(B . ?p) (?$B$U(B . ?h) (?$B$V(B . ?b) (?$B$W(B . ?p) (?$B$X(B . ?h)
(?$B$Y(B . ?b) (?$B$Z(B . ?p) (?$B$[(B . ?h) (?$B$\(B . ?b) (?$B$](B . ?p)
(?$B$^(B . ?m) (?$B$_(B . ?m) (?$B$`(B . ?m) (?$B$a(B . ?m) (?$B$b(B . ?m)
(?$B$c(B . ?y) (?$B$d(B . ?y) (?$B$e(B . ?y) (?$B$f(B . ?y) (?$B$g(B . ?y) (?$B$h(B . ?y)
(?$B$i(B . ?r) (?$B$j(B . ?r) (?$B$k(B . ?r) (?$B$l(B . ?r) (?$B$m(B . ?r)
(?$B$o(B . ?w) (?$B$p(B . ?w) (?$B$q(B . ?w) (?$B$r(B . ?w)
(?$B$s(B . ?n)
)
"Alist of Okuriganas vs trailing ASCII letters in OKURI-ARI entry.")
(defun skkdic-merge-head-and-tail (heads tails postfix)
(let ((min-len 2)
l)
(while heads
(if (or (not postfix)
(>= (length (car heads)) min-len))
(let ((tail tails))
(while tail
(if (or postfix
(>= (length (car tail)) min-len))
(setq l (cons (concat (car heads) (car tail)) l)))
(setq tail (cdr tail)))))
(setq heads (cdr heads)))
l))
(defconst skkdic-jisx0208-hiragana-block (nth 1 (split-char ?$B$"(B)))
(defun skkdic-lookup-key (seq len &optional postfix prefer-noun)
"Return a list of conversion string for sequence SEQ of length LEN.
SEQ is a vector of Kana characters to be converted by SKK dictionary.
If LEN is shorter than the length of KEYSEQ, the first LEN keys in SEQ
are took into account.
Optional 3rd arg POSTFIX non-nil means SETSUBIJI (postfix) are also
considered to find conversion strings.
Optional 4th arg PREFER-NOUN non-nil means that the conversions
without okurigana are placed at the head of the returned list."
(or skkdic-okuri-nasi
(condition-case err
(load-library "skk/skkdic")
(error (ding)
(with-output-to-temp-buffer "*Help*"
(princ "The library `skkdic' can't be loaded.
The most common case is that you have not yet installed the library
included in LEIM (Libraries of Emacs Input Method) which is
distributed separately from Emacs.
LEIM is available from the same ftp directory as Emacs."))
(signal (car err) (cdr err)))))
(let ((vec (make-vector len 0))
(i 0)
entry)
;; At first, generate vector VEC from SEQ for looking up SKK
;; alists. Nth element in VEC corresponds to Nth element in SEQ.
;; The values are decided as follows.
;; If SEQ[N] is `$B!<(B', VEC[N] is 0,
;; else if SEQ[N] is a Hiragana character, VEC[N] is:
;; ((The 2nd position code of SEQ[N]) - 32),
;; else VEC[N] is 128.
(while (< i len)
(let ((ch (aref seq i))
elts)
(if (= ch ?$B!<(B)
(aset vec i 0)
(setq elts (split-char ch))
(if (and (eq (car elts) 'japanese-jisx0208)
(= (nth 1 elts) skkdic-jisx0208-hiragana-block))
(aset vec i (- (nth 2 elts) 32))
(aset vec i 128))))
(setq i (1+ i)))
;; Search OKURI-NASI entries.
(setq entry (lookup-nested-alist vec skkdic-okuri-nasi len 0 t))
(if (consp (car entry))
(setq entry (copy-sequence (car entry)))
(setq entry nil))
(if postfix
;; Search OKURI-NASI entries with postfixes.
(let ((break (max (- len (car skkdic-postfix)) 1))
entry-head entry-postfix entry2)
(while (< break len)
(if (and (setq entry-head
(lookup-nested-alist vec skkdic-okuri-nasi
break 0 t))
(consp (car entry-head))
(setq entry-postfix
(lookup-nested-alist vec skkdic-postfix
len break t))
(consp (car entry-postfix))
(setq entry2 (skkdic-merge-head-and-tail
(car entry-head) (car entry-postfix) t)))
(if entry
(nconc entry entry2)
(setq entry entry2)))
(setq break (1+ break)))))
;; Search OKURI-NASI entries with prefixes.
(let ((break (min (car skkdic-prefix) (- len 2)))
entry-prefix entry-tail entry2)
(while (> break 0)
(if (and (setq entry-prefix
(lookup-nested-alist vec skkdic-prefix break 0 t))
(consp (car entry-prefix))
(setq entry-tail
(lookup-nested-alist vec skkdic-okuri-nasi len break t))
(consp (car entry-tail))
(setq entry2 (skkdic-merge-head-and-tail
(car entry-prefix) (car entry-tail) nil)))
(progn
(if entry
(nconc entry entry2)
(setq entry entry2))))
(setq break (1- break))))
;; Search OKURI-ARI entries.
(let ((okurigana (assq (aref seq (1- len)) skkdic-okurigana-table))
orig-element entry2)
(if okurigana
(progn
(setq orig-element (aref vec (1- len)))
(aset vec (1- len) (- (cdr okurigana)))
(if (and (setq entry2 (lookup-nested-alist vec skkdic-okuri-ari
len 0 t))
(consp (car entry2)))
(progn
(setq entry2 (copy-sequence (car entry2)))
(let ((l entry2)
(okuri (char-to-string (aref seq (1- len)))))
(while l
(setcar l (concat (car l) okuri))
(setq l (cdr l)))
(if entry
(if prefer-noun
(nconc entry entry2)
(setq entry2 (nreverse entry2))
(nconc entry2 entry)
(setq entry entry2))
(setq entry (nreverse entry2))))))
(aset vec (1- len) orig-element))))
entry))
;;
(provide 'skkdic-utl)
;; skkdic-utl.el ends here
|
