MoL-2012-03: Peetz, Thomas (2012) On Context-Free Grammar Induction by Incremental Compression. [Report]
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
MoL-2012-03.abstract.txt Download (567B) |
Abstract
State merging algorithms are predominant in Grammar Induction of
finite state machines. This thesis extends the state merging approach
to context-free grammars. It connects current standard implementations
of state merging to compression-based learning. The exact same design
principles are applied to the construction of a context-free grammar
induction algorithm. The resulting induction algorithm is analyzed in
terms of convergence, runtime, and data requirements.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2012-03 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2012 |
| Date Deposited: | 12 Oct 2016 14:38 |
| Last Modified: | 12 Oct 2016 14:38 |
| URI: | https://eprints.illc.uva.nl/id/eprint/869 |
Actions (login required)
 |
View Item |
