Comparing Descriptional and Computational Complexity of Infinite Words.
Juraj HromkovicJuhani KarhumäkiArto LepistöPublished in: Results and Trends in Theoretical Computer Science (1994)
Keyphrases
- computational complexity
- np complete
- n gram
- related words
- np hard
- special case
- rate distortion
- linear computational complexity
- low complexity
- neural network
- word sense disambiguation
- text recognition
- finite sets
- memory requirements
- word meaning
- high computational complexity
- linguistic knowledge
- word segmentation
- computational cost
- keywords