3 ms·
Or store the lexicon in a determinisitic acyclic finite state automaton. E.g. (shameless plug): https://github.com/danieldk/dictomaton https://github.com/danie
by danieldk 13y ago
Or store the lexicon in a determinisitic acyclic finite state automaton. E.g. (shameless plug):
https://github.com/danieldk/dictomaton https://github.com/danieldk/dictomaton
Though, having implemented a language guesser myself, it's only an issue with very short texts (a few words). On longer texts models based on character n-grams achieve very high accuracies.