Skip to search formSkip to main contentSkip to account menu

Bigram

Known as: Skipping bigrams, Skipping bigram, Bigram frequency attack 
A bigram or digram is a sequence of two adjacent elements from a string of tokens, which are typically letters, syllables, or words. A bigram is an n… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
Automatic summarizationBanburismusCipher Department of the High Command of the WehrmachtCollocation

Broader (1)

Natural language processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Abusive Language Detection on Arabic Social Media
In this paper, we present our work on detecting abusive language on Arabic social media. We extract a list of obscene words and… 
Highly Cited
2014
Highly Cited
2014
Quantifying the development of phraseological competence in L2 English writing: An automated approach
Highly Cited
2013
Highly Cited
2013
A Joint Model to Identify and Align Bilingual Named Entities
In this article, an integrated model is derived that jointly identifies and aligns bilingual named entities (NEs) between Chinese… 
Review
2012
Review
2012
Senti-lexicon and improved Naïve Bayes algorithms for sentiment analysis of restaurant reviews
Highly Cited
2008
Highly Cited
2008
Simple Semi-supervised Dependency Parsing
We present a simple and effective semisupervised method for training dependency parsers. We focus on the problem of lexical… 
Highly Cited
2005
Highly Cited
2005
Reading Level Assessment Using Support Vector Machines and Statistical Language Models
Reading proficiency is a fundamental component of language competency. However, finding topical texts at an appropriate reading… 
Highly Cited
1994
Highly Cited
1994
Tree-based state tying for high accuracy acoustic modelling
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model… 
Highly Cited
1994
Highly Cited
1994
A Maximum Entropy Model for Prepositional Phrase Attachment
A parser for natural language must often choose between two or more equally grammatical parses for the same sentence. Often the… 
Highly Cited
1993
Highly Cited
1993
Contextual Word Similarity and Estimation From Sparse Data
In recent years there is much interest in word cooccurrence relations, such as n-grams, verb-object combinations, or cooccurrence… 
Highly Cited
1990
Highly Cited
1990
Applications of stochastic context-free grammars using the Inside-Outside algorithm
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)