TORISAWA K., TSUJII J., "Computing phrasal-signs in HPSG prior to parsing", Proc. of the 16th COLING, 1996, p. 949--955.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....grammar. We aim at constructing a framework and an environmentbTBL on HPSG in order to develop several NLP techniques on them, including knowledge acquisition, machine translation and information extraction. To accomplish our aims, Torisawa developed an efficient two phased HPSG parsing algorithm[3]. The key ideas of Torisawa s algorithm are compilation of HPSG and a two phased parsing technique. Atthe compile time, the lexical entries in HPSG are compiled into CFG rules. At Phase 1, a parser enumerates possibT parse trees usingb ottom up chart parsing for CFG which isobT7 L , b y the ....

Kentaro Torisawaand Jun'ichi Tsujii. Computing phrasal-signs in HPSG prior to parsing. In COLING 96, pages 949--955, 1996.

.... Poznanski, 1999) In 1998, the grammar formalisms and parsing group at Tokyo University 5 joined the consortium and now supplies additional expertise on (abstract machine based) compilation of typed feature structures, Japanese hpsg, and grammar transformation and approximation techniques (Torisawa Tsujii, 1996; Makino, Yoshida, Torisawa, Tsujii, 1998; Tateisi, Torisawa, Miyao, Tsujii, 1998) The primary goal of this multilateral collaboration is to synchronize e orts on the development and deployment of ecient, large scale hpsg processors, thereby enhancing the e ectiveness of each group in doing ....

Torisawa, K., & Tsujii, J. (1996). Computing phrasal signs in HPSG prior to parsing. In Proceedings of the 16th International Conference on Computational Linguistics (pp. 949 - 955). Kopenhagen, Denmark.

No context found.

TORISAWA K., TSUJII J., "Computing phrasal-signs in HPSG prior to parsing", Proc. of the 16th COLING, 1996, p. 949--955.

....tried in the domain of human language ability. Researchers of linguistics have tried to clarify the computational theory of language [7, 26, 42] The representations and algorithms are studied in computational linguistics, to successfully show various e#cient algorithms of linguistic computation [24, 49, 57, 48]. 14 However, it is not sure that the research of language goes well with this research program as the research of vision does. Although current studies suppose that a linguistic process is divided into several stages as in the process of vision, researchers of neurolinguistics are still unable ....

Kentaro Torisawa and Jun'ichi Tsujii. Computing phrasal-signs in HPSG prior to parsing. In Proceedings of the 16th International Conference on Computational Linguistics, pages 949--955, 1996. (cited in page 14)

....of the number of edges between Naive and Naivery tell that the difference of the factoring scheme was the major cause of difference of the empirical time complexity. The other factor is the effective CFG filter ing. TNT filters out most impossible partial parse trees by using a compiled CFG [21, 22] 1. While Poller and Becker suggest a CFG filtering for LTAG parsing [ CFG filtering for HPSG parsing has an advantage over their method. Their method extracts CFG from an LTAG grammar by regarding each branching in an elementary tree as a CFG rule, that is, non terminal symbols of CFG ....

Kentaro Torisawa and Jun'ichi Tsujii. Comput- ing phrasal-signs in HPSG prior to parsing. In Proc. of COLING '96, pages 949-955, 1996.

No context found.

Kentaro Torisawa and Jun'ichi Tsujii. 1996. Computing phrasal-signs in HPSG prior to parsing. to appear in Coling 96.

....between our work and theirs after presenting our method. Section 2 de nes notations used in this paper and formalize a simple parsing process without CFG ltering as a function. In section 3, the function is transformed by using the idea of trunks. Section 4 introduces lexical entry automata (Torisawa Tsujii, 1996), which enable us to compute trunks before parsing. CFGs are generated from the lexical entry automata. In Section 5, we outline the implementation of our parsing scheme with ltering using these CFGs. Section 6 reports experimental results showing that this scheme improves parsing speed. Section ....

....4 Lexical entry automata and conversion to CFG The problem we faced in the last section is that we might not be able to compute S 0 k T runk(w; k) because S 0 k T runk(w; k) may contain in nitely tall trunks. This section introduces automaton like structures called lexical entry automata (Torisawa Tsujii, 1996) for solving this problem. Lexical entry automata enable us to approximate possibly in nitely tall trunks with a nite set of feature structures, which can be computed in a nite amount of time. A lexical entry automaton is a tuple hQ; A; q 0 i where Q is a set of states, A is 72 Kentaro Torisawa ....

Torisawa, K., & Tsujii, J. (1996). Computing phrasal signs in HPSG prior to parsing. In Proceedings of the 16th International Conference on Computational Linguistics (pp. 949 - 955). Kopenhagen, Denmark.

No context found.

Kentaro Torisawa and Jun'ichi Tsujii. 1996. Computing phrasal-signs in HPSG prior to parsing. In Proc. 16th COLING, pages 949--955.

.... HPSG Parsing Algorithm with Array Unification Kenji Nishida, Kentaro Torisawa and Jun ichi Tsujii nishiken, torisawa, tsujii is.s.u tokyo.ac.jp Tsujii Group, Graduate School of Science, University of Tokyo 7 3 1,Hongo,Bunkyo ku,Tokyo,Japan Abstract This paper presents a method for improving parsing performance of parsers for HPSG. The method was obtained by extending Torisawa s ....

Kentaro Torisawa and Jun'ichi Tsujii. 1996. Computing phrasal-signs in HPSG prior to parsing. In COLING 96, pages 949--955.

....grammar. We aim at constructing a framework and an environment based on HPSG in order to develop several NLP techniques on them, including knowledge acquisition, machine translation and information extraction. To accomplish our aims, Torisawa developed an efficient two phased HPSG parsing algorithm[3]. The key ideas of Torisawa s algorithm are compilation of HPSG and a two phased parsing technique. At the compile time, the lexical entries in HPSG are compiled into CFG rules. At Phase 1, a parser enumerates possible parse trees using bottom up chart parsing for CFG which is obtained by the ....

Kentaro Torisawa and Jun'ichi Tsujii. Computing phrasal-signs in HPSG prior to parsing. In COLING 96, pages 949--955, 1996.

No context found.

Kentaro Torisawa and Jun'ichi Tsujii. 1996. Computing phrasal-signs in HPSG prior to parsing. In COLING-96, pages 949--955, August.

No context found.

Kentaro Torisawa and Jun'ichi Tsujii. 1996. Computing phrasal-signs in HPSG prior to parsing.

No context found.

Kentaro Torisawa and Jun'ichi Tsujii. 1996. Computing phrasal-signs in HPSG prior to parsing. In 16th International Conference on Computational Linguistics (COLING-96), pages 949--955, Copenhagen.

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