An efficient enumeration algorithm for canonical form underspecified semantic representations

DOI10.1007/978-3-642-20169-1_6MaRDI QIDQ2999258zbMATH OpenOpenAlexFDO

Authors

Publication date 11 May 2011

Published in Formal Grammar (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20169-1_6

zbMATH Keywords

canonical form underspecified representationformal semanticsminimal recursion semanticsunderspecification

Mathematics Subject Classification ID

Natural language processing (68T50) Linguistics (91F20)

Recommendations

• scientific article; zbMATH DE number 1421199
• scientific article; zbMATH DE number 1794690
• Processing underspecified semantic representations in the constraint language for lambda structures
• scientific article; zbMATH DE number 1794693
• Relaxing underspecified semantic representations for reinterpretation

This page was built for publication: An efficient enumeration algorithm for canonical form underspecified semantic representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999258)