Skip to content

Problem 3.2 #2

Open
Open

Description

@vashakidze

Please clarify few details about the third problem.

  1. Are we supposed to obtain freq(ab) from the frequency dictionary of trig-rams? (should we sum all the occurrences of trig-rams that contain needed bi-grams?)
    2)" If the generated text ends with a N−1 -gram that does not occur in the training data, generate the next character from the full character or ngram distribution. " Does it mean that, for example, if there is no freq(abcd) and therefore the way to compute freq(abcde)/freq(abcd), we should go step lower and try to find freq(abcd)/freq(abc) and so on ? (before we get to the uni-gram distribution?

I have read the previous issue about this topic, but still need more clarification (if possible).

Activity

  1. juditacs commented on Mar 17, 2018

    @juditacs
    Collaborator
    1. Yes, you have to derive freq(ab) from the frequency dictionary.
    2. There are various solutions, the one you listed is a correct one as well.

    I hope that clears it up.

  2. vashakidze commented on Mar 17, 2018

    @vashakidze
    Author

    It surely does. thank you very much

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions