Rule-based morphological disambiguation: On computational complexity of the LanGR formalism.
Pavel KvetonPublished in: Prague Bull. Math. Linguistics (2006)
Keyphrases
- computational complexity
- expert systems
- np complete
- data driven
- mathematical morphology
- multiscale
- high computational complexity
- knowledge representation
- co occurrence
- word sense disambiguation
- special case
- computational cost
- computational efficiency
- np hard
- memory requirements
- rule base
- decision problems
- natural language processing
- rate distortion
- rule based systems
- query translation
- image processing
- formal theory
- low complexity
- natural language
- formal model
- computationally efficient
- motion estimation
- morphological filters
- knowledge base
- explanatory power
- morphological scale space