Categorial dependency grammars
| Autor: | Boris Karlov, Michael I. Dekhtyar, Alexander Dikovsky |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Discrete mathematics
General Computer Science Categorial grammar Programming language Context-sensitive grammar Combinatory categorial grammar Context-free grammar computer.software_genre Theoretical Computer Science Tree-adjoining grammar Indexed grammar L-attributed grammar Phrase structure grammar computer Mathematics |
| Zdroj: | Theoretical Computer Science. 579:33-63 |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2015.01.043 |
| Popis: | Categorial Dependency Grammars (CDGs) are classical categorial grammars extended by oriented polarized valencies. At the same time, CDGs represent a class of completely lexicalized dependency grammars. They express both projective and non-projective dependencies. CDGs generate non-context-free languages. At that, they are parsed in polynomial time under realistic conditions. CDGs possess a normal form that is analogous to Greibach normal form for cf-grammars. CDG-languages are closed under almost all AFL operations and are accepted by a special class of push-down automata with independent counters. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect