Wojciech Jaworski / ENIAM

type form = {orth: string; phon_orth: string list; interp: string; freq: int; genre: string; validated: bool}
type entry = {lemma: string; phon_lemma: string list; cat: string; forms: form list;
  proper_type: string; ndm: bool; stem: string; phon_stem: string list}

type star = Productive | Star | Ndm

type rule = {star: star; pref: string; find: string; set: string; tags: (string * string) list;
  interp: string; id: string; freq: int}

let empty_rule = {star=Productive; pref=""; find=""; set=""; tags=[]; interp=""; id=""; freq=0}

let string_of_rule r =
  Printf.sprintf "%s\t%s\t%s\t%s" r.pref r.find r.set
    (String.concat " " (Xlist.map r.tags (fun (k,v) -> k ^ "=" ^ v)))

type lu_entry = {lemma1: string; lemma2: string; rel_id: int; lu_stem: string;
                 lu_validated: bool; validated1: bool; validated2: bool}