@Override public String toString() { return word.getCoveredText() + " " + distance; } }
@Override public String toString() { return to.getCoveredText() + " - " + from.getCoveredText(); } }
@Override public String toString() { return to.getCoveredText() + " - " + from.getCoveredText(); } }
@Override public String toString() { return word.getCoveredText() + " " + distance; } }
/** Output a basic representation of the tree */ public void log() { root.log(""); wordToNode.forEach((w, n) -> LOGGER.info("{} : {} ", w.getCoveredText(), n.toString())); } }
/** Output a basic representation of the tree */ public void log() { root.log(""); wordToNode.forEach((w, n) -> LOGGER.info("{} : {} ", w.getCoveredText(), n.toString())); } }
/** * Check if the given word token satisfies the constrains of this dependency node. * * <p>To match, the word token must have the same root part of speech (eg NN will also match NNP, * NNS etc.) and the covered text must satisfy the content regular expression, if defined. * * @param wt * @return true if this matches */ public boolean matches(WordToken wt) { return wt.getPartOfSpeech().startsWith(getType()) && (StringUtils.isEmpty(getContent()) || wt.getCoveredText().matches(getContent())); }
/** * Check if the given word token satisfies the constrains of this dependency node. * * <p>To match, the word token must have the same root part of speech (eg NN will also match NNP, * NNS etc.) and the covered text must satisfy the content regular expression, if defined. * * @param wt * @return true if this matches */ public boolean matches(WordToken wt) { return wt.getPartOfSpeech().startsWith(getType()) && (StringUtils.isEmpty(getContent()) || wt.getCoveredText().matches(getContent())); }
private List<String> getEventTokens(Event e) { List<String> tokens = new ArrayList<>(); if (e.getTokens() != null) { for (int i = 0; i < e.getTokens().size(); i++) { tokens.add(e.getTokens(i).getCoveredText()); } } return tokens; }
private String getLemma(final WordToken token) { final FSArray array = token.getLemmas(); if (array == null || array.size() == 0) { return token.getCoveredText().toLowerCase(); } else { return ((WordLemma) array.get(0)).getLemmaForm(); } }
private String getLemma(final WordToken token) { final FSArray array = token.getLemmas(); if (array == null || array.size() == 0) { return token.getCoveredText().toLowerCase(); } else { return ((WordLemma) array.get(0)).getLemmaForm(); } }
@Test public void testFilterToTopLevelAnnotations() { final Collection<WordToken> select = JCasUtil.select(jCas, WordToken.class); final List<WordToken> topLevel = AnnotationUtils.filterToTopLevelAnnotations(select); Assert.assertEquals(3, topLevel.size()); Assert.assertEquals("0123456789", topLevel.get(0).getCoveredText()); Assert.assertEquals("abcde", topLevel.get(1).getCoveredText()); Assert.assertEquals("fghij", topLevel.get(2).getCoveredText()); }
@Before public void before() { pe = new PatternExtract(from, to, 0, 10); Mockito.when(token.getPartOfSpeech()).thenReturn("NN"); Mockito.when(token.getCoveredText()).thenReturn("token"); }
@Test public void testContainsWord() { assertTrue(a.containsWord(w -> w.getCoveredText().equals("1"))); assertFalse(a.containsWord(w -> w.getCoveredText().equals("4"))); }
/** * Save words. * * @param pattern the pattern * @return the DB object */ private List<Object> saveWords(final Pattern pattern) { final List<Object> list = new ArrayList<>(); for (int i = 0; i < pattern.getWords().size(); i++) { final WordToken w = pattern.getWords(i); final Document o = new Document().append("text", w.getCoveredText()).append("pos", w.getPartOfSpeech()); if (w.getLemmas() != null && w.getLemmas().size() >= 1) { o.put("lemma", w.getLemmas(0).getLemmaForm()); } list.add(o); } return list; }
@Test public void testCanMatchSingleDependency() { DependencyNode node1 = DependencyNode.create("_DT"); DependencyNode node2 = DependencyNode.create("_NN"); DependencyTree tree = new DependencyTree(node2); tree.addDependency("det", node1); Collection<DependencyMatch> match = graph.match(tree); assertFalse(match.isEmpty()); assertEquals(1, match.size()); DependencyMatch matched = match.iterator().next(); assertNotNull(matched.getMatched(node1)); assertNotNull(matched.getMatched(node2)); assertEquals("A", matched.getMatched(node1).getCoveredText()); assertEquals("sample", matched.getMatched(node2).getCoveredText()); }
@Test public void testCanMatchContent() throws UIMAException { createLongerExample(); DependencyNode node1 = DependencyNode.create("_VBD"); DependencyNode node2 = DependencyNode.create("_NNP"); DependencyNode node3 = DependencyNode.create("Paris_NNP"); DependencyTree tree = new DependencyTree(node1); tree.addDependency("dobj", node2).addDependency("conj", node3); Collection<DependencyMatch> match = graph.match(tree); assertFalse(match.isEmpty()); assertEquals(1, match.size()); DependencyMatch matched = match.iterator().next(); assertNotNull(matched.getMatched(node1)); assertNotNull(matched.getMatched(node2)); assertNotNull(matched.getMatched(node3)); assertEquals("visited", matched.getMatched(node1).getCoveredText()); assertEquals("London", matched.getMatched(node2).getCoveredText()); assertEquals("Paris", matched.getMatched(node3).getCoveredText()); }
assertEquals("Ben", matched.getMatched(node1).getCoveredText()); assertEquals("visited", matched.getMatched(node2).getCoveredText()); assertEquals("London", matched.getMatched(node3).getCoveredText()); assertEquals(",", matched.getMatched(node4).getCoveredText()); assertEquals("Paris", matched.getMatched(node5).getCoveredText()); assertEquals("and", matched.getMatched(node6).getCoveredText()); assertEquals("New", matched.getMatched(node7).getCoveredText()); assertEquals("York", matched.getMatched(node8).getCoveredText()); assertEquals(".", matched.getMatched(node9).getCoveredText());
@Test public void testCanMatchBranching() throws UIMAException { createLongerExample(); DependencyNode node1 = DependencyNode.create("_NNP"); DependencyNode node2 = DependencyNode.create("_VBD"); DependencyNode node3 = DependencyNode.create("_NNP"); DependencyTree tree = new DependencyTree(node2); tree.addDependency("dobj", node3); tree.addDependency("nsubj", node1); Collection<DependencyMatch> match = graph.match(tree); assertFalse(match.isEmpty()); assertEquals(1, match.size()); DependencyMatch matched = match.iterator().next(); assertNotNull(matched.getMatched(node1)); assertNotNull(matched.getMatched(node2)); assertNotNull(matched.getMatched(node3)); assertEquals("visited", matched.getMatched(node2).getCoveredText()); assertEquals("Ben", matched.getMatched(node1).getCoveredText()); assertEquals("London", matched.getMatched(node3).getCoveredText()); }
@Test public void testCanMatchMultiple() throws UIMAException { createLongerExample(); DependencyNode node1 = DependencyNode.create("_VBD"); DependencyNode node2 = DependencyNode.create("_NNP"); DependencyNode node3 = DependencyNode.create("_NNP"); DependencyTree tree = new DependencyTree(node1); tree.addDependency("dobj", node2).addDependency("conj", node3); Collection<DependencyMatch> match = graph.match(tree); assertFalse(match.isEmpty()); assertEquals(2, match.size()); DependencyMatch matched = match.iterator().next(); assertNotNull(matched.getMatched(node1)); assertNotNull(matched.getMatched(node2)); assertNotNull(matched.getMatched(node3)); assertEquals("visited", matched.getMatched(node1).getCoveredText()); assertEquals("London", matched.getMatched(node2).getCoveredText()); }