We propose a robust, hybrid, deep-syntactic dependency-based parser and present its implementation and evaluation. The parser is designed to keep search-spaces small without compromising much on the linguistic performance or adequacy. The resulting parser is deep-syntactic like a formal grammar-based parser while mostly context-free and fast enough for large-scale application. It combines successful current approaches into a hybrid, modular and open model. We suggest, implement, and evaluate a parsing architecture that is fast, robust and efficient enough to allow users to do broad-coverage parsing of unrestricted texts from varied domains. We present a probability model and a combination between a rule-based competence grammar and a statistical lexicalized performance disambiguation model. We treat long-distance dependencies with post-processing and mild context-sensitivity. We conclude that labelled Dependency Grammar is sufficiently expressive for linguistically adequate parsing. We argue that our parser covers the middle ground between statistical parsing and formal grammar-based parsing. The parser has competitive performance and has been applied widely.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Dr. Gerold Schneider has studied English and ComputationalLinguistics. He took his doctoral degree in 2008, at University of Zurich. He wasassistant in Geneva and is now computing scientist and corpus linguist at the EnglishDepartment of the University of Zurich. His research includes Natural LanguageProcessing and Descriptive Linguistics.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -We propose a robust, hybrid, deep-syntactic dependency-based parser and present its implementation and evaluation. The parser is designed to keep search-spaces small without compromising much on the linguistic performance or adequacy. The resulting parser is deep-syntactic like a formal grammar-based parser while mostly context-free and fast enough for large-scale application. It combines successful current approaches into a hybrid, modular and open model. We suggest, implement, and evaluate a parsing architecture that is fast, robust and efficient enough to allow users to do broad-coverage parsing of unrestricted texts from varied domains. We present a probability model and a combination between a rule-based competence grammar and a statistical lexicalized performance disambiguation model. We treat long-distance dependencies with post-processing and mild context-sensitivity. We conclude that labelled Dependency Grammar is sufficiently expressive for linguistically adequate parsing. We argue that our parser covers the middle ground between statistical parsing and formal grammar-based parsing. The parser has competitive performance and has been applied widely. 304 pp. Deutsch. N° de réf. du vendeur 9783838107233
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. We propose a robust, hybrid, deep-syntactic dependency-based parser and present its implementation and evaluation. The parser is designed to keep search-spaces small without compromising much on the linguistic performance or adequacy. The resulting parser i. N° de réf. du vendeur 5405110
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -We propose a robust, hybrid, deep-syntactic dependency-based parser and present its implementation and evaluation. The parser is designed to keep search-spaces small without compromising much on the linguistic performance or adequacy. The resulting parser is deep-syntactic like a formal grammar-based parser while mostly context-free and fast enough for large-scale application. It combines successful current approaches into a hybrid, modular and open model. We suggest, implement, and evaluate a parsing architecture that is fast, robust and efficient enough to allow users to do broad-coverage parsing of unrestricted texts from varied domains. We present a probability model and a combination between a rule-based competence grammar and a statistical lexicalized performance disambiguation model. We treat long-distance dependencies with post-processing and mild context-sensitivity. We conclude that labelled Dependency Grammar is sufficiently expressive for linguistically adequate parsing. We argue that our parser covers the middle ground between statistical parsing and formal grammar-based parsing. The parser has competitive performance and has been applied widely.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 304 pp. Deutsch. N° de réf. du vendeur 9783838107233
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - We propose a robust, hybrid, deep-syntactic dependency-based parser and present its implementation and evaluation. The parser is designed to keep search-spaces small without compromising much on the linguistic performance or adequacy. The resulting parser is deep-syntactic like a formal grammar-based parser while mostly context-free and fast enough for large-scale application. It combines successful current approaches into a hybrid, modular and open model. We suggest, implement, and evaluate a parsing architecture that is fast, robust and efficient enough to allow users to do broad-coverage parsing of unrestricted texts from varied domains. We present a probability model and a combination between a rule-based competence grammar and a statistical lexicalized performance disambiguation model. We treat long-distance dependencies with post-processing and mild context-sensitivity. We conclude that labelled Dependency Grammar is sufficiently expressive for linguistically adequate parsing. We argue that our parser covers the middle ground between statistical parsing and formal grammar-based parsing. The parser has competitive performance and has been applied widely. N° de réf. du vendeur 9783838107233
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Hybrid Long-Distance Functional Dependency Parsing | A hybrid, deep-syntactic Dependency Grammar parser for English, combining statistical performance and formal grammar-based competence approaches | Gerold Schneider | Taschenbuch | 304 S. | Deutsch | 2015 | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838107233 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 101546976
Quantité disponible : 5 disponible(s)