36 search results - page 6 / 8 » Polynomial Time Parsing of Combinatory Categorial Grammars |
ACL
1994
13 years 8 months ago
1994
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose inter...
LACL
2005
Springer
14 years 1 months ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
PODS
2010
ACM
14 years 18 days ago
2010
ACM
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
EMNLP
2009
13 years 5 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...