ENIAMinflexion.ml
5.25 KB
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
(*
* ENIAMmorphology, a morphological analyser and a guesser for Polish
* Copyright (C) 2016 Wojciech Jaworski <wjaworski atSPAMfree mimuw dot edu dot pl>
* Copyright (C) 2016 Institute of Computer Science Polish Academy of Sciences
*
* 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 3 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 program. If not, see <http://www.gnu.org/licenses/>.
*)
open ENIAMmorphologyTypes
open Xstd
let load_stems filename =
File.fold_tab filename StringMap.empty (fun stems -> function
[stem; lemma_suf; aspect; ids] ->
let ids = StringSet.of_list (Xstring.split " " ids) in
StringMap.add_inc stems stem [lemma_suf,aspect,ids] (fun l -> (lemma_suf,aspect,ids) :: l)
| l -> failwith ("load_stems: " ^ String.concat " " l))
let load_tab filename =
File.load_tab filename (function
orth :: lemma :: interp :: _ ->
{empty_entry with lemma=lemma; forms=[{empty_form with orth=orth; interp=interp}]}
| line -> failwith ("load_tab: " ^ (String.concat "\t" line)))
let simplify_lemma s =
match Xstring.split ":" s with
[s] -> s,""
| [s;t] -> s,t
| _ -> failwith "simplify_lemma"
type status = LemmaVal | LemmaAlt | LemmNotVal | TokNotFound
let string_of_status = function
LemmaVal -> "LemmaVal"
| LemmaAlt -> "LemmaAlt"
| LemmNotVal -> "LemmNotVal"
| TokNotFound -> "TokNotFound"
let prepare_alt alt alt_filename =
let alt2 = load_tab alt_filename in
let alt = Xlist.fold alt2 alt (fun alt entry ->
Xlist.fold entry.forms alt (fun alt form ->
let simple_lemma,lemma_suf = simplify_lemma entry.lemma in
let v = true, (simple_lemma, lemma_suf, form.interp, 1, LemmaAlt, Star, []) in
StringMap.add_inc alt form.orth [v] (fun l -> v :: l))) in
alt
let prepare_rules rules_filename =
let rules = ENIAMmorphologyRules.load_freq_rules rules_filename in
let rules = ENIAMmorphologyRules.CharTrees.create rules in
rules
let alt = ref (StringMap.empty : (bool * (string * string * string * int * status * star * (string * string) list)) list StringMap.t)
let stems = ref (StringMap.empty : (string * string * StringSet.t) list StringMap.t)
let rules = ref ([] : (StringMap.key * ENIAMmorphologyRules.CharTrees.t) list)
(* let initialize () =
alt := prepare_alt StringMap.empty alt_filename;
alt := prepare_alt !alt alt_supplement_filename;
stems := load_stems stem_filename;
rules := prepare_rules rules_filename *)
let initialize () =
alt := prepare_alt StringMap.empty "resources/alt.tab";
stems := load_stems "resources/stem.tab";
rules := prepare_rules "resources/freq_rules.tab"
let manage_aspect aspect interp =
match Xstring.split_delim "imperf\\.perf" interp with
[s] -> s
| [s;t] -> s ^ aspect ^ t
| _ -> failwith ("manage_aspect: " ^ interp)
let has_vovel_sufix s =
let n = String.length s in
let a = String.get s (n-1) in
if a = 'a' || a = 'e' || a = 'i' || a = 'o' || a = 'u' || a = 'y' then true else
let a = String.sub s (n-2) 2 in
if a = "ó" || a = "ą" || a = "ę" then true else
false
let check_fluency stem rule =
Printf.printf "%s\t%s\n%!" stem (ENIAMmorphologyRules.string_of_freq_rule rule);
let cat = ENIAMmorphologyRules.get_tag rule.tags "cat" in
let lemma = ENIAMmorphologyRules.get_tag rule.tags "lemma" in
let lcon2 = ENIAMmorphologyRules.get_tag rule.tags "lcon2" in
if cat = "noun" && lemma = "ε" && lcon2 = "e" then
if rule.star = Aux || rule.star = Aux2 then false else
if String.get rule.set 0 = 'e' && has_vovel_sufix stem then false else
true else
true
let select_fluent candidates =
let selected =
Xlist.fold candidates [] (fun candidates2 (b,x) ->
if b then x :: candidates2 else candidates2) in
if selected = [] then Xlist.map candidates snd else selected
let get_interpretations orth =
let candidates = ENIAMmorphologyRules.CharTrees.find !rules orth in
let found = try StringMap.find !alt orth with Not_found -> [] in
let found = Xlist.fold candidates found (fun found (stem,rule) ->
(* Printf.printf "%s\t%s\n%!" stem (ENIAMmorphologyRules.string_of_freq_rule rule); *)
let fluency = check_fluency stem rule in
let l = try StringMap.find !stems stem with Not_found -> [] in
let l = Xlist.fold l [] (fun l (lemma_suf,aspect,ids) ->
if StringSet.mem ids rule.id then (lemma_suf,aspect) :: l else l) in
if l = [] then
if rule.star = Star then found else
(fluency,(stem ^ rule.set, "", rule.interp, rule.freq, LemmNotVal, rule.star, rule.tags)) :: found else
Xlist.fold l found (fun found (lemma_suf,aspect) ->
(true,(stem ^ rule.set, lemma_suf, manage_aspect aspect rule.interp, rule.freq, LemmaVal, rule.star, rule.tags)) :: found)) in
let found = select_fluent found in
if found = [] then [orth,"","unk",1,TokNotFound,Star,[]] else found