On the computational complexity of infinite words.
Pavol DurisJán ManuchPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- computational complexity
- special case
- n gram
- keywords
- decision problems
- proper nouns
- high computational complexity
- storage requirements
- memory requirements
- low complexity
- np complete
- genetic algorithm
- computational cost
- explanatory power
- np hard
- lower bound
- related words
- noun phrases
- database
- english words
- text recognition
- linguistic information
- word segmentation
- text corpora
- social networks
- word sense disambiguation
- case study
- text documents
- bit rate