Language Modelling

Tags: #machine learning

Equation

$$p(x)=\prod^{n}_{i=1} p(s_{n}|s_{1},...,s_{n-1})$$

Latex Code

                                 p(x)=\prod^{n}_{i=1} p(s_{n}|s_{1},...,s_{n-1})
                            

Have Fun

Let's Vote for the Most Difficult Equation!

Introduction



Latex Code

            p(x)=\prod^{n}_{i=1} p(s_{n}|s_{1},...,s_{n-1})
        

Explanation

  • : Language modeling is usually framed as unsupervised distribution estimation from a set of examples of
  • : Variable length sequences of symbols
  • : Factorize the joint probabilities over symbols p(x) as the product of conditional probabilities


Discussion

Comment to Make Wishes Come True

Leave your wishes (e.g. Passing Exams) in the comments and earn as many upvotes as possible to make your wishes come true


  • Sarah Rodriguez
    I have high hopes for passing this exam.
    2023-09-02 00:00

    Reply


    Kevin Harris reply to Sarah Rodriguez
    Gooood Luck, Man!
    2023-09-15 00:00:00.0

    Reply


  • Randy Murphy
    Hoping to make it through this exam successfully.
    2023-11-01 00:00

    Reply


    Mildred Turner reply to Randy Murphy
    You can make it...
    2023-11-15 00:00:00.0

    Reply


  • Clarence Briggs
    Aiming for the stars with this test.
    2024-01-08 00:00

    Reply


    Anne Brooks reply to Clarence Briggs
    You can make it...
    2024-01-12 00:00:00.0

    Reply