27 search results - page 2 / 6 » Natural Language Understanding by Combining Statistical Meth... |
COLING
1996
13 years 6 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...
EMNLP
2009
13 years 3 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...
CLIN
2004
13 years 6 months ago
2004
Machine learning and statistical methods have yielded impressive results in a wide variety of natural language processing tasks. These advances have generally been regarded as eng...
NLPRS
2001
Springer
13 years 9 months ago
2001
Springer
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
ACL
1998
13 years 6 months ago
1998
A critical path in the development of natural language understanding NLU modules lies in the di culty of de ning a mapping from words to semantics: Usually it takes in the order o...