On the length of uncompletable words in unambiguous automata.
Antonio BoccutoArturo CarpiPublished in: RAIRO Theor. Informatics Appl. (2019)
Keyphrases
- finite alphabet
- n gram
- finite automata
- word sense disambiguation
- cellular automata
- regular expressions
- finite state
- syntactic categories
- linguistic information
- multiword
- word recognition
- word segmentation
- text documents
- keywords
- data sets
- fixed length
- finite state machines
- information theoretic
- language model
- text mining
- related words
- unknown words
- total length
- probabilistic automata
- search engine