{"version":"1.0","type":"link","title":"Deterministic parsing - Newikis","description":"In natural language processing, deterministic parsing refers to parsing algorithms that do not backtrack. LR-parsers are an example. (This meaning of the words \"deterministic\" and \"non-deterministic\" differs from that used to describe nondeterministic algorithms.)","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}