Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*******************************************************************************
* Copyright 2012 Institute of Mathematics and Computer Science, University of Latvia
* Author: Pēteris Paikens
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*******************************************************************************/
package lv.lnb.ner;
import java.io.IOException;
import java.io.Writer;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeSet;
public class NECounterSingleDoc {
private HashMap entities = new HashMap();
private HashMap count = new HashMap();
private String docID;
void add(String document, String name, String normalform, String tag) {
NE entity = entities.get(tag+"|"+normalform);
if (entity==null) {
entity = new NE(name, normalform, tag);
entities.put(tag+"|"+normalform, entity);
}
entity.add(name, null);
Integer prevcount = count.get(entity);
if (prevcount == null) prevcount = 0;
count.put(entity,prevcount+1);
}
void show() {
List sorted = new LinkedList( new TreeSet(count.keySet()));
for (NE entity : sorted) {
//System.out.printf("%s\t%s\t%d\n%s",entity.tag, entity.normalform, count.get(entity), entity.alternatives());
System.out.printf("%s\t%s\t%d\n%s",entity.tag, entity.normalform, count.get(entity), "");
}
}
void db_insert(Writer writer) throws IOException {
for (Entry entry : count.entrySet()) {
//String entryItem = String.format("insert into NELinks (name, normalform, category, docID, frequency) values (\"%s\", \"%s\", %d, \"%s\", %d);\n", entry.getKey().getName().replace("\\", "\\\\").replace("\"", "\\\""), entry.getKey().normalform.replace("\\", "\\\\").replace("\"", "\\\""), entry.getKey().category(), docID, entry.getValue());
String entryItem = String.format("%s\t%s\t%d\t%s\t%d\n", entry.getKey().getName(), entry.getKey().normalform, entry.getKey().category(), docID, entry.getValue());
writer.write( entryItem );
}
}
void filter(int limit) {
HashMap newentities = new HashMap();
for (Map.Entry entry : entities.entrySet()) {
NE entity = entry.getValue();
int num = count.get(entity);
if (num
