Some Computational Complexity Results for Synchronous Context-Free Grammars.
Giorgio SattaEnoch PesericoPublished in: HLT/EMNLP (2005)
Keyphrases
- context free grammars
- computational complexity
- grammatical inference
- context free languages
- context free
- attribute grammars
- np complete
- syntactic pattern recognition
- grammar induction
- regular expressions
- predicate invention
- covering arrays
- production rules
- decision problems
- formal languages
- definite clause
- lexical semantics
- regular languages
- database systems