| W97-1013 | the sentence . On average the | partial-parser | reduces the space by 4.33 times |
| W97-1013 | tree-bank . This TSG is employed as a | partial-parser | ( other implementations are discussed |
| W97-1013 | which were recognized as by the | partial-parser | . • In the default case |
| W97-1013 | . Firstly , the fact that the | partial-parser | is currently implemented as a |
| W97-1013 | method by combining the learned | partial-parsers | with a T-parser ( i.e. CFG ) |
| W97-1013 | elementary-trees in the table for the | Partial-Parser | does not include the lex - icon |
| W97-1013 | Data-Oriented Parsing sults in a | partial-parser | rather than a specialized parser |
| W97-1013 | PA-SSFs into consideration . The | partial-parser | is implemented as a parser for |
| W97-1013 | partial-trees provided by the | partial-parser | in ways that do not cross recognized |
| W97-1013 | training examples . 4 Learning | partial-parsers | We assume a tree-bank representing |
| W97-1013 | stages : firstly it employs the | partial-parser | for parsing the input sentence |
| W97-1013 | constituents , recognized by the | partial-parser | , and to recognizing unrecognized |
| W97-1013 | parsing algorithm combines a learned | partial-parser | with a given full - parser such |
| W97-1013 | an EBL algorithm for learning | partial-parsers | , and a parsing algorithm which |
| W97-1013 | learning curves of the Retreating | partial-parser | , show that from a certain point |
| W97-1013 | Younger , 1967 ) ) . However , the | partial-parser | can be implemented as a Cascade |
| W97-1013 | specializes parsers by inferring | partial-parsers | , and 2 ) refines existing stochastic |
| W97-1013 | deeper structures assigned by the | Partial-Parser | rather than really wrong structures |
| W97-1013 | " full-parsers " . The learned | partial-parsers | , implementable as Cascades of |
| W97-1013 | of symbols is recognized by the | partial-parser | then it is highly probable that |
