10 search results - page 2 / 2 » Weighted and Probabilistic Context-Free Grammars Are Equally... |
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...
ACL
2012
11 years 7 months ago
2012
This paper proposes a data-driven method for concept-to-text generation, the task of automatically producing textual output from non-linguistic input. A key insight in our approac...
DL
1999
Springer
13 years 9 months ago
1999
Springer
Existing web search engines provide users with the ability to query an off-line database of indices in order to decide on an entry point for further manual navigation. Results are...
COLING
2000
13 years 6 months ago
2000
Multimodal interfaces require effective parsing and nn(lerstanding of utterances whose content is distributed across multiple input modes. Johnston 1998 presents an approach in wh...
MICCAI
2008
Springer
14 years 6 months ago
2008
Springer
Richly labeled images representing several sub-structures of an organ occur quite frequently in medical images. For example, a typical brain image can be labeled into grey matter, ...