ENIAMinflexion.ml
3.18 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
(*
* 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; ids] ->
let ids = StringSet.of_list (Xstring.split " " ids) in
StringMap.add_inc stems stem ids (fun set -> StringSet.union set ids)
| l -> failwith ("load_stems: " ^ String.concat " " l))
let load_tab filename =
File.load_tab filename (function
orth :: lemma :: interp :: _ ->
{lemma=lemma; cat=""; forms=[{orth=orth; interp=interp; freq=1; genre=""; validated=false}]; proper_type="";
ndm=false; stem=""}
| line -> failwith ("load_tab: " ^ (String.concat "\t" line)))
let simplify_lemma s =
match Xstring.split ":" s with
[s] -> s
| [s;_] -> s
| _ -> failwith "simplify_lemma"
let prepare_inflexion alt_filename stem_filename rules_filename =
let alt = load_tab alt_filename in
let alt = Xlist.fold alt StringMap.empty (fun alt entry ->
Xlist.fold entry.forms alt (fun alt form ->
let simple_lemma = simplify_lemma entry.lemma in
let v = simple_lemma, form.interp, 1, [] in
StringMap.add_inc alt form.orth [v] (fun l -> v :: l))) in
let stems = load_stems stem_filename in
let rules = ENIAMmorphologyRules.load_freq_rules rules_filename in
let rules = ENIAMmorphologyRules.CharTrees.create rules in
alt,stems,rules
let alt,stems,rules = prepare_inflexion !alt_filename !stem_filename !rules_filename
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 ids = try StringMap.find stems stem with Not_found -> StringSet.empty in
if not (StringSet.mem ids rule.id) && rule.star <> Productive then found else
let tags = if StringSet.mem ids rule.id then [] else ["lemma not validated"] in
(stem ^ rule.set, rule.interp, rule.freq, tags) :: found) in
let found = (orth,"unk",1,["token not found"]) :: found in
let valid = Xlist.fold found [] (fun valid -> function
lemma,interp,quantity,[] -> (lemma,interp,quantity,[]) :: valid
| _ -> valid) in
if valid = [] then found else valid