Difference between revisions of "Parser"
Jump to navigation
Jump to search
Haspelmath (talk | contribs) (Parser (de)) |
m (→References) |
||
| (9 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | A '''parser''' is an abstract machine designed to test the structural integrity of a | + | A '''parser''' is an abstract machine designed to test the structural integrity of a linguistic unit. In contrast to a [[recognizer]], a parser produces a structural description for all well-formed units. |
| − | ==Comments== | + | ===Comments=== |
| − | The behavior of a parser is determined by the (parsing) algorithm | + | The behavior of a parser is determined by the (parsing) algorithm and is based on certain linguistic information (grammar and lexicon in most cases). Most parsers have been developed for the syntactic analysis of sentences. But in general, a parser can be used to analyse the structure of any kind of linguistic unit: a single word, an arbitrary phrase or a complete text. |
| − | ==Subtypes== | + | ===Subtypes=== |
*[[Chart parser]] | *[[Chart parser]] | ||
*[[Deterministic parser]] | *[[Deterministic parser]] | ||
| Line 11: | Line 11: | ||
*[[Tomita parser]] | *[[Tomita parser]] | ||
| − | ==Other Languages== | + | ===References=== |
| + | * Naumann, S. 2005. Probabilistic Parsing. In: Köhler, R., Altmann, G. and Piotrowski, R.C. (eds.) 2005. Handbook of Quantitative Linguistics. Berlin: Springer, 847-56. | ||
| + | |||
| + | * Sikkel, K. 1998. ''Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms.'' EATCS Monographs. Berlin: Springer. | ||
| + | |||
| + | ===Other Languages=== | ||
* German [[Parser (de)|Parser]] | * German [[Parser (de)|Parser]] | ||
{{dc}} | {{dc}} | ||
| − | [[Category:Computational | + | [[Category:Computational Linguistics]] |
Latest revision as of 10:53, 11 July 2007
A parser is an abstract machine designed to test the structural integrity of a linguistic unit. In contrast to a recognizer, a parser produces a structural description for all well-formed units.
Comments
The behavior of a parser is determined by the (parsing) algorithm and is based on certain linguistic information (grammar and lexicon in most cases). Most parsers have been developed for the syntactic analysis of sentences. But in general, a parser can be used to analyse the structure of any kind of linguistic unit: a single word, an arbitrary phrase or a complete text.
Subtypes
References
- Naumann, S. 2005. Probabilistic Parsing. In: Köhler, R., Altmann, G. and Piotrowski, R.C. (eds.) 2005. Handbook of Quantitative Linguistics. Berlin: Springer, 847-56.
- Sikkel, K. 1998. Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms. EATCS Monographs. Berlin: Springer.
Other Languages
- German Parser
