Weitere Beispiele werden automatisch zu den Stichwörtern zugeordnet - wir garantieren ihre Korrektheit nicht.
The importance of the CYK algorithm stems from its high efficiency in certain situations.
Now the sentence she eats a fish with a fork is analyzed using the CYK algorithm.
It is also possible to extend the CYK algorithm to parse strings using weighted and stochastic context-free grammars.
CYK algorithm, sometimes written as "CKY"
However, this language is parsable by a general CFG parser like the CYK algorithm.
(membership problem is even polynomially decidable - see CYK algorithm and Earley's Algorithm)
Parser algorithms for context-free languages include the CYK algorithm and the Earley's Algorithm.
A variant of the CYK algorithm finds the Viterbi parse of a sequence for a given SCFG.
An extended version of the CYK algorithm can be used to find the "lightest" (least-weight) derivation of a string given some WCFG.
Recognition using the GLR algorithm has the same worst-case time complexity as the CYK algorithm and Earley algorithm: O(n).
This is a subset of the context-free grammars which are accepted by the pushdown automaton and can by parsed in polynomial time, for example by the CYK algorithm.
I am always talking about the CYK algorithm in this paper, and by "inside" and "outside" I am only referring generically to the direction of the CYK DP calculation.
Human languages are better handled by parsers like Generalized LR parser, the Earley parser, or the CYK algorithm that can simultaneously compute all possible parse trees in one pass.
The memory required by divide and conquer alignment ranges up to 271 MB for LSU rRNA, compared to a prohibitive 151 GB for the standard CYK algorithm.
For the use in teaching, Lange and Leiß propose a slight generalization of the CYK algorithm, "without compromising efficiency of the algorithm, clarity of its presentation, or simplicity of proofs" .
For instance, given a context-free grammar, one can use the Chomsky Normal Form to construct a polynomial-time algorithm that decides whether a given string is in the language represented by that grammar or not (the CYK algorithm).