Polynomially parsable unification grammars.
Hadas PeledShuly WintnerPublished in: J. Log. Comput. (2015)
Keyphrases
- grammatical inference
- np complete
- context free grammars
- theorem proving
- visual languages
- natural language
- higher order
- mildly context sensitive
- natural language processing
- pac learning
- finite state automata
- theorem prover
- parse selection
- real time
- context free
- neural network
- sample complexity
- hypothesis space
- tree grammars
- dnf formulas
- equational theories
- context free languages
- function symbols
- data sets
- probabilistic context free grammars
- syntactic pattern recognition
- machine learning
- artificial intelligence
- relational databases
- hidden markov models