The amount of ambiguity in context in natural human language makes it impossible to parse deterministically.

However, it is ambiguous and we have to infer that association. The antecedent to the pronoun 'She' in the third sentence clearly refers to Jill as she is the one with children. Then she drove to the school.' While this is poor grammar, it is 'natural' in that they are utterances that people make and they are generally parseable by other people. 'Jill drove to the grocery store to meet her friend Sally before she picked up her kids. Some context-free grammars such as LR(k) grammars are handled by PDAs, however natural human language is not context-free.

Natural languages are not regular languages. Turing machines give universal computation and are useful for writing programs of arbitrary complexity. PDAs are a little more powerful, and can answer such questions. They cannot, however, even answer the question of whether a word is a palindrome. It seems like the real question you want to be asking are: 'What are some efficient techniques in natural language processing?' But I will address your question first.ДЇirst of all, neither FSA (Finite State Automata) not PDA (Push Down Automata) are sufficient techniques to model language.

Finite state automata natural langauge