Hybrid LongDistance Functional Dependency Parsing: A hybrid, deepsyntactic Dependency Grammar parser for English, combining st,Used

Hybrid LongDistance Functional Dependency Parsing: A hybrid, deepsyntactic Dependency Grammar parser for English, combining st,Used

In Stock
SKU: DADAX3838107233
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
Condition: New
Regular price$131.65
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

We propose a robust, hybrid, deepsyntactic dependencybased parser and present its implementation and evaluation. The parser is designed to keep searchspaces small without compromising much on the linguistic performance or adequacy. The resulting parser is deepsyntactic like a formal grammarbased parser while mostly contextfree and fast enough for largescale 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 broadcoverage parsing of unrestricted texts from varied domains. We present a probability model and a combination between a rulebased competence grammar and a statistical lexicalized performance disambiguation model. We treat longdistance dependencies with postprocessing and mild contextsensitivity. 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 grammarbased parsing. The parser has competitive performance and has been applied widely.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed