Optimal linear-time parallel parser for tree adjoining languages

Keyphrases

• Tree Adjoining Grammar 100%
• Tree Adjoining Languages 100%
• Linear Time 100%
• Parallel Parsing 100%
• Context-free Grammar 66%
• Parsing 33%
• Natural Language 33%
• Parsing Algorithm 33%
• Grammar 33%
• Parallel Algorithm 33%
• Time Complexity 33%
• Finite State 33%
• Context-free 33%
• Grammatical Systems 33%
• Parallel Recognition 33%

Computer Science

• Context-Free Grammars 100%
• Parsing 100%
• Dimensional Array 50%
• Time Complexity 50%
• Parallel Algorithm 50%