Parsing Boolean grammars over a one-letter alphabet using online convolution.
Alexander OkhotinChristian ReitwießnerPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- context free grammars
- natural language
- phrase structure
- online learning
- tree adjoining
- syntactic pattern recognition
- pattern matching
- context free
- tree bank
- natural language parsing
- graph grammars
- natural language processing
- real time
- grammar induction
- visual languages
- parse tree
- stochastic grammar
- dependency parsing
- boolean functions
- semantic parsing
- real valued
- stochastic context free grammars
- information extraction
- probabilistic context free grammars
- website
- image processing