Unary data structures for language models

Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH

Volumn , Issue , 2011, Pages 1425-1428

  Sorensen, Jeffrey ^a   Allauzen, Cyril ^a  

^a GOOGLE INC   (United States)

Author keywords

N gram language models; Unary data structures

Indexed keywords

COMPRESSION SCHEME; FINITE STATE; LANGUAGE MODEL; MACHINE TRANSLATION SYSTEMS; N-GRAM LANGUAGE MODELS; STORAGE REQUIREMENTS;

DATA STRUCTURES; SPEECH RECOGNITION;

COMPUTATIONAL LINGUISTICS;

EID: 84865720088     PISSN: None     EISSN: 19909772     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. F. Chen and J. Goodman, "An empirical study of smoothing techniques for language modeling," in Proc. of ACL, 1996, pp. 310-318.
2. B. Harb, C. Chelba, J. Dean, and S. Ghemawat, "Back-off language model compression," in Proc. of Interspeech, 2009, pp. 325-355.
3. D. Guthrie and M. Hepple, "Storing the web in memory: space efficient language models with constant time retrieval," in Proc. of EMNLP, 2010, pp. 262-272.
4. K. Church, T. Hart, and J. Gao, "Compressing trigram language models with Golomb coding," in Proc. of EMNLP-CoNLL, pp. 199-207.
5. U. Germann, E. Joanis, and S. Larkin, "Tightly packed tries: How to fit large models into memory, and make them load fast, too," in Proc. of SETQA-NLP, 2009, pp. 31-39.
6. A. Pauls and D. Klein, "Faster and smaller n-gram language models," in Proceedings of the 49th annual meeting of the Association for Computational Linguistics: Human Language Technologies, 2011.
7. C. Allauzen, M. Riley, J. Schalkwyk, W. Skut, and M. Mohri, "OpenFst: A general and efficient weighted finite-state transducer library." in Proc. of CIAA, 2007, pp. 11-23.
8. G. Jacobson, "Space-efficient static trees and graphs," in Proc. of FOCS, 1989, pp. 549-554.
9. R. F. Geary and R. Raman, "Succinct ordinal trees with levelancestor queries," in Proc. of SODA, 2004, pp. 1-10.
10. N. Rahman and R. Raman, "Engineering the louds succinct tree representation," in Proc. of WEA, 2006, p. 145.
11. T. Watanabe, H. Tsukada, and H. Isozaki, "A succinct n-gram language model," in Proc. of the ACL-IJCNLP 2009 Conference Short Papers, 2009, pp. 341-344.
12. M. Mohri, "Semiring frameworks and algorithms for shortestdistance problems," Journal of Automata, Languages and Combinatorics, vol. 7, pp. 321-350, 2002.
13. I. Witten and T. Bell, "The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression," Information Theory, IEEE Transactions on, vol. 37, no. 4, pp. 1085-1094, 1991.
14. J. Hopcroft and R. Tarjan, "Efficient planarity testing," J. ACM, vol. 21, pp. 549-568, October 1974.
15. S. Vigna, "Broadword implementation of rank/select queries," in Proc. of WEA, 2008, pp. 154-168.
16. B. Ballinger, C. Allauzen, A. Gruenstein, and J. Schalkwyk, "Ondemand language model interpolation for mobile speech input," in Proc. of Interspeech, 2010, pp. 1812-1815.
17. J. Schalkwyk, D. Beeferman, F. Beaufays, B. Byrne, C. Chelba, M. Cohen, M. Kamvar, and B. Strope, "Google Search by Voice: A case study," in Advances in Speech Recognition: Mobile Environments, Call Centers and Clinics. Springer, 2010.
18. C. Allauzen, M. Riley, and J. Schalkwyk, "A generalized composition algorithm for weighted finite-state transducers," in Proc. of Interspeech. ISCA, 2009, pp. 1203-1206.
19. L. Q. Ha, P. Hanna, J. Ming, and F. J. Smith, "Extending Zipf's law to n-grams for large corpora," Artif. Intell. Rev., vol. 32, pp. 101-113, December 2009.