Package edu.ucla.sspace.text

Examples of edu.ucla.sspace.text.Document.reader()

152
153
154
155
156
157
158
159
160
161
162
    }

    @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
162
163
164
165
166
167
168
169
170
171
172
    }

    @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
127
128
129
130
131
132
133
134
135
136
137
     */
    private void process(Iterator<Document> docs) throws IOException {
        long numTokens = 0;
        while (docs.hasNext()) {
            Document doc = docs.next();
            DependencyTreeNode[] nodes = extractor.readNextTree(doc.reader());
            for (DependencyTreeNode node : nodes) {
                String token = node.word();
                if (doLowerCasing)
                    token = token.toLowerCase();
                if (doPos)
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
            int docNum = 0;
            long startTime = System.currentTimeMillis();
            Iterator<Document> docs = getDocuments(options);
            while (docs.hasNext()) {
                Document doc = docs.next();
                Iterator<String> tokens = new WordIterator(doc.reader());
                String t1 = null;
                while (tokens.hasNext()) {
                    String t2 = tokens.next();
                    // Count the occurrence of this token if we're supposed to
                    // record it
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
     */
    private void process(Iterator<Document> docs) throws IOException {
        long numTokens = 0;
        while (docs.hasNext()) {
            Document doc = docs.next();
            BufferedReader br = doc.reader();
            String header = br.readLine();

            DependencyTreeNode[] nodes = extractor.readNextTree(br);
            int index;
            for (index = 0; index < nodes.length; ++index)
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
     */
    private void process(Iterator<Document> docs) throws IOException {
        long numTokens = 0;
        while (docs.hasNext()) {
            Document doc = docs.next();
            BufferedReader br = doc.reader();
            String header = br.readLine();
            String[] pieces = header.split("\\s+");
            int index = Integer.parseInt(pieces[3]);

            DependencyTreeNode[] nodes = extractor.readNextTree(br);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.