On the Computational Complexity of Infinite Words.
Arto LepistöPublished in: Developments in Language Theory (1995)
Keyphrases
- computational complexity
- n gram
- special case
- np complete
- keywords
- word sense disambiguation
- text documents
- proper nouns
- np hard
- text recognition
- computational cost
- linear computational complexity
- high computational complexity
- memory requirements
- decision problems
- wordnet
- neural network
- computationally efficient
- low complexity
- motion estimation
- word segmentation
- word recognition
- optimal solution
- related words
- unknown words
- information systems
- word meaning
- real time