DocumentCode :
420958
Title :
A Pr/T-Net model for context-free language parsing
Author :
Xu, Erqing
Author_Institution :
Dept. of Linguistics, Zhejiang Univ., Hangzhou, China
Volume :
3
fYear :
2004
fDate :
15-19 June 2004
Firstpage :
1919
Abstract :
This paper presents a Context-Free Grammar-Predicate/Transition-Net (CFG-Pr/T-Net) model for the parsing of context-free language. The places are defined to represent the states of the parsing process. The conditions and actions carried by the transitions are defined such that non-terminal symbols being processed can be rewritten and the derivation can be made to grow. Data structures, as the personalities of the token, are defined such that the growing derivation can be stored in the token. An application example was examined and the result shows that the Pr/T-Net model can do syntactic parsing successfully. The CFG-Pr/T-Net overcomes the limitation of pushdown automata, which only judged whether a string belonged to a given context free language, but were not able to answer the question concerning syntactic structure.
Keywords :
Petri nets; context-free grammars; context-free languages; data structures; pushdown automata; context free grammar; context free language parsing process; data structures; nonterminal symbols; petri nets; predicate-transition net model; pushdown automata limitation; syntactic parsing; Artificial intelligence; Automata; Context modeling; Data structures; Fires; Natural languages; Petri nets; Production;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN :
0-7803-8273-0
Type :
conf
DOI :
10.1109/WCICA.2004.1341913
Filename :
1341913
Link To Document :
بازگشت