On the linear computational complexity of the parser for quasi-context sensitive languages.
Janusz JurekPublished in: Pattern Recognit. Lett. (2000)
Keyphrases
- context sensitive
- linear computational complexity
- context free
- natural language
- linear complexity
- natural language processing
- computational complexity
- language independent
- multiword
- multiple task learning
- cross lingual
- parse tree
- language model
- spelling correction
- learning algorithm
- graph grammars
- dependency parsing
- co occurrence
- support vector machine