"Rule-based morphological disambiguation: On computational complexity of ..."

Pavel Kveton (2006)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2012-05-25

- no documents available
- export record
  dblp key:
  - journals/pbml/Kveton06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pbml/Kveton06
Pavel Kveton:
Rule-based morphological disambiguation: On computational complexity of the LanGR formalism. Prague Bull. Math. Linguistics 85: 57-72 (2006)

a service of

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.