Output details
11 - Computer Science and Informatics
University of St Andrews
Return to search
Output 0 of 0 in the submission
Output title
Prefix Probability for Probabilistic Synchronous Context-Free Grammars
Type
E - Conference contribution
DOI
-
Name of conference/published proceedings
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics : Human Language Technologies, Portland, Oregon, June 19-24 , 2011.
Volume number
-
Issue number
-
First page of article
460
ISSN of proceedings
-
Year of publication
2011
Number of additional authors
1
Additional information
<22>Probabilistic synchronous context-free grammars are a central concept in modern statistical machine translation. Whereas prefix probabilities have obvious applications for pruning the search space, and thereby speeding up parsing or translation, there had been no attempts to use them for synchronous context-free grammars, as the effective computation seemed too complicated. This paper introduces an entirely new way of looking at the problem, which in addition carries over to several related formalisms. The crux of the solution is in reducing the problem to a number of much simpler problems, so that effective computation becomes straightforward.
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Artificial intelligence
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
