Package translation.trees

Examples of translation.trees.Node

63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
//    parser.parse(inputWords, sourceTrees);
   
   
   
    /* Exemple d'adjonction à gauche */
    Node root = new Node("S", NodeType.ROOT_TYPE);
    Node n = new Node("N", NodeType.SUBST_TYPE);
    root.addSon(n);
    n = new Node("V", NodeType.INTERN_TYPE);
    root.addSon(n);
    Node lexnode = new LexicalNode("dort", "V");
    n.addSon(lexnode);
    ElementaryTree t1 = new ElementaryTree(root, "N0V-dort");
    t1.print();
    System.out.println();
   
    // Arbre à substituer au noeud N du précédent
    root = new Node("N", NodeType.ROOT_TYPE);
    lexnode = new LexicalNode("Jean", "N");
    root.addSon(lexnode);
    ElementaryTree t2 = new ElementaryTree(root, "N - Jean");
    t2.print();
    System.out.println();
   
    // V* Adv
    root = new Node("V", NodeType.ROOT_TYPE);
    n = new Node("V", NodeType.FOOT_TYPE);
    root.addSon(n);
    n = new Node("Adv", NodeType.LEX_TYPE);
    n = new LexicalNode("beaucoup", "Adv");
    root.addSon(n);
    ElementaryTree t3 =
      new ElementaryTree(root, "V* V Adv - bcp", AuxType.RIGHT_ADJTYPE);
    t3.print();
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
    /*
     * Test n°3 sans adjonctions ni FS, avec substitutions en chaîne : réussi
     */
///*
    // N0V
    Node root = new Node("S", NodeType.ROOT_TYPE);
    Node n = new Node("N", NodeType.SUBST_TYPE);
    root.addSon(n);
    n = new Node("VP", NodeType.INTERN_TYPE);
    root.addSon(n);
    Node n2 = new Node("V", NodeType.INTERN_TYPE);
    Node lexnode = new LexicalNode("boit", "V");
    n2.addSon(lexnode);
    n.addSon(n2);
    ElementaryTree t1 = new ElementaryTree(root, "N0V");
    t1.print();
    System.out.println("");

    // detN0 - Arbre à substituer à N0 de t1
    root = new Node("N", NodeType.ROOT_TYPE);
    n = new Node("det", NodeType.INTERN_TYPE);
    root.addSon(n);
    lexnode = new LexicalNode("le", "det");
    n.addSon(lexnode);
    n = new Node("N", NodeType.SUBST_TYPE);
    root.addSon(n);
    ElementaryTree t2 = new ElementaryTree(root, "detN");
    t2.print();
    System.out.println("");

    // Arbre à substituer au noeud de subst de t2
    root = new Node("N", NodeType.ROOT_TYPE);
    lexnode = new LexicalNode("hérisson", "N");
    root.addSon(lexnode);
    ElementaryTree t3 = new ElementaryTree(root, "N");
    t3.print();

View Full Code Here
TOP

Related Classes of translation.trees.Node

  • translation.Test
  • translation.Test2
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.