The complexity of finding the maximum spanning DAG and other restrictions for DAG parsing of natural language.
Natalie SchluterPublished in: *SEM@NAACL-HLT (2015)
Keyphrases
- natural language
- directed acyclic graph
- directed acyclic
- natural language processing
- worst case
- linguistic analysis
- language understanding
- computational complexity
- question answering
- machine learning
- context sensitive
- natural language interface
- natural language generation
- computational cost
- directed graph
- semantic analysis
- conceptual graphs
- unsupervised learning
- information extraction
- knowledge representation
- intermediate representation
- natural language sentences
- natural language parsing
- highly ambiguous
- information systems