Pages that link to "Item:Q1902598"
From MaRDI portal
The following pages link to Computational complexity of syntactic agreement and lexical ambiguity (Q1902598):
Displaying 9 items.
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- A fuzzy approach to classification of text documents (Q1412148) (← links)
- A syntactic view of computational adequacy (Q1652968) (← links)
- Computational consequences of agreement and ambiguity in natural language (Q1812775) (← links)
- Computational complexity of probabilistic disambiguation (Q1850934) (← links)
- A nested combinatorial-states model of sentence processing (Q2758813) (← links)
- COMPUTATIONAL COMPLEXITY THEORY AND NATURAL LANGUAGE: A PARADOX RESOLVED (Q3361909) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- MEASURING LANGUAGE (Q4655573) (← links)