A hierarchy of mildly context sensitive dependency grammar
Permalink
Citation
Yli-Jyrä , A M 2004 , A hierarchy of mildly context sensitive dependency grammar . in P Monachesi (ed.) , Proceedings of Formal Grammar 2004 . FG Conferences , pp. 151-165 (preproceedings pages) , FG is a series of conferences on Formal Grammar , France , 07/08/2004 . < http://cslipublications.stanford.edu/FG/index.shtml >
| Title: | A hierarchy of mildly context sensitive dependency grammar |
| Author: | Yli-Jyrä, Anssi Mikael |
| Editor: | Monachesi, Paola |
| Contributor: | University of Helsinki, Department of Modern Languages 2010-2017 |
| Date: | 2004 |
| Language: | eng |
| Number of pages: | 15 |
| Belongs to series: | Proceedings of Formal Grammar 2004 |
| Belongs to series: | FG Conferences |
| URI: | http://hdl.handle.net/10138/33877 |
| Abstract: | The paper presents Colored Multiplanar Link Grammars (CMLG). These grammars are reducible to extended right-linear S-grammars (Wartena 2001) where the storage type S is a concatenation of c pushdowns. The number of colors available in these grammars induces a hierarchy of Classes of CMLGs. By fixing also another parameter in CMLGs, namely the bound t for non-projectivity depth, we get c-Colored t-Non-projective Dependency Grammars (CNDG) that generate acyclic dependency graphs. Thus, CNDGs form a two-dimensional hier- archy of dependency grammars. A part of this hierarchy is mildly context-sensitive and non-projective. |
| Subject: |
113 Computer and information sciences
kontekstisensitiiviset kieliopit pinoautomaatit kieliopit multiplanarity Link Grammar storage grammars pinot non-projectivty depth hierarchy of dependency grammars mildly context-sensitive grammars 111 Mathematics algebrallinen kielitiede graph embeddings algebraic linguistics 612 Languages and Literature dependessisyntaksi multiplanaarisuus projektiivisuus dependency grammar |
| Rights: |
Files in this item
Total number of downloads: Loading...
| Files | Size | Format | View |
|---|---|---|---|
| a_hierarchy_with_errata.pdf | 297.3Kb |
View/ |
This item appears in the following Collection(s)
-
Articles from TUHAT CRIS [38568]
Related items
Showing items related by title, author, creator and subject.
-
(Northern European Association for Language Technology, 2011)NEALT Proceedings SeriesPappret conceptualizes parsning med Constraint Grammar på ett nytt sätt som en process med två viktiga representationer. En representation innehåller lokala tvetydighet och den andra sammanfattar egenskaperna hos den lokala tvetydighet klasser. Båda representationer manipuleras med ren finite-state metoder, men deras samtrafik är en ad hoc -tillämpning av rationella potensserier. Den nya tolkningen av parsning systemet har flera praktiska fördelar, bland annat det inåt deterministiska sättet att beräkna, representera och räkna om alla potentiella tillämpningar av reglerna i meningen.
-
(Växjö University Press, 2003)Eri kielille tehtyjen puupankkien määrä kasvaa tasaista vauhtia. Huomattava osa viimeaikaisista puupankeista käyttää annotaatiokäytäntöä joka perustuu dependenssisyntaksiin. Esitämme tässä paperissa mallin lingvistisesti adekvaattien dependenssirakenteiden luokille. Malli on testattu Danish Dependency Treebankin avulla. jne...
-
(The Association for Computational Linguistics, 2017)A recently proposed encoding for noncrossing digraphs can be used to implement generic inference over families of these digraphs and to carry out first-order factored dependency parsing. It is now shown that the recent proposal can be substantially streamlined without information loss. The improved encoding is less dependent on hierarchical processing and it gives rise to a high-coverage bounded-depth approximation of the space of non- crossing digraphs. This subset is presented elegantly by a finite-state machine that recognizes an infinite set of encoded graphs. The set includes more than 99.99% of the 0.6 million noncrossing graphs obtained from the UDv2 treebanks through planarisation. Rather than taking the low probability of the residual as a flat rate, it can be modelled with a joint probability distribution that is factorised into two underlying stochastic processes – the sentence length distribution and the related conditional distribution for deep nesting. This model points out that deep nesting in the streamlined code requires extreme sentence lengths. High depth is categorically out in common sentence lengths but emerges slowly at infrequent lengths that prompt further inquiry.