Login / Signup
Simple Variable Length N-grams for Probabilistic Automata Learning.
Fábio N. Kepler
Sérgio L. S. Mergen
Cléo Zanella Billa
Published in:
ICGI (2012)
Keyphrases
</>
variable length
n gram
fixed length
probabilistic automata
language model
text classification
face recognition
markov chain
text categorization
maximum entropy
finite automata
character n grams