o ¹i7(ã@srdZddlmZmZddlmZGdd„dedZGdd„dedZGd d „d eƒZGd d „d eƒZ Gd d„deƒZ dd„Z dd„Z ee ƒe ƒZ e e ƒe ƒZGdd„deƒZdd„Zdd„Zdd„Zdd„Zeeƒe ƒZe eƒe ƒZe eƒeddZGdd „d eƒZd!d"„Zd#d$„ZeeƒeƒZe eƒedƒZd%d&„ZGd'd(„d(eƒZd)d*„Zd+d,„ZeeƒeƒZ e eƒeƒZ!d-S).z CCG Combinators é)ÚABCMetaÚabstractmethod)ÚFunctionalCategoryc@ó(eZdZdZedd„ƒZedd„ƒZdS)ÚUndirectedBinaryCombinatora« Abstract class for representing a binary combinator. Merely defines functions for checking if the function and argument are able to be combined, and what the resulting category is. Note that as no assumptions are made as to direction, the unrestricted combinators can perform all backward, forward and crossed variations of the combinators; these restrictions must be added in the rule class. cCódS©N©©ÚselfÚfunctionÚargumentr r úN/var/www/edux/Edux_v2/venv/lib/python3.10/site-packages/nltk/ccg/combinator.pyÚ can_combineóz&UndirectedBinaryCombinator.can_combinecCrrr r r r rÚcombine rz"UndirectedBinaryCombinator.combineN©Ú__name__Ú __module__Ú __qualname__Ú__doc__rrrr r r rrs  r)Ú metaclassc@r)ÚDirectedBinaryCombinatorzÝ Wrapper for the undirected binary combinator. It takes left and right categories, and decides which is to be the function, and which the argument. It then decides whether or not they can be combined. cCrrr ©r ÚleftÚrightr r rr-rz$DirectedBinaryCombinator.can_combinecCrrr rr r rr1rz DirectedBinaryCombinator.combineNrr r r rr%s  rc@ó2eZdZdZd dd„Zdd„Zdd„Zd d „Zd S) ÚForwardCombinatorzÏ Class representing combinators where the primary functor is on the left. Takes an undirected combinator, and a predicate which adds constraints restricting the cases in which it may apply. ÚcCó||_||_||_dSr©Ú _combinatorÚ _predicateÚ_suffix©r Ú combinatorÚ predicateÚsuffixr r rÚ__init__>ó zForwardCombinator.__init__cCs|j ||¡o | ||¡Sr©r!rr"rr r rrCóÿzForwardCombinator.can_combineccs|j ||¡EdHdSr©r!rrr r rrHó€zForwardCombinator.combinecCód|j›|j›S)Nú>©r!r#©r r r rÚ__str__KózForwardCombinator.__str__N©r©rrrrr(rrr2r r r rr6s   rc@r) ÚBackwardCombinatorzA The backward equivalent of the ForwardCombinator class. rcCrrr r$r r rr(Tr)zBackwardCombinator.__init__cCs|j ||¡o | ||¡Srr*rr r rrYr+zBackwardCombinator.can_combineccs|j ||¡EdHdSrr,rr r rr^r-zBackwardCombinator.combinecCr.)Nú X (>) And the corresponding backwards application rule cCs| ¡sdS| ¡ |¡duS©NF)Ú is_functionÚargÚ can_unifyr r r rrmsz)UndirectedFunctionApplication.can_combineccs<| ¡sdS| ¡ |¡}|durdS| ¡ |¡VdSr)r;r<r=ÚresÚ substitute©r r r Úsubsr r rrss€z%UndirectedFunctionApplication.combinecCódS)Nrr r1r r rr2}óz%UndirectedFunctionApplication.__str__N©rrrrrrr2r r r rr9es  r9cCs | ¡ ¡Sr©ÚdirÚ is_forward©rrr r rÚ forwardOnly…ó rIcCs | ¡ ¡Sr©rFÚ is_backwardrHr r rÚ backwardOnlyŠrJrMc@r8) ÚUndirectedCompositionz¬ Functional composition (harmonic) combinator. Implements rules of the form X/Y Y/Z -> X/Z (B>) And the corresponding backwards and crossed variations. cCsF| ¡r| ¡s dS| ¡ ¡r!| ¡ ¡r!| ¡ | ¡¡duSdSr:)r;rFÚ can_composer<r=r>r r r rr›s z!UndirectedComposition.can_combineccs~| ¡r | ¡s dS| ¡ ¡r9| ¡ ¡r;| ¡ | ¡¡}|dur=t| ¡ |¡| ¡ |¡| ¡ƒVdSdSdSdSr)r;rFrOr<r=r>rr?r@r r rr¤s€   ýýzUndirectedComposition.combinecCrB)NÚBr r1r r rr2°rCzUndirectedComposition.__str__NrDr r r rrN“s  rNcCó| ¡ ¡o | ¡ ¡SrrErHr r rÚ bothForwardµórRcCrQrrKrHr r rÚ bothBackward¹rSrTcCs| ¡ ¡o | ¡ ¡Sr)rFrGrLrHr r rÚ crossedDirs¾rSrUcCs6t||ƒsdS| ¡ ¡s| ¡ ¡rdS| ¡ ¡Sr:)rUrFÚ can_crossr<Ú is_primitiverHr r rÚbackwardBxConstraintÂs  rXÚx)r'c@r8) ÚUndirectedSubstitutionzˆ Substitution (permutation) combinator. Implements rules of the form Y/Z (X\Y)/Z -> X/Z (r<rFrOr r r rrßs  ÿz"UndirectedSubstitution.can_combineccs4| ||¡rt| ¡ ¡| ¡| ¡ƒVdSdSr)rrr>r<rFr r r rrðs €  ÿÿzUndirectedSubstitution.combinecCrB)NÚSr r1r r rr2örCzUndirectedSubstitution.__str__NrDr r r rrZ×s  rZcCs*t||ƒsdS| ¡ ¡ ¡o| ¡ ¡Sr:)rRr>rFrGr<rWrHr r rÚforwardSConstraintûs r\cCsF| ¡ ¡s| ¡ ¡rdSt||ƒsdS| ¡ ¡ ¡o"| ¡ ¡Sr:)rFrVrRr>rLr<rWrHr r rÚbackwardSxConstraints  r]cCs$| ¡ ¡r| ¡}| ¡ ¡s|Sr)r>r;)Úcategr r rÚinnermostFunctions  ÿr_c@r8) ÚUndirectedTypeRaisez1 Undirected combinator for type raising. cCs>| ¡r | ¡ ¡s dSt|ƒ}t t ¡¡}|durdSdS)NFT)r;r>r_rr=Ú arg_categr<)r r r<rAr r rrszUndirectedTypeRaise.can_combineccsv| ¡r| ¡r| ¡ ¡sdSt|ƒ}| | ¡¡}|dur9| ¡ |¡}t|t||| ¡ƒ| ¡ ƒVdSdSr) rWr;r>r_r=r<r?rrF)r r r<rAÚxcatr r rr/s €ÿÿ ÿ ÿþzUndirectedTypeRaise.combinecCrB)NÚTr r1r r rr2?rCzUndirectedTypeRaise.__str__NrDr r r rr`s  r`cCs t|ƒ}| ¡ ¡o| ¡ ¡Sr)r_rFrLr>rW©rrr<r r rÚforwardTConstraintHórecCs t|ƒ}| ¡ ¡o| ¡ ¡Sr)r_rFrGr>rWrdr r rÚbackwardTConstraintMrfrgN)"rÚabcrrÚ nltk.ccg.apirrrrr6r9rIrMÚForwardApplicationÚBackwardApplicationrNrRrTrUrXÚForwardCompositionÚBackwardCompositionÚ BackwardBxrZr\r]ÚForwardSubstitutionÚ BackwardSxr_r`rergÚForwardTÚ BackwardTr r r rÚsB    " ÿ$ 1