ACL RD-TEC 1.0 Summarization of P90-1035
Paper Title:
DETERMINISTIC LEFT TO RIGHT PARSING OF TREE ADJOINING LANGUAGES
DETERMINISTIC LEFT TO RIGHT PARSING OF TREE ADJOINING LANGUAGES
Authors: Schabes, Yves and Vijay-Shanker, K.
Primarily assigned technology terms:
- algorithm
- automaton
- bottom-up parser
- computing
- deterministic parsing
- finite state
- finite state automaton
- finite state control
- language processing
- lr parsing
- lr parsing algorithm
- natural language processing
- non-deterministic automata
- parser
- parsers
- parsing
- parsing algorithm
- processing
- pushdown automaton
- reading
- recognition
- state automaton
- tree traversal
Other assigned terms:
- adjunction
- automata
- auxiliary tree
- case
- characters
- concepts
- context free grammars
- derivation
- dutch
- elementary tree
- fact
- formalisms
- grammar
- grammars
- input string
- leaf
- lookahead
- natural language
- natural languages
- null adjunction constraint
- parse
- parsing strategy
- parsing table
- root node
- style
- subclass
- subtree
- symbol
- symbols
- tags
- tokens
- tree
- tree structure
- trees
