A General Technique to Train Language Models on Language Models | Citedby Results | Computational Linguistics | MIT Press

Skip to Main Content

Skip Nav Destination

A General Technique to Train Language Models on Language Models

Computational Linguistics (2005) 31 (2): 173–185.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Regular Approximation of Weighted Linear Context-Free Tree Languages

Markus Teichmann

International Journal of Foundations of Computer Science (2017) 28 (05): 523.

Approximate inference: A sampling based modeling technique to capture complex dependencies in a language model

Anoop Deoras
Tomáš Mikolov
Stefan Kombrink
Kenneth Church

Speech Communication (2013) 55 (1): 162.

Computation of distances for regular and context-free probabilistic languages

Mark-Jan Nederhof
Giorgio Satta

Theoretical Computer Science (2008) 395 (2-3): 235.

Probabilistic Context-Free Grammars Estimated from Infinite Distributions

A. Corazza
G. Satta

IEEE Transactions on Pattern Analysis and Machine Intelligence (2007) 29 (8): 1379.

Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation

Kazuya Ogasawara
Satoshi Kobayashi

IPSJ Digital Courier (2007) 3: 746.