Package edu.ucla.sspace.text

Examples of edu.ucla.sspace.text.StringDocument

220
221
222
223
224
225
226
227
228
229
230
231
        testSecondRoot(relations, 1);
    }
   
    @Test public void testRootNode() throws Exception {
        DependencyExtractor extractor = new CoNLLDependencyExtractor();
        Document doc = new StringDocument(toTabs(SINGLE_PARSE));
        DependencyTreeNode[] relations = extractor.readNextTree(doc.reader());

        assertEquals(12, relations.length);

        testFirstRoot(relations, 2);
    }
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
241
        testFirstRoot(relations, 2);
    }

    @Test public void testConcatonatedTrees() throws Exception {
        DependencyExtractor extractor = new CoNLLDependencyExtractor();
        Document doc = new StringDocument(toTabs(CONCATONATED_PARSE));
        DependencyTreeNode[] relations = extractor.readNextTree(doc.reader());
       
        assertEquals(16, relations.length);
        testFirstRoot(relations, 2);
        testSecondRoot(relations, 13);
    }
View Full Code Here
240
241
242
243
244
245
246
247
248
249
250
251
        testSecondRoot(relations, 13);
    }

    @Test public void testConcatonatedTreesZeroOffset() throws Exception {
        DependencyExtractor extractor = new CoNLLDependencyExtractor();
        Document doc = new StringDocument(toTabs(DOUBLE_ZERO_OFFSET_PARSE));
        DependencyTreeNode[] relations = extractor.readNextTree(doc.reader());
       
        assertEquals(16, relations.length);
        testFirstRoot(relations, 2);
        testSecondRoot(relations, 13);
    }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
        "av  _   PR  2   2   ET  _   _\n" +
        "arbetsinkomster _   NN  3  3   PA  _   _\n";
    @Test public void testSingleExtraction() throws Exception {
        DependencyExtractor extractor = new WaCKyDependencyExtractor();
        Document doc = new StringDocument(toTabs(SINGLE_PARSE));
        DependencyTreeNode[] nodes = extractor.readNextTree(doc.reader());

        assertEquals(12, nodes.length);

        // Check the basics of the node.
        assertEquals("review", nodes[8].word());
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
        evaluateRelations(nodes[8], new LinkedList<DependencyRelation>(Arrays.asList(expectedRelations)));
    }

    @Test public void testDoubleExtraction() throws Exception {
        DependencyExtractor extractor = new WaCKyDependencyExtractor();
        Document doc = new StringDocument(toTabs(DOUBLE_PARSE));
        BufferedReader reader = doc.reader();
        DependencyTreeNode[] relations = extractor.readNextTree(reader);
        assertTrue(relations != null);
        assertEquals(12, relations.length);

        testFirstRoot(relations, 2);
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
152
        testSecondRoot(relations, 1);
    }
   
    @Test public void testRootNode() throws Exception {
        DependencyExtractor extractor = new WaCKyDependencyExtractor();
        Document doc = new StringDocument(toTabs(SINGLE_PARSE));
        DependencyTreeNode[] relations = extractor.readNextTree(doc.reader());

        assertEquals(12, relations.length);

        testFirstRoot(relations, 2);
    }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
162
        testFirstRoot(relations, 2);
    }

    @Test public void testConcatonatedTrees() throws Exception {
        DependencyExtractor extractor = new WaCKyDependencyExtractor();
        Document doc = new StringDocument(toTabs(CONCATONATED_PARSE));
        DependencyTreeNode[] relations = extractor.readNextTree(doc.reader());
       
        assertEquals(16, relations.length);
        testFirstRoot(relations, 2);
        testSecondRoot(relations, 13);
    }
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
172
        testSecondRoot(relations, 13);
    }

    @Test public void testConcatonatedTreesZeroOffset() throws Exception {
        DependencyExtractor extractor = new WaCKyDependencyExtractor();
        Document doc = new StringDocument(toTabs(DOUBLE_ZERO_OFFSET_PARSE));
        DependencyTreeNode[] relations = extractor.readNextTree(doc.reader());
       
        assertEquals(16, relations.length);
        testFirstRoot(relations, 2);
        testSecondRoot(relations, 13);
    }
View Full Code Here
TOP

Related Classes of edu.ucla.sspace.text.StringDocument

  • edu.ucla.sspace.dependency.CoNLLDependencyExtractorTest
  • edu.ucla.sspace.dependency.WaCKyDependencyExtractorTest
  • edu.ucla.sspace.text.corpora.BloglinesCorpusReader$BloglinesIterator
  • edu.ucla.sspace.text.corpora.ChildesCorpusReader$ChildesFileIterator
  • edu.ucla.sspace.text.corpora.PukWacCorpusReader$UkWacIterator
  • edu.ucla.sspace.text.corpora.PukWacDependencyCorpusReader$UkWacIterator
  • edu.ucla.sspace.text.corpora.SemEvalCorpusReader$SemEvalHandler
  • edu.ucla.sspace.text.corpora.SemEvalLexSubReader$SemEvalHandler
  • edu.ucla.sspace.text.corpora.SenseEvalDependencyCorpusReader$SenseEvalIterator
  • edu.ucla.sspace.text.corpora.UsenetCorpusReader$UseNetIterator
    • 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.