A Simple Closed-Class/Open-Class Factorization for Improved Language Modeling

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Natural Language Processing Pacific Rim Symposium

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Neural Probabilistic Language Model

  2003cited by this paper
• Immediate-Head Parsing for Language Models

  2001cited by this paper
• Improving trigram language modeling with the World Wide Web

  2001influential reference
• A bit of progress in language modeling

  2001cited by this paper
• Variable n-grams and extensions for conversational speech language modeling

  2000cited by this paper
• Exploiting latent semantic information in statistical language modeling

  2000cited by this paper
• Two decades of statistical language modeling: where do we go from here?

  2000cited by this paper
• Maximum entropy techniques for exploiting syntactic, semantic and collocational dependencies in language modeling

  2000cited by this paper
• Modeling long distance dependence in language: topic mixtures versus dynamic cache models

  1999cited by this paper
• Adaptation of Statistical Language Models for Automatic Speech Recognition

  1999cited by this paper
• Exploiting Syntactic Structure for Language Modeling

  1998cited by this paper
• Exploiting Syntactic Structure for Language Modeling

  1998cited by this paper
• Variable n-gram language modeling and extensions for conversational speech

  1997cited by this paper
• An Empirical Study of Smoothing Techniques for Language Modeling

  1996cited by this paper
• On structuring probabilistic dependences in stochastic language modelling

  1994cited by this paper
• Grammatical Trigrams: A Probabilistic Model of Link Grammar

  1992cited by this paper
• Class-Based n-gram Models of Natural Language

  1992cited by this paper
• A Dynamic Language Model for Speech Recognition

  1991cited by this paper
• The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression

  1991cited by this paper
• Estimation of probabilities from sparse data for the language model component of a speech recognizer

  1987cited by this paper
• A Maximum Likelihood Approach to Continuous Speech Recognition

  1983cited by this paper
• Computational distinctions of vocabulary type

  1978cited by this paper

• No citing papers are available for this paper.