Research@StAndrews
 
The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/2426
This item has been viewed 10 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
2011a.pdf167.05 kBAdobe PDFView/Open
Title: Computation of infix probabilities for probabilistic context-free grammars
Authors: Nederhof, Mark Jan
Satta, Giorgio
Keywords: Parsing algorithms
Natural language processing
QA75 Electronic computers. Computer science
Issue Date: Jul-2011
Citation: Nederhof , M J & Satta , G 2011 , ' Computation of infix probabilities for probabilistic context-free grammars ' . in Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011) . Association for Computational Linguistics , Stroudsburg, PA , pp. 1213-1221 , 2011 Conference on Empirical Methods on Natural Language Processing , Edinburgh , United Kingdom , 27-29 July .
conference
Abstract: The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction. For the case where a probabilistic context-free grammar is used as language model, methods for the computation of infix probabilities have been presented in the literature, based on various simplifying assumptions. Here we present a solution that applies to the problem in its full generality.
Version: Postprint
URI: http://hdl.handle.net/10023/2426
http://aclweb.org/anthology-new/D/D11/D11-1112.pdf
ISBN: 978-1-937284-11-4
19937284-11-5
Type: Conference item
Rights: This is the author's version of this paper. The published version (c) 2011 The Association for Computational Linguistics is available at http://aclweb.org/anthology-new/D/D11/
Publisher: Association for Computational Linguistics
Appears in Collections:University of St Andrews Research
Computer Science Research



This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)