Related Searches
Definitions
Context-free_grammar_generation_algorithms
Context-free grammar generation algorithms
Context-free grammar generation algorithms are algorithms which generate a context-free grammar or grammars from given symbol sequence or sequences.
Applications for such algorithms include lossless data compression and data mining.
A list of algorithms
- Sequitur
- Lempel-Ziv-Welch algorithm creates a context-free grammar in a such deterministic way that it is necessary to store only the start rule of the generated grammar.
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Sunday October 05, 2008 at 09:57:59 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
This article is licensed under the GNU Free Documentation License.
Last updated on Sunday October 05, 2008 at 09:57:59 PDT (GMT -0700)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
Search another word or see Context-free_grammar_generation_algorithmson
Dictionary |
Thesaurus
|Spanish
Copyright © 2013 Dictionary.com, LLC. All rights reserved.
