"Computing the Most Probable Parse for a Discontinuous Phrase Structure ..."

Oliver Plaehn (2000)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-06

- view
  - electronic edition @ aclanthology.org (open access)
- export record
  dblp key:
  - conf/iwpt/Plaehn00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpt/Plaehn00
Oliver Plaehn:
Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar. IWPT 2000: 195-206

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.