DocumentCode
3229484
Title
A Parsing Model Based on Ordered Tree Inclusion Matching
Author
Yang, Xiao ; Jiancheng Wan ; Tan, Fang
Author_Institution
Shandong Univ., Jinan
Volume
3
fYear
2007
fDate
July 30 2007-Aug. 1 2007
Firstpage
348
Lastpage
353
Abstract
In order to integrate the context and linguistic information into the parsing model in a holistic and strict way, and to describe the complex structure more precisely, a parsing model is proposed to visually take the above information into account. Considering that the functional words and the words with special usage can have a profound impact on the syntactic structure, some patterns are built especially for them, and the probabilities of patterns are pre-computed and stored. The matching between partial parse and pattern is based on the ordered tree inclusion, and the probability of parse tree is computed on the basis of the matched patterns. It is plausible to match and retrieve the probability from the pattern bank for there are many algorithms with linear space and time spent for ordered tree inclusion problem. The method can provide a vivid, strict and somewhat fuzzy restriction for the complex structures modeling.
Keywords
grammars; probability; trees (mathematics); context information; linguistic information; ordered tree inclusion matching; parse tree probability; parsing model; Artificial intelligence; Computer science; Context modeling; Distributed computing; Hardware; Learning systems; Machine learning; Pattern matching; Software engineering; Space technology;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on
Conference_Location
Qingdao
Print_ISBN
978-0-7695-2909-7
Type
conf
DOI
10.1109/SNPD.2007.370
Filename
4287876
Link To Document