Pages that link to "Item:Q3450205"
From MaRDI portal
The following pages link to Polynomially parsable unification grammars (Q3450205):
Displaying 15 items.
- A graph unification machine for NL parsing (Q597235) (← links)
- The expressivity of autosegmental grammars (Q667923) (← links)
- Associative grammar combination operators for tree-based grammars (Q735406) (← links)
- Highly constrained unification grammars (Q1024820) (← links)
- A formal approach to subgrammar extraction for NLP (Q1025681) (← links)
- Finite-state unification automata and relational languages (Q1341772) (← links)
- On the semantics of unification grammars (Q1430209) (← links)
- Unification grammars and off-line parsability (Q1777374) (← links)
- Uniquely parsable unification grammars and their parser implemented in Prolog (Q1841065) (← links)
- A hierarchy of uniquely parsable grammar classes and deterministic acceptors (Q1920229) (← links)
- Unification grammars. (Q2891521) (← links)
- (Q3787517) (← links)
- Primal grammars and unification modulo a binary clause (Q5210779) (← links)
- Learning Theory and Kernel Machines (Q5305886) (← links)
- Mechanizing Mathematical Reasoning (Q5717446) (← links)