<span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">language</span> (countable and uncountable, plural <span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">languages</span>) (formal theory) A <span class="searchmatch">language</span> generated by a <span class="searchmatch">context</span>-<span class="searchmatch">free</span> grammar. language...
<span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">languages</span> plural of <span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">language</span>...
Quite simply, a <span class="searchmatch">context</span> <span class="searchmatch">free</span> <span class="searchmatch">language</span> is a <span class="searchmatch">language</span> that can be generated by a <span class="searchmatch">context</span> <span class="searchmatch">free</span> grammar. Some <span class="searchmatch">languages</span> are <span class="searchmatch">context</span> <span class="searchmatch">free</span>, and some are not...
From <span class="searchmatch">context</span> + -<span class="searchmatch">free</span>. <span class="searchmatch">context</span>-<span class="searchmatch">free</span> (not comparable) (linguistics) (Of a grammar) which generates sentences in stages, in such a way that at any intermediate...
Citations:<span class="searchmatch">context</span>. isolation subcontext <span class="searchmatch">context</span>-based learning <span class="searchmatch">context</span> clue <span class="searchmatch">context</span> collapse <span class="searchmatch">context</span>-dependent <span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">context</span>-<span class="searchmatch">free</span> grammar <span class="searchmatch">context</span>-<span class="searchmatch">free</span> language...
another. (computational linguistics) A mapping of letters to sets of strings, which creates a closed operation for regular and <span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">languages</span>....
contact language <span class="searchmatch">context</span>-<span class="searchmatch">free</span> <span class="searchmatch">language</span> counterlanguage cryptolanguage curly-brace <span class="searchmatch">language</span> curly-braces <span class="searchmatch">language</span> curly-bracket <span class="searchmatch">language</span> cyberlanguage daughter...
They all try to demonstrate that <span class="searchmatch">language</span> is more than just the assembling of <span class="searchmatch">context</span>-<span class="searchmatch">free</span> words using semantics-<span class="searchmatch">free</span> rules 2009, Hans Christian Boas,...
<span class="searchmatch">Languages</span> has been developed by the Computer Science Department of the Radboud University of Nijmegen. It is a formalism in which large <span class="searchmatch">context</span> <span class="searchmatch">free</span> grammars...
parse formulas in the <span class="searchmatch">language</span> of such a grammar in polynomial time; it is called the CYK algorithm. (computing theory) A <span class="searchmatch">context</span>-<span class="searchmatch">free</span> grammar in which the...