public class Hobbs extends Object
| Constructor and Description |
|---|
Hobbs() |
| Modifier and Type | Method and Description |
|---|---|
static int |
distance(Document doc,
Annotation m1,
Annotation m2,
ArrayList<Annotation> antecedents,
Vector sentences)
computes the distance (number of mention nodes traversed) in a Hobbs search
starting from parse tree node 'm2' and searching backwards for parse
tree node 'm1'.
|
static boolean |
sameSimplex(Annotation x,
Annotation y,
HashMap<Annotation,Annotation> parents)
returns true if parse tree nodes
x and y
are part of the same simplex sentence (used for reflexive pronoun tests). |
public static int distance(Document doc, Annotation m1, Annotation m2, ArrayList<Annotation> antecedents, Vector sentences)
m1 - a parse tree node (the potential antecedent)m2 - a parse tree node (the anaphor)antecedents - a list of the potential antecedents in the sentence
containing m2, in Hobbs order, as produced by
collectAntecedentssentences - a Vector of the sentences in the Documentpublic static boolean sameSimplex(Annotation x, Annotation y, HashMap<Annotation,Annotation> parents)
x and y
are part of the same simplex sentence (used for reflexive pronoun tests).Copyright © 2016 New York University. All rights reserved.