179 search results - page 13 / 36 » Lambek Grammars Are Context Free |
ACL
2008
13 years 9 months ago
2008
We take a multi-pass approach to machine translation decoding when using synchronous context-free grammars as the translation model and n-gram language models: the first pass uses...
COLING
2000
13 years 9 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
CVPR
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
LACL
2001
Springer
14 years 6 hour ago
2001
Springer
