627 search results - page 21 / 126 » Contextual Grammars as Generative Models of Natural Language... |
FLAIRS
2006
13 years 9 months ago
2006
For a long time categorial grammars were regarded as "toys grammars". Indeed, in spite of a very solid theoretical base, categorial grammars remain rather marginal as so...
ACL
2012
11 years 10 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
AIIA
2005
Springer
13 years 9 months ago
2005
Springer
Incremental processing is relevant for language modeling, speech recognition and language generation. In this paper we devise a dynamic version of Tree Adjoining Grammar (DVTAG) th...
FSMNLP
2009
Springer
13 years 5 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
COLING
1996
13 years 9 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...