Commit 97efe9fb authored by Manuel Segimon's avatar Manuel Segimon
Browse files

Re-Refactor perplexity calculation in TrieNode.java

parent 12c4e43c

src/main/java/edu/bu/LanguageCorrection/TrieNode.java

+4 −4
Original line number Diff line number Diff line
@@ -50,14 +50,14 @@ public class TrieNode implements Serializable, Cloneable { 
        float logProb = 0;

        String[] words = phrase.split(" ");

        if (words.length == 1) {

            return 1;

            return (float) 100 / words.length;

        }

        for (String word : words) {

            past = current;

            current = current.children.get(word);

            if (current == null) {

                float alpha = (float) 100 / words.length;

                return alpha + perplexity(phrase.replaceFirst(words[0] + " ", ""), words.length - 1);

                return alpha + perplexity(phrase.replaceFirst(words[0] + " ", ""), words.length);

            }

            logProb += Math.log((float) current.count / past.getAverageChildCount());

        }
@@ -72,14 +72,14 @@ public class TrieNode implements Serializable, Cloneable { 
        float logProb = 0;

        String[] words = phrase.split(" ");

        if (words.length == 1) {

            return 0;

            return (float) 100 / wordCount;

        }

        for (String word : words) {

            past = current;

            current = current.children.get(word);

            if (current == null) {

                float alpha = (float) 100 / wordCount;

                return alpha + perplexity(phrase.replaceFirst(words[0] + " ", ""), wordCount - 1);

                return alpha + perplexity(phrase.replaceFirst(words[0] + " ", ""), wordCount);

            }

            logProb += Math.log((float) current.count / past.getAverageChildCount());

        }