úÎ?4;ù       Safe-Inferred Priority queue. !>Non-empty list of adjacent nodes given in an ascending order. "Is n node an ending node? #Adjacent list for a given node n. We assume, that the list ! is given in an ascending order. $8First element from the the adjacent list, which is also # a priority in the priority queue. %&Tail elements from the adjacent list. &7Remove minimal edge (from, weight, to) from the queue. '6Find the shortest path from the beginning node to one  of the ending nodes.  !()*"+#$%&,-'"#' !()*"+#$%&,-'NoneFCost represents a cost (or weight) of a symbol insertion, deletion or G substitution. It can depend on edit operation position and on symbol  values. <Cost of edit operation. It has to be a non-negative value! Position in a sentence. (A word parametrized with character type a. 7Simple cost function: all edit operations cost 1 unit. . ..None GFind all words within a DAWG with restricted generalized edit distance + lower than or equal to a given threshold.  Cost function  Threshold  Query word /Cost function  Threshold ???  Query word DAWG edge considered   /None ;A susbtitution map which covers all substition operations. >Substition description for some unspecified source character. CCost function with edit operations divided with respect to weight. D Two operations of the same type and with the same weight should be  assigned to the same group. 9Cost of the character insertion divided into groups with  respect to operation weights.  Cost of the character deletion. ?Cost of the character substitution. For each source character 4 there can be a different list of groups involved. DCost of each edit operation is multiplied by the position modifier.  For example, the cost of 'a' character deletion on position 3  is computed as delete 'a' * posMod 3. GA Group describes a weight of some edit operation in which a character H satistying the predicate is involved. This data structure is meant to C collect all characters which determine the same operation weight. ?The predicate determines which characters belong to the group. AWeight of the edit operation in which a character satisfying the  predicate is involved. >Default cost with all edit operations having the unit weight. BConstruct the substitution descrition from the list of (character y,  substition weight from x to y') pairs for some unspecified character  x6. Characters will be grouped with respect to weight. DExtract the list of groups (each group with unique weight) from the  substitution description. JSubstitution description for the given character in the substitution map. N In other words, the function returns information how the input character can 6 be replaced with other characters from the alphabet. 1Construct the substitution map from the list of (x, y , weight of  x -> y substitution) tuples. HTransform CostDiv to plain Cost function using the default weight value 3 for all operations unspecified in the input cost. CTransform CostDiv to plain Cost function with default weight value  set to  +Infinity.        NoneEWe could check, if CostDiv satisfies basic properties. On the other 2 hand, we do not do this for plain Cost function. 0%Get value of a node at the given ID. 123456789:;<Cost function  Threshold  Query word 0=> 143256789:;<0=>None<Restricted generalized edit distance between two words with  given cost function. NoneGFind all words within a list with restricted generalized edit distance  from x lower or equall to k. None    ?          !"#$%&'()*$+,-. /0123455678'9:;<= adict-0.4.0 NLP.AdictNLP.Adict.CostDivNLP.Adict.DistNLP.Adict.GraphNLP.Adict.CoreNLP.Adict.BasicNLP.Adict.NearestNLP.Adict.BruteCostinsertdeletesubstWeightPosWord costDefaultfindAllSubMapSubCostDivposModGroupFilterpredicweightmkSubunSubsubOnmkSubMaptoCost toCostInf findNearesteditDist bruteSearchPQAdjIsEndEdgesproxyfollsminViewminPathfromtoEdgepush#searchvalueByWhichInsDelNodenodeIDnodePosnodeCharweightOf mapWeight $fOrdNode$fEqNode