1242 search results - page 43 / 249 » The Theory of Grammar Constraints |
118
Voted
ANLP
1997
15 years 3 months ago
1997
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe ...
116
click to vote
EACL
2003
ACL Anthology
15 years 3 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
118
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
ALT
2005
Springer
15 years 11 months ago
2005
Springer
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
ICWE
2007
Springer
15 years 8 months ago
2007
Springer
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...