An efficient enumeration algorithm for canonical form underspecified semantic representations (Q2999258)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5887460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient enumeration algorithm for canonical form underspecified semantic representations |
scientific article; zbMATH DE number 5887460 |
Statements
An Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations (English)
0 references
11 May 2011
0 references
formal semantics
0 references
underspecification
0 references
minimal recursion semantics
0 references
canonical form underspecified representation
0 references
0.6926943063735962
0 references
0.6832281947135925
0 references
