PP-2004-28: Prescher, Detlef and Scha, Remko and Sima'an, Khalil and Zollmann, Andreas (2004) Treebank Grammars and Other Infinite Parameter Models. [Report]
Preview |
Text (Full Text)
PP-2004-28.text.pdf Download (116kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2004-28.abstract.txt Download (700B) |
Abstract
Syntactic disambiguators for natural languages often use "Treebank
Grammars": probabilistic grammars which are directly projected from an
annotated corpus. In this paper we show that for describing these
systems in the framework of Estimation Theory, we must generalize this
theory so that it allows for an infinite number of
parameters. Embracing this generalization will also bring the
justification of statistical smoothing techniques within the score of
Estimation Theory.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2004-28 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2004 |
| Uncontrolled Keywords: | Computational Linguistics; Statistical NLP; Treebank Grammars; Estimation Theory |
| Depositing User: | prescher |
| Date Deposited: | 12 Oct 2016 14:36 |
| Last Modified: | 12 Oct 2016 14:36 |
| URI: | https://eprints.illc.uva.nl/id/eprint/139 |
Actions (login required)
 |
View Item |
