摘要: • Formal grammars (eg regular, context free) give a hard “binary” model of the legal sentences in a language.• For NLP, a probabilistic model of a language that gives a probability that a string is a member of a language is more useful.• To specify a correct probability distribution, the probability of all sentences in a language must sum to 1.