U e7@sdZddlmZddlmZddlmZmZmZm Z m Z m Z m Z m Z mZddlmZGdddZGdd d ZGd d d ZdddZedkredD] ZeeqeedD] Zeeqd S)a An implementation of the Hole Semantics model, following Blackburn and Bos, Representation and Inference for Natural Language (CSLI, 2005). The semantic representations are built by the grammar hole.fcfg. This module contains driver code to read in sentences and parse them according to a hole semantics grammar. After parsing, the semantic representation is in the form of an underspecified representation that is not easy to read. We use a "plugging" algorithm to convert that representation into first-order logic formulas. )reduce) load_parser) AllExpression AndExpressionApplicationExpressionExistsExpression IffExpression ImpExpressionLambdaExpressionNegatedExpression OrExpression) skolemizec@sdeZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z ed d edd eeeeeeeee ee eiZdS) ConstantsALLEXISTSNOTANDORIMPIFFPREDLEQHOLELABELcCs t|j|SN)rvariableverN/var/www/html/assets/scripts/venv/lib/python3.8/site-packages/nltk/sem/hole.py>zConstants.cCs t|j|Sr)rrrrrr r!?r"N)__name__ __module__ __qualname__rrrrrrrrrrrr rr r rrMAPrrrr r0s8rc@sxeZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ ddZ ddZ ddZddZddZdS) HoleSemanticsar This class holds the broken-down components of a hole semantics, i.e. it extracts the holes, labels, logic formula fragments and constraints out of a big conjunction of such as produced by the hole semantics grammar. It then provides some operations on the semantics dealing with holes, labels and finding legal ways to plug holes with labels. cCs@t|_t|_i|_t|_||||_||_ dS)aB Constructor. `usr' is a ``sem.Expression`` representing an Underspecified Representation Structure (USR). A USR has the following special predicates: ALL(l,v,n), EXISTS(l,v,n), AND(l,n,n), OR(l,n,n), IMP(l,n,n), IFF(l,n,n), PRED(l,v,n,v[,v]*) where the brackets and star indicate zero or more repetitions, LEQ(n,n), HOLE(n), LABEL(n) where l is the label of the node described by the predicate, n is either a label or a hole, and v is a variable. N) setholeslabels fragments constraints _break_down_find_top_most_labelstop_most_labels_find_top_holetop_hole)selfusrrrr __init__Rs  zHoleSemantics.__init__cCs||j|jBkS)ze Return true if x is a node (label or hole) in this semantic representation. )r*r))r2xrrr is_nodelszHoleSemantics.is_nodecCst|tr$||j||jnt|tr|\}}|jjt j krd|j t |d|dq|jjt jkr|j |dq|jjt jkr|j |dq|d}||jkst||ddf|j|<n t|dS)z Extract holes, labels, formula fragments and constraints from the hole semantics underspecified representation (USR). rN) isinstancerr-firstsecondrZuncurryrnamerrr,add Constraintrr)rr*r+AssertionError ValueErrorlabel)r2r3funcargsr@rrr r-ss    zHoleSemantics._break_downcCs@|}|jD](}|d}|D]}||kr"||q"q|S)Nr7)copyr+valuesdiscard)r2Z node_listZ top_nodesfrBargrrr _find_top_nodesszHoleSemantics._find_top_nodescCs ||jS)z Return the set of labels which are not referenced directly as part of another formula fragment. These will be the top-most labels for the subtree that they are part of. )rHr*r2rrr r.sz#HoleSemantics._find_top_most_labelscCs$||j}t|dkst|S)zK Return the hole that will be the top of the formula tree. r7)rHr)lenr>pop)r2Z top_holesrrr r0s zHoleSemantics._find_top_holecCs"g}||jgfg|ji||S)z Calculate and return all the legal pluggings (mappings of labels to holes) of this semantics given the constraints. ) _plug_nodesr1r/)r2recordrrr pluggingsszHoleSemantics.pluggingscs|gkr|d\}|jkr<||dd|||q|jksJtj|d}fdd|D}||dd|||ntddS)ac Plug the nodes in `queue' with the labels in `potential_labels'. Each element of `queue' is a tuple of the node to plug and the list of ancestor holes from the root of the graph to that node. `potential_labels' is a set of the labels which are still available for plugging. `plug_acc' is the incomplete mapping of holes to labels made on the current branch of the search tree so far. `record' is a list of all the complete pluggings that we have found in total so far. It is the only parameter that is destructively updated. rr7Ncsg|]}|r|fqSr)r6).0a ancestorsr2rr s z-HoleSemantics._plug_nodes..z queue empty)r) _plug_holer*r>r+rL Exception)r2queuepotential_labelsplug_accrMnoderBheadrrQr rLs    zHoleSemantics._plug_nodesc Cs||ks t|g|}|D]v}|||r,q|} || |<|} | |t| dkrv|| |jg|| q||||fg| | |qdS)z~ Try all possible ways of plugging a single hole. See _plug_nodes for the meanings of the parameters. rN) r>_violates_constraintsrCremoverJ_sanity_check_pluggingr1appendrL) r2holeZ ancestors0rVZpotential_labels0Z plug_acc0rMrRlrXrWrrr rTs$       zHoleSemantics._plug_holecCs*|jD]}|j|kr|j|krdSqdS)z Return True if the `label' cannot be placed underneath the holes given by the set `ancestors' because it would violate the constraints imposed on it. TF)r,lhsrhs)r2r@rRcrrr r[s    z#HoleSemantics._violates_constraintscCs||jkr|g|}||}n|}||jks0t|jD]}|j|kr6|j|ks6tq6|j|d}|D]"}||rf||||g|qfdS)z Make sure that a given plugging is legal. We recursively go through each node and make sure that no constraints are violated. We also check that all holes have been filled. r7N) r)r*r>r,rarbr+r6r])r2pluggingrYrRr@rcrBrGrrr r]s      z$HoleSemantics._sanity_check_pluggingcCs|||jS)z Return the first-order logic formula tree for this underspecified representation using the plugging given. ) _formula_treer1)r2rdrrr formula_treeszHoleSemantics.formula_treecs`|kr|S|jkrXj|\}}fdd|D}ttj|jj|S|SdS)Ncsg|]}|qSr)re)rOrGrdr2rr rS%sz/HoleSemantics._formula_tree..)rer+rrr&rr;)r2rdrYpredrBchildrenrrgr re s zHoleSemantics._formula_treeN)r#r$r%__doc__r4r6r-rHr.r0rNrLrTr[r]rfrerrrr r'Is  !+ r'c@s8eZdZdZddZddZddZdd Zd d Zd S) r=z~ This class represents a constraint of the form (L =< N), where L is a label and N is a node (a label or a hole). cCs||_||_dSrrarb)r2rarbrrr r41szConstraint.__init__cCs,|j|jkr$|j|jko"|j|jkSdSdS)NF) __class__rarbr2otherrrr __eq__5s zConstraint.__eq__cCs ||k Srrrmrrr __ne__;szConstraint.__ne__cCs tt|Sr)hashreprrIrrr __hash__>szConstraint.__hash__cCsd|jd|jdS)N(z < )rkrIrrr __repr__AszConstraint.__repr__N) r#r$r%rjr4rorprsrvrrrr r=+s r=NFcCst|sd}|rtd|t|}|}t||}|rHtdt|g}|D]}|d}|rttd|t|t r|j }qtt |} |rtd| t | } |rtd| j td| jtd | jtd | jtd | jtd | jD]\} } td | d| q| } tt| j| }|rdt|D] \}}ttd||fq s  , c A