Algorithm Research Chinese Statement With Flexible Word Order

With the advent of big data and the rapid development of the Internet, information processing in natural language processing plays an important role. Many things in our lives are inseparable from the natural language processing, such as machine translation, intelligent response, and semantic search, etc. Now the natural language processing has shifted from syntactic/lexical level to lightweight semantic level. As for the natural language processing in Chinese statement, the traditional method is using statistical methods based on probabilistic model and semantics of logical method. But the statistics methods based on probability cannot implement the semantics of natural language processing, while the logical method which emphasis on semantics too much makes complexity increased considerably. For the traditional methods based on logic, natural language processing generally uses the Lambek calculus. However, Lambek calculus lacks three structure rules that are contraction, weakening and exchange, so it cannot solve the problem of flexible word order in Chinese statement. For the problem of Lambek calculus which cannot process the flexible word order in Chinese statement, the present methods, such as adding modal words or new conjunctions, are not suitable for computer processing because they will increase the complexity of the NP-hard Lambek calculus.Based on this, we put forward a Lambek calculus of verb matching with marks. And we mark (preprocess) the syntax types in Lambek calculus, then it can process the flexible word order in Chinese statement. In addition, the time complexity of the algorithm of verb matching with marks is low, it does not change its complexity in the Lambek calculus, so the computer and its program can be effective to deal with the flexible word order in Chinese statement. What’s more, Lambek calculus has many advantages in natural language processing and it is a model with context-free, algebra and relation. In addition, the Lambek calculus can process lightweight semantic through Curry-Howard correspondence and λ calculus. The λ calculus is a formal system put forward by Alonzo Church and Stephen Cole Kleene which is used for mathematical definition, function application and recursive computation. And the λ calculus can describe the semantic model in natural language processing. So, we also put forward λ-Lambek calculus. Then we process the flexible word order in Chinese statement, while we research the lightweight semantic and build the semantic tree model.Through the Lambek calculus of verb matching with marks, this paper realize the processing of Chinese statements with flexible word order. And Through the X-Lambek calculus, this paper has the lightweight semantic research on Chinese statements and their flexible word order. In addition, through the experiment, we prove the validity of these two methods, which plays an important role on natural language processing such as Chinese statements.