Parser - Revision history

NaumSven: /* References */

2007-07-11T10:53:24Z

References

← Older revision		Revision as of 10:53, 11 July 2007
Line 14:		Line 14:
	* 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.		* 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.		* Sikkel, K. 1998. ''Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms.'' EATCS Monographs. Berlin: Springer.

	===Other Languages===		===Other Languages===

2007-07-11T10:52:56Z

References

← Older revision		Revision as of 10:52, 11 July 2007
Line 12:		Line 12:

	===References===		===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.		* Sikkel, K. 1998. Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms. EATCS Monographs. Berlin: Springer.

2007-07-11T10:44:53Z

References

← Older revision		Revision as of 10:44, 11 July 2007
Line 12:		Line 12:

	===References===		===References===
	* K~~. Sikkel~~. 1998. Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms. EATCS Monographs. Berlin: Springer.		* Sikkel, K. 1998. Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms. EATCS Monographs. Berlin: Springer.

	===Other Languages===		===Other Languages===

2007-07-11T10:43:38Z

← Older revision		Revision as of 10:43, 11 July 2007
Line 10:		Line 10:
	*[[Stochastic parser]]		*[[Stochastic parser]]
	*[[Tomita parser]]		*[[Tomita parser]]

			===References===
			* K. Sikkel. 1998. Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms. EATCS Monographs. Berlin: Springer.

	===Other Languages===		===Other Languages===

2007-07-09T15:48:53Z

Other Languages

← Older revision		Revision as of 15:48, 9 July 2007
Line 11:		Line 11:
	*[[Tomita parser]]		*[[Tomita parser]]

	==Other Languages==		===Other Languages===
	* German [[Parser (de)\|Parser]]		* German [[Parser (de)\|Parser]]

	{{dc}}		{{dc}}
	[[Category:Computational Linguistics]]		[[Category:Computational Linguistics]]

2007-07-09T15:48:24Z

Subtypes

← Older revision		Revision as of 15:48, 9 July 2007
Line 4:		Line 4:
	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.		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]]

2007-07-09T15:48:13Z

Comments

← Older revision		Revision as of 15:48, 9 July 2007
Line 1:		Line 1:
	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.		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 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.		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.

2007-07-06T22:14:47Z

Comments

← Older revision		Revision as of 22:14, 6 July 2007
Line 2:		Line 2:

	==Comments==		==Comments==
	The behavior of a parser is determined by the (parsing) algorithm it is based on ~~and~~ certain linguistic information (grammar and lexicon in most cases). Most ~~parser~~ have been developed for the syntactic analysis on 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.		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==

2007-07-06T22:13:20Z

← Older revision		Revision as of 22:13, 6 July 2007
Line 1:		Line 1:
	A '''parser''' is an abstract machine designed to test the structural integrity of a ~~linguistics~~ unit. In contrast to a [[recognizer]], a parser ~~outputs~~ a structural description for all well-formed units.		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==

2007-07-06T18:01:21Z

Other Languages

← Older revision		Revision as of 18:01, 6 July 2007
Line 15:		Line 15:

	{{dc}}		{{dc}}
	[[Category:Computational ~~linguistics~~]]		[[Category:Computational Linguistics]]