WINIWARTER, W., KAGAWA, O., and KAMBAYASHI, Y., Syntactic Disambiguation by Using Categorial Parsing in a DOOD Framework, in: Proc. of the German Annual Conference on Artificial Intelligence 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....3.2. Syntactic Analysis Syntactic analysis is only used if two or more semantic categories are so similar that they can only be distinguished by the use of syntactic information. We compute the syntactic structure of a question by using an efficient deductive object oriented parsing algorithm [12], which operates on the basis of a powerful extension of the categorial grammar formalism [2] The result of the syntactic analysis is used to distinguish between the similar semantic categories. This is achieved by applying syntactic disambiguation rules derived from the XSE tree to the ....

WINIWARTER, W., KAGAWA, O., and KAMBAYASHI, Y., Syntactic Disambiguation by Using Categorial Parsing in a DOOD Framework, in: Proc. of the German Annual Conference on Artificial Intelligence 1996.

....the correct semantic category on the basis of DFL and UVL. The representative question for display is computed by means of a generation template which may contain variables to be replaced by the domain specific terms in the UVL. Syntactic analysis is only applied if necessary for disambiguation [9] whereas pragmatic analysis extends the scope of analysis from the isolated question by keeping track of the actual focus in order to deal with missing information due to input referring to previously mentioned questions. In addition to this basic process model the following powerful adaptive ....

. W. Winiwarter, O. Kagawa, and Y. Kambayashi: "Syntactic Disambiguation by Using Categorial Parsing in a DOOD Framework," 20th German Annual Conf. on Artificial Intelligence, pp. 363-375, Sept. 1996.

....4.2. Syntactic Analysis Syntactic analysis is only used if two or more semantic categories are so similar that they can only be distinguished by the use of syntactic information. We compute the syntactic structure of a question by using an efficient deductive object oriented parsing algorithm [17], which operates on the basis of a powerful extension of the categorial grammar formalism [2] Input: douteki roudingu no chousho wa nani ka. What is the strong point of dynamic loading DFL: surface form category subcategory deep form unknown kanji unknown katakana particle modifier noun ....

W. Winiwarter, O. Kagawa, and Y. Kambayashi, Syntactic disambiguation by using categorial parsing in a DOOD framework, in: Proc. of the German Annual Conference on Artificial Intelligence (1996) 363-375.

....in which it is necessary for disambiguation. We compute the syntactic structure of the input by using a powerful extension of the categorial grammar formalism. It supplies the framework for a robust bottom up parser that can also analyse incomplete and ungrammatical sentences efficiently [30]. The module verifies the resulting parsing trees by means of syntactic disambiguation rules to select the correct interpretation. Pragmatic analysis deals with the fact that user input often refers to previously mentioned sentences so that important information is missing. Therefore, the scope of ....

Winiwarter, W., Kagawa, O., Kambayashi, Y.: Syntactic disambiguation by using categorial parsing in a DOOD framework. Proc. of the German Annual Conf. on Artificial Intelligence (1996) 363--375

....a bottom up strategy, i.e. in each parsing step a new constituent is derived and a corresponding manipulation is performed on the tree. The process is repeated until no more successful derivation of a new constituent can be performed. For more details about the parsing of Japanese text see [21]. Figure 4 gives the source syntax tree for the sentence from Fig. 2. Each complex constituent is implemented as an object with references to its subconstituents. The example shows the four most commonly used complex constituent types: verb phrases (JapVP) noun phrases (JapNP) adjectival ....

W. Winiwarter, O. Kagawa, and Y. Kambayashi, "Syntactic Disambiguation by Using Categorial Parsing in a DOOD Framework", Proc. of the German Annual Conf. on Artificial Intelligence, 1996, pp. 363-375.

....situations where it is necessary for disambiguation. We compute the syntactic structure of the input by using a powerful extension of the categorial grammar formalism. It supplies the framework for a robust bottom up parser that can also analyze incomplete and ungrammatical sentences efficiently [13]. The module verifies the resulting parsing tree by means of syntactic disambiguation rules to select the correct interpretation. Pragmatic analysis deals with the fact that user input often refers to previously mentioned questions so that important information is missing. Therefore, we have to ....

W. Winiwarter, O. Kagawa, and Y. Kambayashi, Syntactic Disambiguation by Using Categorial Parsing in a DOOD Framework. In: Proc. of the German Annual Conf. on Artificial Intelligence, 1996, pp. 363-375.

....the input by using Extended Categorial Unification Grammar which provides the framework for a bottom up parser that analyzes also incomplete and ungrammatical sentences efficiently. Syntactic disambiguation rules can then be tested on this output in order to choose the correct interpretation (see [19]) Finally, one last important feature is pragmatic analysis which deals with the fact that questions often refer to previously mentioned questions so that important information is missing. Therefore, the scope of analysis has to be extended from a single sentence to the complete recent user ....

Winiwarter, W., Kagawa, O., Kambayashi, Y.: Syntactic Disambiguation by Using Categorial Parsing in a DOOD Framework. Proc. of the German Annual Conf. on Artificial Intelligence (to appear) This article was processed using the L A T E X macro package with LLNCS style

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC