package merlin-lib

  1. Overview
  2. Docs

Module Ocaml_utils.Stable_matchingSource

Sourcemodule Item : sig ... end
Sourcetype left_index = int
Sourcetype right_index = int
Sourcetype rank = int
Sourcetype ('a, 'v) matches = {
  1. left : 'a list;
  2. pairs : ('v * 'v) list;
  3. right : 'a list;
}
Sourcetype ('v, 'k) item_matches = (('v, 'k) Item.t, 'v) matches
Sourcetype unstable_matching = {
  1. first : left_index * right_index;
  2. second : left_index * right_index;
  3. current_rank : rank * rank;
  4. optimal : rank * rank;
}
Sourceval stable_matches : distance:(int -> int -> int) -> (_, int) matches -> (unit, unstable_matching) Result.t
Sourceval strong_stable_matches : distance:(int -> int -> int) -> (_, int) matches -> (unit, unstable_matching) Result.t
Sourceval matches : compatible:(left_index -> right_index -> bool) -> preferences:(right_index -> (left_index * rank) array) -> size:(int * int) -> (int, int) matches

matches ~compatible ~preferences ~size:(ls,rs) computes a matching between a set of ls left items and rs right items favoring the right side. The matches are compatible and weakly stable according to the preferences matrix. The size of the matching is at least 2/3 of the optimal matching size (computing optimal matching with partial preferences and ties is in NP).

Sourceval fuzzy_match_names : compatibility:('k -> 'k -> bool) -> max_right_items:int -> cutoff:(string -> int) -> ('v, 'k) Item.t list -> ('v, 'k) Item.t list -> ('v, 'k) item_matches

fuzzy_match_names ~compatibility ~max_right_item ~cutoff left right calls the matches function using the OSA edit distance to compute preferences with a cutoff function. To avoid quadratic complexity on large module size we limit the right side to the first max_right_item items