Examples of edu.stanford.nlp.trees.TypedDependency

edu.stanford.nlp.trees.TypedDependency
A TypedDependency is a relation between two words in a GrammaticalStructure. Each TypedDependency consists of a governor word, a dependent word, and a relation, which is normally an instance of {@link GrammaticalRelation GrammaticalRelation}. @author Bill MacCartney

        for (AgigaTypedDependency agigaDep : agigaDeps) {
            // Add one, since the tokens are zero-indexed but the TreeGraphNodes are one-indexed
            TreeGraphNode gov = nodes.get(agigaDep.getGovIdx() + 1);
            TreeGraphNode dep = nodes.get(agigaDep.getDepIdx() + 1);
            // Create the typed dependency
            TypedDependency typedDep = new TypedDependency(GrammaticalRelation.valueOf(agigaDep.getType()), gov, dep);
            dependencies.add(typedDep);
        }
        return dependencies;
    }

View Full Code Here


      GrammaticalRelation relation = head == 0
                                     ? GrammaticalRelation.ROOT
                                     : makeGrammaticalRelation(label);


      dependencies.add(new TypedDependency(relation, headWord, thisWord));
    }


    // Build GrammaticalStructure
    // TODO ideally submodule should just return GrammaticalStructure
    TreeGraphNode rootNode = new TreeGraphNode(root);

View Full Code Here

TOP

Related Classes of edu.stanford.nlp.trees.TypedDependency

edu.jhu.agiga.StanfordAgigaSentence

edu.stanford.nlp.ling.IndexedWord

edu.stanford.nlp.parser.nndep.DependencyParser

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.