@ParserSpecific({"minipar","easyfirst"}) public class ParserSpecificConfigurations
@Override @ParserSpecific({"easyfirst"}) public List<RuleMatch<Info, BasicNode>> findMatches(BasicNode currentTree) throws SyntacticResourceException { return findMatches1(currentTree,null); }
@ParserSpecific("easyfirst") public class ClausalArgumentsIdentifier<I extends Info, S extends AbstractNode<I, S>>
@ParserSpecific({"easyfirst"}) public class SimilarityStorageBasedDIRTSyntacticResource extends SyntacticResourceSupportDIRTTemplates<Info, BasicNode> {
@ParserSpecific({"minipar","easyfirst"}) public class PathObservations
@ParserSpecific("easyfirst") public class ArgumentIdentificationUtilities
/** * @author Amnon Lotan * * @since Jul 11, 2012 */ @LanguageDependent("English") @ParserSpecific("easyfirst") public class TruthTellerConstants { /** * if a node is the nsubj of a "there is" construction (with a "there/EX/expl" node), replace the relation with dobj */ public static final boolean AMMEND_COMPLEMENT_RELATION_IN_EXPLATIVE_PHRASES = true; /** * This is the CT assigned by {@link ClauseTruthAnnotationRuleApplier} to predicates where no information is available. * By implication, it is also the default PT value. */ public static final ClauseTruth DEFAULT_CT = ClauseTruth.U; /** * This flag decides whether to include {@link ComplementRelations#NOMINAL_RELATION} (some {@link StanfordDepedencyRelationType}s between a predicate and a * nominal modifier that is not usually considered an argument/complement, like * {@link StanfordDepedencyRelationType#nn} ) in the bigger complement relations list. That list is used in the {@link ClauseTruthAnnotationRuleApplier} to identify * and annotate complements of each visited predicate. */ public static final boolean INCLUDE_NOMINAL_RELATIONS_IN_THE_COMPLEMENT_RELATIONS = false; }
@ParserSpecific("easyfirst") public class IsAConstructionOperation extends GenerationOperationForExtendedNode
@ParserSpecific("easyfirst") public class EasyFirst_IsA_Constructor
@ParserSpecific("easyfirst") public class ComplementRelations {
@ParserSpecific({"easyfirst","minipar"}) public class InfoObservations
@ParserSpecific({"minipar","easyfirst"}) public class TemplateToTree
@ParserSpecific("easyfirst") private void addCopyForRefRelation()
@ParserSpecific("easyfirst") public class ArgumentsIdentifier<I extends Info, S extends AbstractNode<I, S>>
@ParserSpecific("easyfirst") @StandardSpecific({"stanford-dependencies","nomlex"}) public class NominalPredicateArgumentStructureIdentifier<I extends Info, S extends AbstractNode<I, S>>
/** * Given a node in the parse-tree, this method finds a direct-child of that node * that is connected to it via "ref" relation, and also has an antecedent. * * @param node * @return */ @StandardSpecific("stanford-dependencies") @ParserSpecific("easyfirst") public static <I extends Info, S extends AbstractNode<I, S>> S getRefWithAntecedent(S node) { S refWithAntecedent = null; if (node.hasChildren()) { for (S child : node.getChildren()) { if ("ref".equals(InfoGetFields.getRelation(child.getInfo()))) { if (child.getAntecedent()!=null) { refWithAntecedent = child; break; } } } } return refWithAntecedent; }
@ParserSpecific("easyfirst") public static <I extends Info, S extends AbstractNode<I, S>> boolean prepOughtToBePrepc(S parent, S child)
@StandardSpecific("stanford-dependencies") @ParserSpecific("easyfirst") private void identifyRcmodAndPartmodArguments()
@ParserSpecific("easyfirst") public static <I extends Info, S extends AbstractNode<I, S>> ArgumentType argumentTypeByRef(Predicate<I,S> predicate, S argumentSyntacticHead)
@ParserSpecific("easyfirst") @StandardSpecific("stanford-dependencies") private ArgumentType checkIfClausalArgument(ArgumentNodeAndPathFromPredicate<I,S> argumentNode)