Complexity and learnability in the explanation of semantic universals of quantifiers.
Iris van de PolShane Steinert-ThrelkeldJakub SzymanikPublished in: CogSci (2019)
Keyphrases
- vapnik chervonenkis dimension
- natural language
- computational complexity
- semantic knowledge
- semantic information
- learning algorithm
- semantic similarity
- semantic annotation
- semantic web
- domain specific
- semantic analysis
- semantic representation
- data sets
- low level features
- inductive logic programming
- worst case
- boolean functions
- space complexity
- decision trees
- natural language understanding
- finite automata