Class BiSegGraph


  • class BiSegGraph
    extends java.lang.Object
    Graph representing possible token pairs (bigrams) at each start offset in the sentence.

    For each start offset, a list of possible token pairs is stored.

    • Field Detail

      • tokenPairListTable

        private java.util.Map<java.lang.Integer,​java.util.ArrayList<SegTokenPair>> tokenPairListTable
      • segTokenList

        private java.util.List<SegToken> segTokenList
    • Constructor Detail

      • BiSegGraph

        public BiSegGraph​(SegGraph segGraph)
    • Method Detail

      • generateBiSegGraph

        private void generateBiSegGraph​(SegGraph segGraph)
      • isToExist

        public boolean isToExist​(int to)
        Returns true if their is a list of token pairs at this offset (index of the second token)
        Parameters:
        to - index of the second token in the token pair
        Returns:
        true if a token pair exists
      • getToList

        public java.util.List<SegTokenPair> getToList​(int to)
        Return a List of all token pairs at this offset (index of the second token)
        Parameters:
        to - index of the second token in the token pair
        Returns:
        List of token pairs.
      • getToCount

        public int getToCount()
        Get the number of SegTokenPair entries in the table.
        Returns:
        number of SegTokenPair entries
      • getShortPath

        public java.util.List<SegToken> getShortPath()
        Find the shortest path with the Viterbi algorithm.
        Returns:
        List
      • toString

        public java.lang.String toString()
        Overrides:
        toString in class java.lang.Object