Ulrich Callmeier. PET. A platform for experimentation with ecient HPSG processing techniques. Natural Language Engineering, 6(1):99{ 108, March 2000. Special Issue on Ecient processing with HPSG: Methods, systems, evaluation.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for free the Prolog environment as a host layer, in which the user can test and extend di erent (eventually already available) parsing strategies. The advantage in this approach is the exibility the user has to choose the most suitable parser for his needs. 2. LKB [9] TDL PAGE [15] PET [5] as interpreters on one side, and Amalia [22] 23] and ABC Light as compilers on the other side have opted for built in parsers. The advantage is (presumably) the speed up due to the dedicated implementation of the parser; the disadvantage: as soon as the user wants to change adjust the parser, he ....

.... X[0] ARGS, X[1] 1, W1, vp intersect sort X[1] cons S1 test inst list X[1] 2, W2 get first X[1] X[2] intersect sort X[2] verb test feature X[2] HEAD, X[3] 3, W3, verb R1: test feature X[2] OBJECT, X[4] 3, W4, verb intersect sort X[4] np R2: test feature X[2] SUBJECT, X[5], 3, W5, verb R3: get rest X[1] X[6] S2 intersect sort X[6] cons test inst list X[6] 3, W7 unify first X[6] X[4] test NIL rest X[6] S3 R4: unify feature X[0] HEAD, X[3] LHS read unify feature X[0] SUBJECT, X[5] R5: jump W8 W0: push cell X[0] dead code set sort X[0] vp ....

[Article contains additional citation context not shown here]

U. Callmeier. PET | a platform for experimentation with ecient HPSG processing techniques. Journal of Natural Language Engineering, 6 (1) (Special Issue on Ecient Processing with HPSG):99-108, 2000.

....if for any non atomic subterm of a (t) if the root sort of is s, then v (s) A term is said to be non atomic (or: framed) if it contains at least one feature. These numbers were (computed after data) obtained and published by U. Callmeier, a former contributor to the LIGHT project [6]. A well typed OSF theory is an order consistent theory in which the following conditions are satis ed for any s; t 2 S: i. if f 2 Arity(s) f 2 Arity(t) then 9u 2 S, such that s u; t u and f 2 Arity(u) ii. for every subterm in (t) such that root( s, if a feature f is de ned ....

.... subsumption condition limited to non atomic substructures : if root( s, then v (s) For instance, if a[F cons] is type consistent, its well typed correspondent is a[F cons[FIRST top, REST list] This (more relaxed) condition has been proved to be bene cial for LinGOlike grammars [6], since it lead to a both signi cant reduction of the expanded size of the grammar and the parsing time (due to reduction of copying and other structure manipulation operations) without needing a stronger notion of uni cation. If the lub (least upper bound) of any two sorts exists and is ....

[Article contains additional citation context not shown here]

U. Callmeier. PET | a platform for experimentation with ecient HPSG processing techniques. Journal of Natural Language Engineering, 6 (1) (Special Issue on Ecient Processing with HPSG):99-108, 2000.

....a CFG lter which leads to practical results comparable to (the best of) the other systems but, up to our knowledge, it is much more memory consuming. For PET, the reportedly fastest system running LinGO, the author reports a factor of speed up of about 63 after the introduction of the QC test [2]. The present paper deals with getting a compiled form of the QC lter, suitable for an elegant and ecient integration with compilers for uni cation based grammars. Making it simple, the idea behind the pre uni cation QC test is the following: Having got the knowledge about the most ....

....where s = root( 2. If is a rule argument with references to substructures of the precedent arguments, X is the set of all variables tags in which refer to precedents arguments (according to the parsing order) and Our claim that this Remark invalidates the the opinion of PET s author [2] who stated that partial expansion [6] is reducing the quick check s eciency. Here the term precedent is used in the sense of the parsing order. sentence [ ARGS vp [ HEAD #1:verb [ AGREEMENT #3:agr ] OBJECT np ] #2:np [ HEAD noun [ AGREEMENT #3 ] HEAD #1, SUBJECT #2 ] ....

U. Callmeier. PET | a platform for experimentation with ecient HPSG processing techniques. Journal of Natural Language Engineering, 6 (1) (Special Issue on Ecient Processing with HPSG):99-108, 2000.

....values of these paths inside the two FSs to be uni ed. If such a pair of values is eventually if their root sorts are incompatible, then certainly the two FSs don t unify. The QC lter rules out many of the uni cations, and speeds up considerably the parsing around 63 for the PET system [4], and 42 for the Lightcompiler [8] The e ectiveness of the QC pre uni cation technique resides in the fact that there is a relatively reduced number of failure paths inside rule FSs. Using the Light system, we identi ed 148 failure paths on the CSLI test suite, out of the total of 494 paths ....

U. Callmeier. PET | a platform for experimentation with ecient HPSG processing techniques. HPSG):99-108, 2000.

....on compilation of typed feature structures into Prolog terms) Up to our knowledge, the only compilers on which LinGO was tested until now are LiLFeS and ABC Light. Among the di erent interpreters dealing with LinGO LKB [ Copestake, 1999 ] TDL PAGE [ Krieger and Sch afer, 1994 ] and PET [ Callmeier, 2000 ] the last one imported the expansion conception rst implemented in ABC Light. While the other compilers relate very much to the typed feature structure theory [ Carpenter, 1992 ] the ABC Light system was elaborated with the OSF logic constraint theory in mind. The two theories were ....

.... extension close to expansion to further built up the notion of unextension in a framework allowing for the use of disjunction [G otz, 1994] corresponding type; we limit this request only to non atomic nodes; 3 this notion has already been proved to be bene cial for LinGO like grammars [ Callmeier, 2000 ] since it lead to a both signi cant reduction of the expanded size of the grammar and the parsing time (due to reduction of copying or other structure manipulation operations during uni cation) While expansion in [ Krieger and Sch afer, 1995 ] is designed to work in a unitary (however ....

U. Callmeier. PET | a platform for experimentation with ecient hpsg processing techniques. Journal of Natural Language Engineering, 6 (1) (Special Issue on Ecient Processing with HPSG):99-108, 2000.

No context found.

Ulrich Callmeier. PET. A platform for experimentation with ecient HPSG processing techniques. Natural Language Engineering, 6(1):99{ 108, March 2000. Special Issue on Ecient processing with HPSG: Methods, systems, evaluation.

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