Sciweavers

180 search results - page 1 / 36
» Towards an implementable dependency grammar
Sort
View
CORR
1998
Springer
127views Education» more  CORR 1998»
13 years 5 months ago
Towards an implementable dependency grammar
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
Timo Järvinen, Pasi Tapanainen
EMNLP
2010
13 years 3 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
CSLP
2004
Springer
13 years 10 months ago
Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czech
Abstract. This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Exten...
Ondrej Bojar
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
13 years 10 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
CORR
1998
Springer
142views Education» more  CORR 1998»
13 years 5 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker