Parsing Pregroup Grammars with Letter Promotions in Polynomial Time.
Katarzyna MorozPublished in: FG (2012)
Keyphrases
- context free grammars
- tree adjoining
- phrase structure
- natural language
- context free
- syntactic pattern recognition
- tree bank
- visual languages
- natural language processing
- grammar induction
- parse tree
- grammatical inference
- stochastic context free grammars
- special case
- graph grammars
- finite automata
- stochastic grammar
- natural language parsing
- dependency parsing
- equivalence queries
- natural language sentences
- context sensitive
- approximation algorithms
- computational complexity
- semantic parsing
- positive data
- context dependent
- penn treebank
- tree automata
- parse selection
- learning algorithm
- probabilistic context free grammars
- inductive inference
- finite state
- semantic analysis
- production rules
- xml schema
- worst case